# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155450 | imyujin | Werewolf (IOI18_werewolf) | C++17 | 1581 ms | 105404 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;
#define rb(x) ((x)&(-(x)))
const int MAXN = 200010;
const int MX = 1 << 20;
int N;
int u[MAXN], d[MAXN];
int dot[MAXN];
vector<int> qry[MAXN];
vector<int> ed[MAXN];
int bit[MX];
struct TREE {
int par[20][MAXN], uni[MAXN];
vector<int> chi[MAXN];
int dfn[MAXN], dfr[MAXN];
int dfs(int x, int d) {
dfn[x] = dfr[x] = d;
for(auto a : chi[x]) dfr[x] = dfs(a, dfr[x] + 1);
return dfr[x];
}
int cnttt = 0;
int guni(int x) {
//if(++cnttt < 100) printf("uni[%d] = %d, %d\n", x, uni[x], ~uni[x]);
# | 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... |