Submission #771103

#TimeUsernameProblemLanguageResultExecution timeMemory
771103kirakaminski968Game (IOI14_game)C++17
100 / 100
250 ms13392 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 1505; vector<int> grad(MAXN); void initialize(int n){ for(int i = 0;i<n;++i){ grad[i] = n-i-1; } } int hasEdge(int u, int v){ if(u > v) swap(u,v); if(grad[u]) grad[u]--; if(grad[u] == 0) return 1; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...