제출 #794002

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

meetings

#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll MAXN = 5e3 + 10;

ll FL[MAXN][MAXN], FR[MAXN][MAXN];

vector<ll> minimum_costs(std::vector<int> H, std::vector<int> L, std::vector<int> R) {
	int Q = L.size();	
	int n = H.size();
	vector<ll> ans(Q);

	for (int x = 0; x < n; x++) {
		ll mx = H[x];
		FL[x][x] = FR[x][x] = mx;
		for (int i = x - 1; i >= 0; i--) {
			mx = max(mx, ll(H[i]));
			FL[i][x] = FL[i + 1][x] + mx;
		}

		mx = H[x];
		for (int i = x + 1; i < n; i++) {
			mx = max(mx, ll(H[i]));
			FR[i][x] = FR[i - 1][x] + mx;
		}
	}

	for (int i = 0; i < Q; i++) {
		ans[i] = numeric_limits<ll>::max();
		for (int x = L[i]; x <= R[i]; x++)
			ans[i] = min(ans[i], FL[L[i]][x] + FR[R[i]][x] - H[x]);
	}

	return ans;
}

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