# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116232 | zubec | Werewolf (IOI18_werewolf) | C++14 | 1236 ms | 104564 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;
const int N = 200100;
vector <vector <int> > g, g1, g2;
int dsu[2][N], fenw[N], n;
int tin[2][N], tout[2][N], tiktak, up[2][20][N], pos[N];
int dsu_get(int pr, int v){
if (v == dsu[pr][v])
return v;
return dsu[pr][v] = dsu_get(pr, dsu[pr][v]);
}
void upd(int v){
for (int i = v; i <= n; i += (i & (-i))){
++fenw[i];
}
}
int get(int v){
int ans = 0;
for (int i = v; i >= 1; i -= (i & (-i))){
ans += fenw[i];
}
return ans;
Compilation message (stderr)
# | 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... |