# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253592 | emil_physmath | Werewolf (IOI18_werewolf) | C++17 | 1072 ms | 174572 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 <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
const int maxN = 200'005;
struct Quer {
int l, r, s, e, ind, link1, link2;
};
int n;
vector<int> ans;
vector<Quer> quer, withLink1[maxN * 2];
vector<int> nei[maxN], nei1[maxN * 2], nei2[maxN * 2];
set<int> t[maxN * 2];
int col[maxN], linkl[maxN * 2], linkr[maxN * 2];
struct DSU
{
vector<int> par, sz, link;
DSU(int n)
: par(n)
, sz(n)
, link(n)
{
for (int i = 0; i < n; ++i)
par[i] = link[i] = i, sz[i] = 1;
}
int root(int v) {
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... |