Submission #1732471
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> #include <map> #include <cmath> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #include <stdlib.h> #include <stdio.h> #include <bitset> #include <cstring> #include <deque> using namespace std; #define FOR(I,A,B) for(int I = (A); I < (B); ++I) #define CLR(mat) memset(mat, 0, sizeof(mat)) typedef long long ll; int main() { ios::sync_with_stdio(false); cin.tie(0); int N, M; cin >> N >> M; int cnt[N+1]; CLR(cnt); FOR(i,0,M) { int a, b; cin >> a >> b; cnt[a]++; cnt[b]++; } FOR(i,1,N+1) { if(cnt[i] % 2 == 1) { cout << "NO" << endl; return 0; } } cout << "YES" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Unplanned Queries |
User | nenuon |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 787 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
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 | 17 ms | 640 KB |
in10.txt | AC | 17 ms | 640 KB |
in11.txt | AC | 16 ms | 256 KB |
in12.txt | AC | 17 ms | 640 KB |
in13.txt | AC | 17 ms | 640 KB |
in14.txt | AC | 17 ms | 640 KB |
in15.txt | AC | 1 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 17 ms | 640 KB |
in3.txt | AC | 17 ms | 640 KB |
in4.txt | AC | 17 ms | 640 KB |
in5.txt | AC | 17 ms | 640 KB |
in6.txt | AC | 17 ms | 640 KB |
in7.txt | AC | 17 ms | 640 KB |
in8.txt | AC | 17 ms | 640 KB |
in9.txt | AC | 17 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |