Submission #345614

#TimeUsernameProblemLanguageResultExecution timeMemory
345614NicolaAbusaad2014Game (IOI14_game)C++14
0 / 100
1 ms384 KiB
/** * Prof.Nicola **/ #include "game.h" #include <bits/stdc++.h> using namespace std; template<class T>void re(T&x){cin>>x;} template<class T1,class T2> void re(pair<T1,T2>&x){re(x.first);re(x.second);} template<class T>void re(vector<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}} template<class T>void re(deque<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}} template<class T1,class T2> pair<T1,T2> mp(T1&x,T2&z){return make_pair(x,z);} long nodes; vector<long>m; void initialize(int n) { nodes=n; m.resize(n); for(long i=0;i<n;i++){ m[i]=n-1; } } int hasEdge(int u, int v) { m[u]--; m[v]--; if((!m[u])||(!m[v])){ return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...