# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463808 | xyzyzl | Railway (BOI17_railway) | C++14 | 286 ms | 23736 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 namespace std;
const int MAXN = 100005;
#define bitinc(x) x&-x
int n, m, k;
vector<int> adj[MAXN];
int par[100005][20];
int tmp = 0, in[200005], ot[200005], bit[200005];
int sum(int ind)
{
int sm = 0;
while(ind > 0)
{
sm += bit[ind];
ind -= bitinc(ind);
}
return sm;
}
void upd(int ind, int val)
{
while(ind <= n)
{
bit[ind] += val;
ind += bitinc(ind);
}
}
# | 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... |