제출 #1005915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1005915		irmuun	모임들 (IOI18_meetings)	C++17	19 / 100	377 ms	786432 KiB

meetings

#include<bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
 
vector<ll>minimum_costs(vector<int>H,vector<int>L,vector<int>R){
    int n=H.size(),m=L.size();
    vector<ll>ans(m,1e18);
    ll l[n][n],r[n][n];
    for(int i=0;i<n;i++){
        int cur=0;
        ll total=0;
        for(int j=i;j<n;j++){
            cur=max(cur,H[j]);
            total+=cur;
            l[i][j]=total;
        }
    }
    for(int i=n-1;i>=0;i--){
        int cur=0;
        ll total=0;
        for(int j=i;j>=0;j--){
            cur=max(cur,H[j]);
            total+=cur;
            r[j][i]=total;
        }
    }
    for(int j=0;j<m;j++){
        for(int x=L[j];x<=R[j];x++){
            ans[j]=min(ans[j],r[L[j]][x]+l[x][R[j]]-H[x]);
        }
    }
    return ans;
}

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