# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153110 | arnold518 | Werewolf (IOI18_werewolf) | C++14 | 2091 ms | 156208 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
const int MAXQ = 2e5;
int N, M, Q;
vector<int> S, E, L, R, ans;
struct UF
{
int par[MAXN+10];
void init() { for(int i=0; i<N; i++) par[i]=i; }
int Find(int x) { return (x==par[x])?x:(par[x]=Find(par[x])); }
}uf1, uf2;
vector<int> adj[MAXN+10], adj1[MAXN+10], adj2[MAXN+10];
int s1[MAXN+10], e1[MAXN+10], s2[MAXN+10], e2[MAXN+10], cnt;
int par1[MAXN+10][25], par2[MAXN+10][25];
void dfs(int now, int *s, int *e, vector<int> *adj)
{
s[now]=cnt++; e[now]=s[now];
for(int nxt : adj[now])
{
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... |