Submission #2203331
Source Code Expand
#include <iostream> #include <queue> #include <vector> using namespace std; #define debug(x) std::cerr << #x << " = " << (x) << std::endl typedef long long LL; const int MAXN = 1e5+17; int a[MAXN],b[MAXN]; int main(int argc ,char const *argv[]) { #ifdef noob freopen("Input.txt","r",stdin);freopen("Output.txt","w",stdout); #endif int n,m; cin>>n>>m; for (int i = 0; i < m; ++i) { int u,v; cin>>u>>v; u--;v--; a[u]++,a[v]--; } int now = 0; for (int i = 0; i < n; ++i) { // debug(i); // debug(a[i]); // debug(now); now+=a[i]; b[i]+=now; } bool can = true; for (int i = 0; i < n-1; ++i) { // debug(i); // debug(b[i]); if(b[i]&1) can = false; } if(can) cout<<"YES"<<endl; else cout<<"NO"<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Unplanned Queries |
User | a326126110 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 812 Byte |
Status | AC |
Exec Time | 73 ms |
Memory | 1024 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 | 71 ms | 1024 KB |
in10.txt | AC | 70 ms | 1024 KB |
in11.txt | AC | 61 ms | 384 KB |
in12.txt | AC | 70 ms | 1024 KB |
in13.txt | AC | 71 ms | 1024 KB |
in14.txt | AC | 70 ms | 1024 KB |
in15.txt | AC | 1 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 72 ms | 1024 KB |
in3.txt | AC | 70 ms | 1024 KB |
in4.txt | AC | 73 ms | 1024 KB |
in5.txt | AC | 71 ms | 1024 KB |
in6.txt | AC | 71 ms | 1024 KB |
in7.txt | AC | 71 ms | 1024 KB |
in8.txt | AC | 71 ms | 1024 KB |
in9.txt | AC | 70 ms | 1024 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |