Submission #385650

#TimeUsernameProblemLanguageResultExecution timeMemory
385650victoriadGame (IOI14_game)C++14
0 / 100
2 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; int x; vector<int>g; void initialize(int n) { x=n-1; g.assign(n,-1); } int hasEdge(int u, int v) { if(g[u]==-1 && g[v]==-1 && x>1){ g[u]=v; x--; return 1; } else{ return 0; } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...