This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |