# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208846 | anonymous | Werewolf (IOI18_werewolf) | C++14 | 1656 ms | 131044 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 <vector>
#include <utility>
#include <algorithm>
#define MAXN 200005
using namespace std;
class DSU { //1 indexed
int par[MAXN], sz;
vector<int> T[MAXN];
public:
int anc[MAXN][20], ID[MAXN][2], seq = 1;
int Find(int x) {
return(par[x] == x ? x : par[x] = Find(par[x]));
}
void Union(int x, int y) {
int p1 = Find(x), p2 = Find(y);
if (p1 == p2) {return;}
if (!anc[p1][0]) {
anc[p1][0]=p2;
T[p2].push_back(p1);
}
par[p1]=p2;
}
void Init(int n) {
sz = n;
for (int i=1; i <= n; i++) {
par[i]=i;
}
}
# | 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... |