# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290548 | DanerZein | Meetings (IOI18_meetings) | C++14 | 5534 ms | 1900 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 "meetings.h"
#include <bits/stdc++.h>
#define MAX 1000000000000000
using namespace std;
/*int val[100010],ft[100010];
int lsone(int s){
return s&(-s);
}
void init(int n){
for(int i=1;i<=n;i++){
ft[i]+=val[i];
if(i+lsone(i)<=n) ft[i+lsone(i)]+=val[i];
}
}
int query(int x){
int s=0;
for(;x;x-=lsone(x)){
s+=ft[x];
}
return s;
}*/
std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,
std::vector<int> R) {
vector<long long> C;
/*for(int i=0;i<H.size();i++){
val[i+1]=H[i];
}
init(H.size());*/
for(int i=0;i<L.size();i++){
int l=L[i],r=R[i];
long long mi=MAX;
for(int j=l;j<=r;j++){
int ma=H[j];
long long s=0;
for(int k=j;k>=l;k--){
ma=max(ma,H[k]);
s+=ma;
}
ma=H[j];
for(int k=j+1;k<=r;k++){
ma=max(ma,H[k]);
s+=ma;
}
mi=min(mi,s);
}
C.push_back(mi);
}
return C;
}
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... |