# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
631857 | TheLostCookie | Radio Towers (IOI22_towers) | C++17 | 1588 ms | 98728 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>
#include "towers.h"
using namespace std;
const int INF = 2e9;
#define FOR(i,a,b) for(int i=(a); i<(b); ++i)
#define ROF(i,a,b) for(int i=(b)-1; i>=(a); --i)
typedef vector<int> vi;
typedef pair<int,int> ii;
struct SegmentTree {
int v;
int N;
int minH,maxH;
SegmentTree* left;
SegmentTree* right;
SegmentTree(SegmentTree* st) {
v = st->v;
N = st->N;
minH = st->minH;
maxH = st->maxH;
left = st->left;
right = st->right;
}
SegmentTree(int l, int r, vi &init, vi &H) {
if(r-l==1) {
# | 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... |