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"
using namespace std;
#define fr first
#define sc second
const char nl = '\n';
#include "game.h"
const int N = 1001;
int n, k;
/* vector<vector<bool>> reach; */
bitset<N> reach[N];
void init(int _n, int _k) {
n = _n; k = _k;
for(int i = 0; i < k - 1; ++i) {
for(int j = i + 1; j < k; ++j) {
reach[i][j] = 1;
}
}
}
int add_teleporter(int u, int v) {
reach[u][v] = 1;
reach[u] |= reach[v];
for(int i = 0; i < n; ++i) {
if(!reach[i][u]) continue;
reach[i] |= reach[u];
}
for(int i = 0; i < k; ++i) if(reach[i][i]) 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... |