This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///~~~LOTA~~~///
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define MAXN 1500
int n,m,o;
int a[MAXN];
void initialize(int N){
for(int i=o=0;i<N;i++)
a[i]=0;
n=m=N;
m/=2;
return;
}
int hasEdge(int u, int v){
if(min(u,v)<m && max(u,v)>=m){
o++;
if(o==m*(n-m)) return 1;
}
if(u<m && v>=m) return 0;
if(u>=m && v<m) return 0;
a[v]++;
a[u]++;
if(u<m){
if(a[u]==m-1 || a[v]==m-1)
return 1;
}
else{
if(a[u]==n-m-1 || a[v]==n-m-1)
return 1;
}
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... |