Submission #1748061
Source Code Expand
#include <map> #include <algorithm> #include <cassert> #include <climits> #include <complex> #include <cstdio> #include <string> #include <iostream> #include <queue> #include <string> #include <tuple> #include <vector> using namespace std; using ll = long long; using ld = long double; template<class T> bool chmin(T &a, T b) { return a>b?(a=b,true):false; } template<class T> bool chmax(T &a, T b) { return a<b?(a=b,true):false; } #define all(a) (a).begin(), (a).end() #define uni(a) (a).erase(unique(all(a)), (a).end()) #define bit(n, i) (((n) >> (i)) & 1) #define bitcount(n) __builtin_popcountll(n) #define FOR(i,x,y) for(int i=(x);i<(int)(y);i++) #define FORP(i,x,y) for(int i=(x);i<=(int)(y);i++) #define REP(i,y) for(int i=0;i<(int)(y);i++) #define REPP(i,y) for(int i=1;i<=(int)(y);i++) #define REPB(i,n) for(int i=(int)(n)-1;i>=0;i--) const int MAX_N = 100100; int n,m; // node 0 からの重み int weights[MAX_N]; int main() { cin>>n>>m; REP(i,m) { int a,b;cin>>a>>b;a--,b--; if (a!=0) weights[a]++; if (b!=0) weights[b]++; } FOR(i,1,n) { if (weights[i]%2!=0) { cout << "NO" << endl; return 0; } } cout << "YES" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Unplanned Queries |
User | fifth_russian |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1253 Byte |
Status | AC |
Exec Time | 73 ms |
Memory | 768 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 | 71 ms | 640 KB |
in11.txt | AC | 62 ms | 256 KB |
in12.txt | AC | 70 ms | 640 KB |
in13.txt | AC | 70 ms | 640 KB |
in14.txt | AC | 72 ms | 768 KB |
in15.txt | AC | 1 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 70 ms | 640 KB |
in3.txt | AC | 71 ms | 640 KB |
in4.txt | AC | 70 ms | 640 KB |
in5.txt | AC | 71 ms | 640 KB |
in6.txt | AC | 70 ms | 640 KB |
in7.txt | AC | 73 ms | 640 KB |
in8.txt | AC | 70 ms | 640 KB |
in9.txt | AC | 71 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |