# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
771213 | khshg | Werewolf (IOI18_werewolf) | C++14 | 452 ms | 86360 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;
int N;
vector<vector<int>> adj;
vector<int> D;
vector<pair<int, int>> ch;
void init(int N) {
D = vector<int>(N); iota(begin(D), end(D), 0);
ch.resize(N);
}
int parent(int x) {
return (D[x] == x ? x : D[x] = parent(D[x]));
}
void unite(int x, int y) {
x = parent(x); y = parent(y);
if(x == y) return;
int s = (int)D.size();
D[x] = D[y] = s;
D.push_back(s);
ch.emplace_back(x, y);
}
void dfs(int S, int& tim3) {
if(S < N) {
ch[S] = {tim3, tim3};
# | 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... |