# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363956 | ngpin04 | Railway (BOI17_railway) | C++14 | 162 ms | 24716 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 fi first
#define se second
#define mp make_pair
using namespace std;
const int N = 1e5 + 5;
vector <int> ans;
vector <pair <int, int>> adj[N];
int anc[20][N];
int id[N];
int bit[N];
int tin[N];
int tout[N];
int n,k,q,cntdfs;
void update(int pos, int val)
{
for (; pos <= n; pos += pos & -pos)
bit[pos] += val;
}
int getsum(int l, int r)
{
int res = 0;
for (; r > 0; r -= r & -r)
res += bit[r];
for (l--; l > 0; l -= l & -l)
# | 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... |