# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117049 | mirbek01 | Werewolf (IOI18_werewolf) | C++11 | 1431 ms | 102192 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 maxn = 2e5 + 2;
int p[2][maxn], timer, tin[3][maxn], tout[3][maxn], up[3][19][maxn], pos[maxn], fen[maxn];
vector <int> g[3][maxn];
int f_s(int tp, int v){
return p[tp][v] == v?v:p[tp][v] = f_s(tp, p[tp][v]);
}
void dfs(int tp, int v, int pr){
tin[tp][v] = ++ timer;
up[tp][0][v] = pr;
for(int i = 1; i <= 18; i ++)
up[tp][i][v] = up[tp][i - 1][ up[tp][i - 1][v] ];
for(int to : g[tp][v]){
if(to == pr)
continue;
dfs(tp, to, v);
}
tout[tp][v] = timer;
}
void upd(int pos){
for(; pos < maxn; pos |= pos + 1)
fen[pos] ++;
Compilation message (stderr)
# | 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... |