# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
756363 | Desh03 | Election Campaign (JOI15_election_campaign) | C++17 | 237 ms | 30176 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 <bits/stdc++.h>
using namespace std;
vector<int> in, out, dep, dp, dp2;
vector<vector<int>> g, up;
vector<vector<tuple<int, int, int>>> qr;
int t, lg;
struct fenwick {
vector<int> fenw;
int n;
void init(int n_) {
fenw.resize(n = n_);
}
void upd(int u, int x) {
for (; u < n; u |= u + 1) fenw[u] += x;
}
int qry(int u) {
int s = 0;
for (; u >= 0; u = (u & (u + 1)) - 1) s += fenw[u];
return s;
}
int qry(int l, int r) {
return qry(r) - qry(l - 1);
}
} fen;
void dfs(int u) {
in[u] = t++;
for (int i = 1; i < lg; i++) up[i][u] = up[i - 1][up[i - 1][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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |