# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75105 | imeimi2000 | Werewolf (IOI18_werewolf) | C++17 | 1058 ms | 99236 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>
using namespace std;
typedef long long llong;
int n, m, q;
vector<int> edge[200000];
struct UF {
int par[200000];
UF() {
for (int i = 0; i < 200000; ++i) par[i] = i;
}
int find(int x) {
if (par[x] != x) return par[x] = find(par[x]);
return x;
}
} Luf, Ruf;
int Lpar[200000][20];
int Rpar[200000][20];
vector<int> Lchild[200000];
vector<int> Rchild[200000];
int Lst[200000];
int Led[200000];
int Rst[200000];
int Red[200000];
int LRd[200000];
# | 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... |