# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253779 | test2 | Railway (BOI17_railway) | C++14 | 494 ms | 57068 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 N = (1 << 18);
int n, m, k;
int st[N], en[N];
vector<int> deps[N], ans;
int t = 3, r, r2;
int L[N], R[N];
vector<pair<int, int>> adj[N];
int er[N];
vector<pair<pair<int, int>, int>> eve, eve2;
int an1[N], an2[N];
int bit[N][2];
void add(int x, int idx = 0, int val = 1)
{
for (; x < N; x += x & -x)
bit[x][idx] += val;
}
int get(int x, int idx = 0, int val = 1)
{
int ret = 0;
for (; x; x -= x & -x)
ret += bit[x][idx];
return ret;
}
Compilation message (stderr)
# | 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... |