Submission #3219810

Source Code Expand

n,m = gets.split.map(&:to_i)
dig = Array.new(n+1,0)
m.times do
  a,b = gets.split.map(&:to_i)
  dig[a] += 1
  dig[b] += 1
end
puts dig.all?{|i|i%2 == 0} ? "YES" : "NO"

Submission Info

Submission Time
Task B - Unplanned Queries
User koikotya
Language Ruby (2.3.3)
Score 500
Code Size 174 Byte
Status AC
Exec Time 153 ms
Memory 2556 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 141 ms 2556 KB
in10.txt AC 148 ms 2556 KB
in11.txt AC 138 ms 1788 KB
in12.txt AC 148 ms 2556 KB
in13.txt AC 139 ms 2556 KB
in14.txt AC 139 ms 2556 KB
in15.txt AC 7 ms 1788 KB
in16.txt AC 7 ms 1788 KB
in2.txt AC 145 ms 2556 KB
in3.txt AC 143 ms 2556 KB
in4.txt AC 143 ms 2556 KB
in5.txt AC 144 ms 2556 KB
in6.txt AC 147 ms 2556 KB
in7.txt AC 153 ms 2556 KB
in8.txt AC 153 ms 2556 KB
in9.txt AC 148 ms 2556 KB
sample1.txt AC 7 ms 1788 KB
sample2.txt AC 7 ms 1788 KB