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"
const int dydis = 5001;
bool can[dydis][dydis] = {};
int n, k;
void init(int N, int K) {
n = N; k = K;
for(int i = 0; i < k-1; i++) {
for(int j = i; j < k; j++) {
can[i][j] = true;
}
}
}
int add_teleporter(int u, int v) {
for(int i = 0; i < n; i++) {
if(can[i][u]) can[i][v] = 1;
}
if(v < k) {
if(can[v][u]) 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |