Submission #8810011

Source Code Expand

N, M = gets.split.map(&:to_i)
queries = M.times.map { gets.split.map(&:to_i) }

counter = Hash.new(0)

queries.each do |a, b|
  counter[a] += 1
  counter[b] += 1
end

if counter.values.all? { |n| n.even? }
  puts 'YES'
else
  puts 'NO'
end

Submission Info

Submission Time
Task B - Unplanned Queries
User siman
Language Ruby (2.3.3)
Score 500
Code Size 255 Byte
Status AC
Exec Time 201 ms
Memory 15868 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 20
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 AC 199 ms 15868 KB
in10.txt AC 189 ms 14076 KB
in11.txt AC 174 ms 10236 KB
in12.txt AC 190 ms 14076 KB
in13.txt AC 184 ms 14076 KB
in14.txt AC 201 ms 15868 KB
in15.txt AC 7 ms 1788 KB
in16.txt AC 7 ms 1788 KB
in2.txt AC 199 ms 15868 KB
in3.txt AC 201 ms 15868 KB
in4.txt AC 199 ms 15868 KB
in5.txt AC 198 ms 15868 KB
in6.txt AC 189 ms 14076 KB
in7.txt AC 189 ms 14076 KB
in8.txt AC 189 ms 14076 KB
in9.txt AC 190 ms 14076 KB
sample1.txt AC 7 ms 1788 KB
sample2.txt AC 7 ms 1788 KB