제출 #360393

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
360393		tengiz05	Meetings (IOI18_meetings)	C++17	19 / 100	803 ms	382332 KiB

meetings

#include "meetings.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 5005;
ll ans[MAXN][MAXN];
int n;
vector<ll> minimum_costs(vector<int> h, vector<int> L, vector<int> R){
	n = h.size();
	int Q = L.size();
	for(int i=0;i<n;i++){
		ll x = 0, res = 0;
		for(int j=i;j<n;j++){
			x = max(x, (ll)h[j]);
			res += x;
			ans[i][j] = res;
		}
	}
	for(int i=0;i<n;i++){
		ll x = 0, res = 0;
		for(int j=i;j>=0;j--){
			x = max(x, (ll)h[j]);
			res += x;
			ans[i][j] = res;
		}
	}
	vector<ll> ret;
	for(int q=0;q<Q;q++){
		int l = L[q], r = R[q];
		ll res = 1e18;
		for(int i=l;i<=r;i++){
			ll t = ans[i][l] + ans[i][r] - ans[i][i];
			res = min(res, t);
		}ret.push_back(res);
	}return ret;
}

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