Submission #360348

#	Time	Username	Problem	Language	Result	Execution time	Memory
360348		juggernaut	모임들 (IOI18_meetings)	C++14	19 / 100	596 ms	400492 KiB

meetings

#include"meetings.h"
#include<bits/stdc++.h>
#ifndef EVAL
#include"grader.cpp"
#endif
using namespace std;
typedef long long ll;
ll cnt[5005][5005],n,q;
vector<ll>minimum_costs(vector<int>h,vector<int>l,vector<int>r){
    n=h.size();
    q=l.size();
    for(int i=0;i<n;i++){
        ll mx=0;
        for(int j=i;j<n;j++){
            mx=max(mx,1ll*h[j]);
            cnt[i][j]+=mx;
        }
        mx=h[i];
        for(int j=i-1;j>=0;j--){
            mx=max(mx,1ll*h[j]);
            cnt[i][j]+=mx;
        }
        for(int j=1;j<n;j++)cnt[i][j]+=cnt[i][j-1];
    }
    vector<ll>ans;
    for(int i=0;i<q;i++){
        ll mn=9e18;
        for(int j=l[i];j<=r[i];j++){
            if(l[i])mn=min(mn,cnt[j][r[i]]-cnt[j][l[i]-1]);
            else mn=min(mn,cnt[j][r[i]]);
        }
        ans.push_back(mn);
    }
    return ans;
}

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40