# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
349128 | two_sides | Werewolf (IOI18_werewolf) | C++17 | 565 ms | 63948 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;
#define fi first
#define se second
using pii = pair <int, int>;
struct query {int l, r, t, id;};
const int N = 200005;
int par[2][N], val[2][N], siz[2][N];
vector <int> adj[2][N]; int ver[2][N];
int tin[2][N], tout[2][N], timer;
int ans[N], BIT[N]; vector <query> que[N];
void updateBIT(int i) {
for (; i < N; i += i & -i) BIT[i]++;
}
int queryBIT(int i) {
int res = 0;
for (; i > 0; i -= i & -i) res += BIT[i];
return res;
}
int getRoot(int id, int u) {
# | 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... |