# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
828542 | vnm06 | Werewolf (IOI18_werewolf) | C++14 | 617 ms | 58500 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;
int n, m;
int pos[200005];
vector<int> gr[200005];
void dfs(int v)
{
for(int i=0; i<gr[v].size(); i++)
{
int nv=gr[v][i];
if(pos[nv]) continue;
pos[nv]=pos[v]+1;
v=nv;
dfs(v);
}
}
vector<int> zL[200005];
vector<int> zR[200005];
vector<int> res;
int posL[200005], posR[200005];
int treeL[800005], treeR[800005];
void update_L(int v, int le, int ri, int 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... |