# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120542 | win11905 | Werewolf (IOI18_werewolf) | C++11 | 1025 ms | 103032 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 <bits/stdc++.h>
#include "werewolf.h"
using namespace std;
const int N = 1 << 18;
int n, m, q, par[N];
vector<int> g[N];
vector<int> t1[N], t2[N];
vector<int> sl[N], sr[N];
int al[N], ar[N];
int find(int u) { return par[u] = par[u] == u ? u : find(par[u]); }
int in[N], out[N], pos[N];
void dfs(int u) {
static int idx = 0;
pos[in[u] = ++idx] = u;
for(int v : t1[u])
dfs(v);
out[u] = idx;
}
int sz[N], in1[N], out1[N], pos1[N];
void pre(int u) {
static int id = 0;
sz[pos1[in1[u] = ++id] = u]++;
for(int &v : t2[u]) {
# | 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... |