# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145156 | tincamatei | Railway (BOI17_railway) | C++14 | 170 ms | 26024 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 MAX_N = 100000;
const int MAX_K = 50000;
vector<int> graph[1+MAX_N];
vector<int> updates[1+MAX_N];
int lim[MAX_K], subtree[1+MAX_N];
struct SubTreeCnt {
int cnt[MAX_K];
int active;
vector<int> history;
SubTreeCnt() {
for(int i = 0; i < MAX_K; ++i)
cnt[i] = 0;
active = 0;
}
void clear() {
for(auto it: history)
cnt[it]--;
active = 0;
history.clear();
}
void insert(int x) {
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... |