# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162677 | nhphuc | Election Campaign (JOI15_election_campaign) | C++20 | 191 ms | 41780 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 100100;
const int L = 18;
int n, m, a[N], b[N], c[N], dep[N], in[N], out[N], dp[N], sum[N], t[N * 4], par[N][L], timer = 0;
vector<int> adj[N], que[N];
void upd (int id, int l, int r, int k, int x){
if (k > r){
return;
}
if (l == r){
t[id] += x;
return;
}
int m = l + r >> 1;
if (k <= m){
upd(id * 2, l, m, k, x);
} else {
upd(id * 2 + 1, m + 1, r, k, x);
}
t[id] = t[id * 2] + t[id * 2 + 1];
return;
}
int get (int id, int l, int r, int u, int v){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |