Submission #1780502
Source Code Expand
#include<iostream> #include<cstdio> #include<vector> #include<map> #include<string> #include<sstream> #include<cmath> #include<climits> #include<algorithm> #include<bitset> #include<set> #include<stack> #include<queue> #include<iomanip> #include<memory.h> #include<complex> #include<unordered_map> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; typedef tuple<int,int> tii; #define rep(i,n) for(int i=0;i<(n);i++) #define pb push_back #define mt make_tuple #define ALL(a) (a).begin(),(a).end() #define FST first #define SEC second const int INF = (INT_MAX/2); const ll LLINF = (LLONG_MAX/2); const double eps = 1e-8; const double PI = M_PI; #define DEB cerr<<"!"<<endl #define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl #define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" ")) #define DIV int(1e9+7) inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;} inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;} /* Coding Space*/ int d[200000]; int main(){ int n,m; cin >> n >> m; rep(i,m){ int a,b; cin >> a >> b; d[a]++,d[b]++; } rep(i,n+1) if(d[i]%2){ cout << "NO" << endl; return 0; } cout << "YES" << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Unplanned Queries |
User | cashisu1 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1337 Byte |
Status | AC |
Exec Time | 76 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 | 71 ms | 640 KB |
in10.txt | AC | 70 ms | 640 KB |
in11.txt | AC | 61 ms | 256 KB |
in12.txt | AC | 70 ms | 640 KB |
in13.txt | AC | 71 ms | 640 KB |
in14.txt | AC | 70 ms | 640 KB |
in15.txt | AC | 1 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 71 ms | 640 KB |
in3.txt | AC | 74 ms | 640 KB |
in4.txt | AC | 71 ms | 640 KB |
in5.txt | AC | 70 ms | 640 KB |
in6.txt | AC | 76 ms | 640 KB |
in7.txt | AC | 70 ms | 640 KB |
in8.txt | AC | 71 ms | 640 KB |
in9.txt | AC | 70 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |