# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125345 | someone_aa | Werewolf (IOI18_werewolf) | C++17 | 1352 ms | 129400 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>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 200100;
int n, m, q;
vector<int>g[maxn];
vector<pair<int, int> > queries[maxn];
int result[maxn];
class dsu {
public:
int usize[maxn], uparent[maxn], parent[maxn];
vector<int>tree_g[maxn];
int sparse[maxn][20], euler[maxn], intime[maxn];
int sbtsize[maxn];
int br;
void init() {
br = 1;
for(int i=0;i<=n;i++) {
usize[i] = 1;
uparent[i] = i;
parent[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... |