# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
526851 | qwerasdfzxcl | Werewolf (IOI18_werewolf) | C++14 | 1039 ms | 177352 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;
int n, m, q, num[200200];
vector<int> ans, adj[200200];
struct Query{
int s, e, l, r, i;
Query(){}
Query(int _s, int _e, int _l, int _r, int _i): s(_s), e(_e), l(_l), r(_r), i(_i) {}
bool operator<(const Query &Q) const{
return l > Q.l;
}
};
vector<Query> Q;
struct Range{
int l, r, t;
Range(){}
Range(int _l, int _r, int _t): l(_l), r(_r), t(_t) {}
bool operator<(const Range &R) const{
return t < R.t;
}
};
vector<Range> ran[200200], root[200200];
struct DSU1{
int path[200200];
# | 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... |