# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159333 | iefnah06 | Werewolf (IOI18_werewolf) | C++11 | 1322 ms | 155152 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 "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 200010;
int N, M, Q;
vector<int> adj[MAXN];
int par[MAXN];
const int MAXL = 20;
int anc[2][MAXL][MAXN];
vector<int> tr[MAXN];
void reset() {
fill_n(par, N, -1);
for (int i = 0; i < N; i++) tr[i].clear();
}
int getpar(int a) {
return par[a] == -1 ? a : par[a] = getpar(par[a]);
}
int st[MAXN], ed[MAXN];
int ind;
void dfs(int cur = 0) {
st[cur] = ind++;
for (int nxt : tr[cur]) {
dfs(nxt);
# | 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... |