제출 #286143

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

meetings

#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
 
#define endl "\n"
// #define int long long

typedef long long ll ;
const ll ooo = 1e18 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;
const int N = 10000010  ;

vector<ll> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
	int Q = L.size();
	vector<ll> C(Q);
	for (int j = 0; j < Q; ++j) {
		ll ans = ooo;
		int l = L[j] , r = R[j];
		for(int x = l ; x <= r ; ++x){
			ll mx = H[x] , calc = H[x] ;
			for(int k = x - 1 ; k >= l; k--){
				mx = max(mx , (ll)H[k]);
				calc += mx ;
			}
			for(int k = x + 1 ; k <= r; k++){
				mx = max(mx , (ll)H[k]);
				calc += mx ;
			}
			ans = min(ans , calc);
		}
		C[j] = ans;
	}
	return C;
}

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