# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964080 | oblantis | Werewolf (IOI18_werewolf) | C++17 | 0 ms | 0 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.
//#pragma gcc target("avx2,bmi,bmi2,lzcnt,popcnt")
//#pragma gcc optimize("o3,unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
#define uid(a, b) uniform_int_distribution<int>(a, b)(mt)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll inf = 1e18;
const int mod = 1e9+7;
const int maxn = 2e5;
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
void solve() {
}
#include "werewolf.h"
vt<int> s[maxn], g[maxn], eg[maxn], g[maxn];
int n, q, m, i1[maxn], i2[maxn], p[maxn], sz[maxn], cnt, xl[maxn], xr[maxn];
bool was[maxn];
int get(int v){
if(p[v] == v)return v;
return (p[v] = get(p[v]));
}
void go(int v){
i1[v] = cnt++;