Submission #2832408


Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define INF 1LL<<50
#define fst first
#define sec second
#define pb push_back
#define int long long
#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ITR(itr,mp) for(int itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr,mp) for(int itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define debug(x)  cout << #x << " = " << (x) << endl;
typedef long long ll;
typedef pair<ll,ll> P;

signed main(){
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n,m;
  cin >> n >> m;
  
  int a[n] = {};
  REP(i,m){
    int x,y;
    cin >> x >> y;
    a[x-1]++;
    a[y-1]++;
  }
  
  bool flag = true;
  REP(i,n){
    if(a[i] % 2 == 0) continue;
    flag = false;
    break;
  }
  
  if(flag) cout << "YES" << endl;
  else	   cout << "NO" << endl;

  return 0;
}

Submission Info

Submission Time
Task B - Unplanned Queries
User cinnamoroll
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1028 Byte
Status AC
Exec Time 17 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 20
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 17 ms 1024 KB
in10.txt AC 17 ms 1024 KB
in11.txt AC 15 ms 384 KB
in12.txt AC 17 ms 1024 KB
in13.txt AC 17 ms 1024 KB
in14.txt AC 17 ms 1024 KB
in15.txt AC 1 ms 256 KB
in16.txt AC 1 ms 256 KB
in2.txt AC 17 ms 1024 KB
in3.txt AC 17 ms 1024 KB
in4.txt AC 17 ms 1024 KB
in5.txt AC 17 ms 1024 KB
in6.txt AC 16 ms 1024 KB
in7.txt AC 17 ms 1024 KB
in8.txt AC 17 ms 1024 KB
in9.txt AC 17 ms 1024 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB