| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1357396 | kawhiet | Permutation (APIO22_perm) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
constexpr int N = 1000;
bitset<N> t[N];
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 + 1; j < k; j++) {
t[i][j] = 1;
}
}
}
int add_teleporter(int u, int v) {
for (int i = 0; i < n; i++) {
if (t[i][u]) {
t[i] |= t[v];
}
}
t[u] |= t[v];
t[u][v] = 1;
for (int i = 0; i < k; i++) {
if (t[i][i]) {
return 1;
}
}
return 0;
}