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>
using namespace std;
using ll = long long;
template<class A,class B>
bool chmin(A &a,B b){
if(a>b){
a=b;
return true;
}
return false;
}
ll solve(vector<ll> a){
ll n=a.size();
vector<ll> l(n),r(n);
ll ans=(1ll<<60);
{
ll sum=0;
vector<pair<ll,ll>> st;
for(int i=0;i<n;i++){
ll x=a[i],y=1;
while(st.size()&&st.back().first<=x){
sum-=st.back().first*st.back().second;
y+=st.back().second;
st.pop_back();
}
st.push_back({x,y});
sum+=x*y;
l[i]=sum;
}
}
{
ll sum=0;
vector<pair<ll,ll>> st;
for(int i=n-1;i>=0;i--){
ll x=a[i],y=1;
while(st.size()&&st.back().first<=x){
sum-=st.back().first*st.back().second;
y+=st.back().second;
st.pop_back();
}
st.push_back({x,y});
sum+=x*y;
r[i]=sum;
}
}
for(int i=0;i<n;i++) chmin(ans,l[i]+r[i]-a[i]);
return ans;
}
std::vector<long long> minimum_costs(std::vector<int> h, std::vector<int> l,std::vector<int> r) {
int n=h.size();
int q=l.size();
vector<ll> ans(q,1ll<<60);
for(int i=0;i<q;i++){
vector<ll> b;
for(int j=l[i];j<=r[i];j++) b.push_back(h[j]);
ans[i]=solve(b);
}
return ans;
}
Compilation message (stderr)
meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:51:7: warning: unused variable 'n' [-Wunused-variable]
51 | int n=h.size();
| ^
# | 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... |