# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970656 | nguyentunglam | Radio Towers (IOI22_towers) | C++17 | 1294 ms | 317476 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 "towers.h"
#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
const int N = 1e5 + 10, S = 1e5 * 20 * 4;
int h[N], lg[N], mx[20][N], mn[20][N], L[N], R[N];
int n;
vector<int> rrh, pos[2 * N];
int idx(int x) {
return upper_bound(all(rrh), x) - rrh.begin();
}
struct ITSUM {
struct node {
int left, right, val;
node () {
left = right = val = 0;
}
} T[S];
int cnt;
int it[2 * N];
void pass (int x, int y) {
T[it[x] = ++cnt] = T[it[y]];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |