제출 #297586

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297586		eohomegrownapps	모임들 (IOI18_meetings)	C++14	0 / 100	1 ms	416 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,
                                     std::vector<int> R) {
	ll n = H.size();
	vector<vector<ll>> rangemax(n,vector<ll>(n,0));
	for (ll l = 0; l<n; l++){
		for (ll r = l; r<n; r++){
			rangemax[l][r]=max(ll(H[r]),(l==0?0:rangemax[l][r-1]));
		}
	}
	vector<vector<ll>> rangemaxprefsum(n,vector<ll>(n,0));
	for (ll r = 0; r<n; r++){
		rangemaxprefsum[r][r]=rangemax[r][r];
		for (ll l = r-1; l>=0; l--){
			rangemaxprefsum[l][r]=rangemaxprefsum[l+1][r]+rangemax[l][r];
		}
	}
	vector<vector<ll>> rangemaxsuffsum(n,vector<ll>(n,0));
	for (ll l = n-1; l>=0; l--){
		rangemaxsuffsum[l][l]=rangemax[l][l];
		for (ll r = l; r<n; r++){
			rangemaxsuffsum[l][r]=rangemaxsuffsum[l][r-1]+rangemax[l][r];
		}
	}
	ll q = L.size();
	vector<ll> ans(q,1e18);
	for (ll i = 0; i<q; i++){
		for (ll x = L[i]; x<=R[i]; x++){
			ans[i]=min(ans[i],rangemaxprefsum[L[i]][x]+rangemaxsuffsum[x+1][L[i]]);
		}
	}
	return ans;
}

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