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;
int ct, N;
bool graph[1500][1500];
void initialize(int n) {
ct = n * (n - 1) / 2;
N = n;
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
graph[i][j] = false;
}
}
for (int i=0; i<n-2; i++) {
graph[i][i+1] = true;
graph[i+1][i] = true;
}
}
int hasEdge(int u, int v) {
ct--;
if (graph[u][v] || ct == 0) {
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... |