| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 960192 | vjudge1 | Game (IOI14_game) | C++17 | 0 ms | 0 KiB |
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>
using namespace std;
#define int long long
const int N = 2e3+3;
int n;
bitset<N> adj[N], edge[N];
void dfs(int x) {
if (adj[x].count() == 1) {
int y = 0;
while (!adj[x][y]) y++;
adj[x][y] = adj[y][x] = 0;
edge[x][y] = edge[y][x] = 1;
dfs(y);
}
}
void initialize(int nn) {
n = nn;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j) continue;
adj[i][j] = 1;
}
}
}
int hasEdge(int u, int v) {
if (edge[u][v]) return 1;
adj[u][v] = adj[v][u] = 0;
dfs(u);
dfs(v);
return 0;
}
