# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787117 | alexander707070 | Radio Towers (IOI22_towers) | C++17 | 4022 ms | 7128 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>
#define MAXN 100007
using namespace std;
int n,h[MAXN],maxh,num,delta,from[MAXN],to[MAXN],border;
int dp[MAXN],ans,pref[MAXN],se,te;
pair<int,int> tree[4*MAXN];
int mins[4*MAXN];
pair<int,int> combine(pair<int,int> fr,pair<int,int> sc){
if(fr.first>sc.first)return fr;
return sc;
}
void build(int v,int l,int r){
if(l==r){
tree[v]={h[l],l};
mins[v]=h[l];
}else{
int tt=(l+r)/2;
build(2*v,l,tt);
build(2*v+1,tt+1,r);
tree[v]=combine(tree[2*v],tree[2*v+1]);
mins[v]=min(mins[2*v],mins[2*v+1]);
}
}
pair<int,int> best(int v,int l,int r,int ll,int rr){
if(ll>rr)return {-1,0};
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... |