제출 #836271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
836271		Mohmad_Zaid	모임들 (IOI18_meetings)	C++11	0 / 100	3408 ms	786432 KiB

meetings

// #include "meetings.h"
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define print(a) for(int i=0;i<a.size();i++)cout<<a[i]<<endl;
using namespace std;
vector<long long> minimum_costs(vector<int> H, vector<int> L,vector<int> R) {
    int q = L.size();
    int n = H.size();
    vector<vector<ll>>prefix(n,vector<ll>(n+1,0));
    for(int i=0;i<n;i++){
        ll mx=0;
        for (int j=i;j<n;j++){
            mx=max(mx,(ll)H[j]);
            prefix[i][j+1]=prefix[i][j]+mx;
            // cout<<prefix[i][j+1]<<" ";
        }
        // cout<<endl;
    }
    
    vector<ll> C(q);
    for(int i=0;i<q;i++){
        ll mx=0;
        ll mn=LONG_LONG_MAX;
        vector<ll>maxs(n,0);
        for(int j=L[i];j<=R[i];j++){
            mx=max(mx,(ll)H[j]);
            maxs[j]=mx;
        }
        // for(int j=0;j<n;j++)cout<<maxs[j]<<' ';cout<<endl;
        for(int j=L[i];j<=R[i];j++){
            ll sm=0;
            sm+=H[j];
            // if(j!=L[i]){
            sm+=maxs[j]*(j-L[i]);
            // }
            sm+=prefix[j][R[i]+1]-prefix[j][j+1];
            if(sm<mn)mn=sm;
        }
        C[i]=mn;
    }
    return C;
}
// int main(){
//     vector<ll>c;
//     c=minimum_costs({2,4,3,5,4}, {0,1,0}, {2,3,4});
//     print(c);
// }

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