Submission #1992129
Source Code Expand
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename A, size_t N, typename T>void Fill(A (&array)[N], const T&v)
{fill((T*)array,(T*)(array+N),v);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}
const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n, m;
bool z[100005];
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
FOR(i, 0, m){
int a, b;
cin >> a >> b;
z[a] ^= true;
z[b] ^= true;
}
FOR(i, 1, n+1){
if(z[i]){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Unplanned Queries |
User |
char134217728 |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
1778 Byte |
Status |
AC |
Exec Time |
17 ms |
Memory |
384 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 |
16 ms |
384 KB |
in10.txt |
AC |
16 ms |
384 KB |
in11.txt |
AC |
15 ms |
256 KB |
in12.txt |
AC |
17 ms |
384 KB |
in13.txt |
AC |
16 ms |
384 KB |
in14.txt |
AC |
16 ms |
384 KB |
in15.txt |
AC |
1 ms |
256 KB |
in16.txt |
AC |
1 ms |
256 KB |
in2.txt |
AC |
16 ms |
384 KB |
in3.txt |
AC |
16 ms |
384 KB |
in4.txt |
AC |
16 ms |
384 KB |
in5.txt |
AC |
16 ms |
384 KB |
in6.txt |
AC |
16 ms |
384 KB |
in7.txt |
AC |
16 ms |
384 KB |
in8.txt |
AC |
16 ms |
384 KB |
in9.txt |
AC |
16 ms |
384 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |