# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
443143 | JovanB | Werewolf (IOI18_werewolf) | C++17 | 1184 ms | 149312 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;
using ll = long long;
const int MAXN = 200000;
struct Edge{
int a, b, c;
bool operator <(const Edge &x){
return c < x.c;
}
};
struct DSU{
int n;
int par[MAXN+5];
int label[MAXN+5];
int sz[MAXN+5];
DSU(int g){
n = g;
for(int i=1; i<=n; i++){
par[i] = i;
label[i] = i;
sz[i] = 1;
}
}
int root(int x){ return (par[x] == x ? x : par[x] = root(par[x])); }
# | 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... |