Submission #1198994

#TimeUsernameProblemLanguageResultExecution timeMemory
1198994alindMeetings (IOI18_meetings)C++20
4 / 100
5595 ms1608 KiB
#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) {
	int Q = L.size();
	std::vector<long long> C(Q);
	for (int j = 0; j < Q; ++j) {
		ll mn = 1ll<<62;
		for (int m = L[j]; m <= R[j]; m++) {
			ll sm = 0;
			int mx = 0;
			for (int i = m; i >= L[j]; i--) {
				mx = max(mx, H[i]);
				sm += mx;
			}
			mx = 0;
			for (int i = m+1; i <= R[j]; i++) {
				mx = max(mx, H[i]);
				sm += mx;
			}
			mn = min(mn, sm);
		}
		C[j] = mn;
	}
	return C;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...