# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398553 | nikatamliani | Synchronization (JOI13_synchronization) | C++14 | 335 ms | 27240 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"
#define ll long long
using namespace std;
const int N = 2e5+10, LOG = 20;
int in[N], out[N], t[N], L[N][LOG], ans[N], last[N], is_active[N];
vector<int> g[N];
int n, m, q;
void dfs(int x, int p) {
static int timer = 0;
in[x] = ++timer;
L[x][0] = p;
for(int i = 1; i < LOG; ++i) {
L[x][i] = L[L[x][i - 1]][i - 1];
}
for(int to : g[x]) {
if(to != p) {
dfs(to, x);
}
}
out[x] = ++timer;
}
void upd(int x, int coeff) {
for(; x <= 2*n; x += x & -x) {
t[x] += coeff;
}
}
int sum(int x) {
int ans = 0;
for(; x > 0; x -= x & -x) {
ans += t[x];
# | 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... |