# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963613 | MisterReaper | Synchronization (JOI13_synchronization) | C++17 | 273 ms | 24024 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 i64 = long long;
constexpr int maxN = 1E5 + 5;
constexpr int L = 20;
std::vector<int> adj[maxN];
int par[maxN][L], tin[maxN], tout[maxN], info[maxN], lastsync[maxN];
int X[maxN], Y[maxN];
bool active[maxN];
int tree[maxN * 2];
struct fenwick {
int n;
fenwick(int _n) : n(_n + 1) {}
void modify(int p, int v) {
for(++p; p <= n; p += p & -p) {
tree[p] += v;
}
}
int query(int p) {
int res = 0;
for(++p; p > 0; p -= p & -p) {
res += tree[p];
}
return res;
}
};
signed main() {
# | 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... |