# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600541 | Hanksburger | Werewolf (IOI18_werewolf) | C++17 | 1335 ms | 524288 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;
vector<int> child[400005], adj1[200005], adj2[200005], ql[200005], qr[200005], ans;
int p[200005], par[400005], tin[400005], tout[400005], t;
set<int> ss[400005];
int parent(int u)
{
return (par[u]==u)?u:(par[u]=parent(par[u]));
}
void f(int u)
{
tin[u]=(t++);
for (int v:child[u])
f(v);
tout[u]=(t++);
}
vector<int> check_validity(int n, vector<int> x, vector<int> y, vector<int> s, vector<int> e, vector<int> l, vector<int> r)
{
for (int i=0; i<x.size(); i++)
{
int u=min(x[i], y[i]), v=max(x[i], y[i]);
adj1[u].push_back(v);
adj2[v].push_back(u);
}
for (int i=0; i<l.size(); i++)
{
ql[l[i]].push_back(i);
qr[r[i]].push_back(i);
ans.push_back(0);
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... |