# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
169674 | dennisstar | Werewolf (IOI18_werewolf) | C++11 | 871 ms | 94468 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>
#define fi first
#define se second
#define ryan bear
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef vector<int> vim;
int N, M, Q;
vim V[200010];
struct sler {
int s, l, n, nd;
}sl[200010], er[200010];
struct tree {
int tp, tp1;
vim ch[400010];
int s[400010], e[400010];
void in(int a, int b) {
ch[tp].push_back(a); ch[tp].push_back(b); tp++;
}
void dfs(int now) {
s[now]=e[now]=tp1; tp1++;
for (int i:ch[now]) {
dfs(i);
# | 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... |