# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
623902 | ipaljak | Tax Evasion (LMIO19_mokesciai) | C++14 | 299 ms | 49324 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 = 2e5 + 10;
const int LOGN = 19;
vector<int> v[MAXN];
int n, m, tick;
int dsc[MAXN], fin[MAXN], lvl[MAXN], dad[MAXN][LOGN];
inline pair<int, int> maxp(const pair<int, int> &a, const pair<int, int> &b) {
if (a > b) return a;
return b;
}
struct Tournament {
int offset;
vector<pair<int, int>> t;
Tournament(int sz) {
for (offset = 1; offset <= sz; offset *= 2);
t.resize(2 * offset);
}
void ins(int i, int val) {
i += offset; t[i] = {val, i - offset};
for (i /= 2; i > 0; i /= 2)
t[i] = maxp(t[2 * i], t[2 * i + 1]);
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... |