Submission #1268559

Source Code Expand

(let* ((n (read))
      (m (read))
      (edges (loop repeat n collect 0)))
  (loop for i from 1 to m
     do
       (let ((a (read))
	     (b (read)))
	 (incf (nth (- a 1) edges))
	 (incf (nth (- b 1) edges))))
  (format t "~:[NO~;YES~]" (every #'evenp edges)))

Submission Info

Submission Time
Task B - Unplanned Queries
User noorbeh
Language Common Lisp (SBCL 1.1.14)
Score 0
Code Size 271 Byte
Status TLE
Exec Time 2105 ms
Memory 57696 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
AC × 6
TLE × 14
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt TLE 2104 ms 24928 KB
in10.txt TLE 2104 ms 24932 KB
in11.txt TLE 2105 ms 57696 KB
in12.txt TLE 2104 ms 24936 KB
in13.txt TLE 2104 ms 24936 KB
in14.txt TLE 2104 ms 24932 KB
in15.txt AC 20 ms 6500 KB
in16.txt AC 20 ms 6496 KB
in2.txt TLE 2104 ms 24932 KB
in3.txt TLE 2104 ms 24936 KB
in4.txt TLE 2104 ms 24928 KB
in5.txt TLE 2104 ms 24936 KB
in6.txt TLE 2104 ms 24932 KB
in7.txt TLE 2104 ms 24932 KB
in8.txt TLE 2104 ms 24936 KB
in9.txt TLE 2104 ms 24932 KB
sample1.txt AC 20 ms 6496 KB
sample2.txt AC 20 ms 6500 KB