# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105948 | Anai | Werewolf (IOI18_werewolf) | C++14 | 3278 ms | 179476 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>
#define x first
#define y second
using namespace std;
struct Query {
int start, halt, left, right, idx; };
using pii = pair<int, int>;
const int N = 2e5 + 5;
vector<int> members[N];
map<int, int> dist[N];
int far[N], siz[N], dsu[N], up[N];
unordered_map<int, int> mp[N];
vector<Query> qs;
vector<pii> edgs;
int n, m, q;
static int get_far(int nod) {
while (far[nod])
nod = far[nod];
return nod; }
static bool join(int a, int b) {
int _up = min(a, b);
a = get_far(a);
b = get_far(b);
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... |