Submission #210865

#TimeUsernameProblemLanguageResultExecution timeMemory
210865mohamedsobhi777Game (IOI14_game)C++14
0 / 100
7 ms504 KiB
#include<bits/stdc++.h> #include "game.h" using namespace std ; const int N = 1500 + 1 ; int prv[N][N] ; int rem[N]; void initialize(int n) { for(int i = 0 ; i < n ;i++) rem[i] = n-1 ; } int hasEdge(int u, int v) { if(prv[u][v])return prv[u][v] -1 ; rem[u] = max(rem[u]-1 , 0) ; rem[v] = max(rem[v]-1 , 0) ; int ret = ((!rem[u])|(!rem[v])) ; prv[u][v] = prv[v][u] = ret+1 ; return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...