| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 134242 | reda | Meetings (IOI18_meetings) | C++14 | 0 ms | 0 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>
using namespace std ;
#define pb push_back
#define ll long long
#define ld long double
#define mp make_pair
#define MOD 1000000007
#define endl '\n'
#pragma GCC optimize ("O3")
#include "meetings.h"
#define MAXN 105
ll h[3005];
ll st[3005*4+1];
void build (ll p , ll l, ll r)
{
if(l==r)
{
st[p]=h[l];
return ;
}
build(2*p,l,(l+r)/2);
build(2*p+1,(l+r)/2 + 1, r);
st[p]=max(st[p*2],st[2*p+1]);
}
ll query(ll p ,ll i , ll j , ll l ,ll r)
{
if(r < i || j < l)
{
return 0;
}
if(l <= i && j <= r)
{
return st[p];
}
ll mid = (i + j) / 2;
ll p1 = query(2*p, i, mid, l, r);
ll p2 = query(2*p+1, mid+1, j, l, r);
return max(p1,p2);
}
vector<int> minimum_costs(vector<int>H, vector<int> L, vector<int> R)
{
vector<int> ans;
int N=H.size();
int M=h.size();
for(int i=0;i<H.size();i++)
{
h[i+1]=H[i];
}
for(int i= 0 ;i < M;i ++ )
{
int mn=1e9+6;
int l= L[i],r=R[i];
for(int j=l ; j<=r;j++)
{
int c=0;
for(int s=l;s<r;s++)
{
if(s==j)c+=H[i];
else c+=query(1,min(j+1,s+1),max(j+1,s+1),1,N);
}
mn=min(mn,c);
}
ans.pb(mn);
}
return ans;
}