제출 #713758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
713758		Astrayt	모임들 (IOI18_meetings)	C++17	0 / 100	2501 ms	504608 KiB

meetings

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

vector<long long> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
  	int N = H.size(), Q = L.size();
	vector<long long> A(Q);
	vector<vector<long long>> cost(N, vector<long long>(N, 0));
	for(int i = 0; i < N; ++i){
		for(int j = i - 1, c = H[i]; j >= 0; --j){
			c = max(c, H[j]);
			cost[j][i] = cost[j + 1][i] + 1ll * c;
		}
		for(int j = i + 1, c = H[i]; j < N; ++j){
			c = max(c, H[j]);
			cost[i][j] = cost[i][j - 1] + 1ll * c;
		}
	}
	for(int i = 0; i < Q; ++i){
		long long ans = 1e18;
		for(int j = L[i]; j <= R[i]; ++j){
			long long C = cost[L[i]][j] + 1ll * H[j] + cost[j][R[i]];
			ans = min(ans, C);
		}
		assert(ans > 0);
		A[i] = ans;
	}
  	return A;
}

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