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>
const int len = 1505;
int cnt[len], exist[len][len];
void initialize(int n){
for (int i = 0; i < n; i++)
cnt[i] = n-1, exist[i][i] = 1;
}
int hasEdge(int u, int v){
if (!exist[u][v])
cnt[u]--, cnt[v]--, exist[u][v] = exist[v][u] = 1;
return (!cnt[u] || !cnt[v]);
}
/*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;
}
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |