Submission #385898

#TimeUsernameProblemLanguageResultExecution timeMemory
385898victoriadGame (IOI14_game)C++14
0 / 100
1 ms364 KiB
#include "game.h" #include <cmath> #include <cstdio> #include <vector> #include <iostream> #include <algorithm> #include <utility> #include <queue> #include <map> #include <iomanip> #include <stack> #include <fstream> using namespace std; vector<int>g; int a,b,x; void initialize(int n) { a=-1; b=-1; g.assign(n,n-1); x=(n*(n-1))/2; } int hasEdge(int u, int v) { x--; if(g[u]>2 && g[v]>2){ g[u]--; g[v]--; return 0; } else if(a!=-1 && b!=-1){ return 1; } else if(g[u]==2 && g[v]==2){ return 1; } else{ if(a==-1 && b==-1){ a=u; g[u]--; g[v]--; return 0; } else{ return 1; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...