Submission #2229123
Source Code Expand
#include<algorithm> #include<iostream> #include<cstring> #include<cstdio> #include<vector> #include<queue> #define MN 100000 using namespace std; inline int read() { int x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar(); return x*f; } int n,m,c[MN+5]; int main() { n=read();m=read(); for(int i=1;i<=m;++i) c[read()]^=1,c[read()]^=1; for(int i=1;i<=n;++i) if(c[i]) return 0*puts("NO"); puts("YES"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Unplanned Queries |
User | FallDream |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 550 Byte |
Status | AC |
Exec Time | 10 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 | 10 ms | 640 KB |
in10.txt | AC | 10 ms | 640 KB |
in11.txt | AC | 8 ms | 256 KB |
in12.txt | AC | 10 ms | 640 KB |
in13.txt | AC | 10 ms | 640 KB |
in14.txt | AC | 10 ms | 640 KB |
in15.txt | AC | 1 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 10 ms | 640 KB |
in3.txt | AC | 10 ms | 640 KB |
in4.txt | AC | 10 ms | 640 KB |
in5.txt | AC | 10 ms | 640 KB |
in6.txt | AC | 10 ms | 640 KB |
in7.txt | AC | 10 ms | 640 KB |
in8.txt | AC | 10 ms | 640 KB |
in9.txt | AC | 10 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |