Submission #412089

#	Time	Username	Problem	Language	Result	Execution time	Memory
412089		Mlxa	Meetings (IOI18_meetings)	C++14	0 / 100	311 ms	2196 KiB

meetings

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#include "meetings.h"

vector<ll> minimum_costs(vector<int> h, vector<int> l, vector<int> r) {
	int q = (int)l.size();
	vector<ll> c(q);
	for (int it = 0; it < q; ++it) {
		int mn = l[it];
		for (int i = l[it]; i <= r[it]; ++i) {
			if (h[mn] > h[i]) {
				mn = i;
			}
		}
		ll ans = -h[mn];
		int cur = h[mn];
		for (int i = mn; i <= r[it]; ++i) {
			cur = max(cur, h[i]);
			ans += cur;
		}
		cur = h[mn];
		for (int i = mn; i >= l[it]; --i) {
			cur = max(cur, h[i]);
			ans += cur;
		}
		c[it] = ans;
	}
	return c;
}

#ifdef LC
#include "grader.cpp"
#endif

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