# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483117 | Alexandruabcde | Synchronization (JOI13_synchronization) | C++14 | 312 ms | 27720 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 ub(x) (x&(-x))
using namespace std;
constexpr int NMAX = 1e5 + 5;
struct edge {
int x, y;
};
edge Edges[NMAX];
int N, M, Q;
vector <int> G[NMAX];
int LengthLog;
int Parent[NMAX][20];
int Lg[NMAX];
int Size[NMAX];
int Poz[NMAX];
int aib[NMAX];
void Update (int poz, int val) {
for (int i = poz; i <= N; i += ub(i))
aib[i] += val;
}
# | 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... |