# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
173423 | errorgorn | Werewolf (IOI18_werewolf) | C++14 | 1129 ms | 153936 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 <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
#include <cstring>
#include <set>
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
struct query{
int s,e;
int l,r;
int index;
query(int a,int b,int c,int d,int _index){
s=a,e=b,l=c,r=d;
index=_index;
}
};
int n,m,q;
vector<int> al[200005];
vector<iii> edges;
vector<query*> __q;
///for kruskal tree
ii range[400005];
int lchild[400005];
# | 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... |