# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92183 | CPX | Game (IOI14_game) | C++14 | 0 ms | 0 KiB |
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 <cstdio>
#include <cassert>
bool vis[2000][2000];
int val[2000][2000];
int ctr[2000];
int n;
void initialize(int n) {
::n=n;
for(int i = 0 ; i<= n ; i++)vis[i][i]=1;
}
int hasEdge(int u, int v) {
if(vis[u][v])return val[u][v];
vis[u][v]=vis[v][u]=1;
ctr[u]++;
ctr[v]++;
if(ctr[u]>n-2||ctr[v]>n-2){
val[u][v]=val[v][u]=1;
return 1;
}else{
val[u][v]=val[v][u]=0;
return 0;
}
}
int read_int() {
int x;
assert(scanf("%d", &x) == 1);
return x;
}
int main() {
int n, u, v;
n = read_int();
initialize(n);
for (int i = 0; i < n * (n - 1) / 2; i++) {
u = read_int();
v = read_int();
printf("%d\n", hasEdge(u, v));
}
return 0;
}