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 "game.h"
#include <bits/stdc++.h>
#define li 1505
#define inf 2000001000
#define md 1000000007
#define lo long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ii pair<lo int,lo int>
using namespace std;
int A[li],vis[li],N;
void initialize(int n){
N=n;
return ;
}
int hasEdge(int u,int v){
if(A[u]==N-2 && vis[u]==0){
vis[u]=1;
return 1;
}
if(A[v]==N-2 && vis[v]==0){
vis[v]=1;
return 1;
}
A[u]++;
A[v]++;
return 0;
}
//~ int main(){
//~ return 0;
//~ }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |