Submission #248421

#	Time	Username	Problem	Language	Result	Execution time	Memory
248421		kostia244	Meetings (IOI18_meetings)	C++17	0 / 100	50 ms	60824 KiB

meetings

#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 90100;
int n, q, h[maxn], l[maxn], r[maxn];
vector<ll> ans;
 
array<int, 3> tree[2*maxn];
array<int, 3> merge(array<int, 3> a, array<int, 3> b) {
	if(a[0] ^ b[0]) return a[0] > b[0] ? a : b;
	return {a[0], min(a[1], b[1]), max(a[2], b[2])};
}
void upd(int p, int v) {
	p += n;
	for(tree[p] = {v, p-n, p-n}; p>>=1;) tree[p] = merge(tree[p<<1], tree[p<<1|1]);
}
array<int, 3> get(int l, int r) {
	//cout << l << " " << r << '\n';
	array<int, 3> res = {-1, 0, 0};
	for(l += n, r += n+1; l < r; l>>=1, r>>=1) {
		if(l&1) res = merge(res, tree[l++]);
		if(r&1) res = merge(res, tree[--r]);
	}
	//cout << res[0] << " " << res[1] << " " << res[2] << '\n';
	return res;
}
 
ll ma[21][2*maxn];
void upda(int t, int p, ll v) {
	for(ma[t][p+=n] = v; p>>=1;) ma[t][p] = min(ma[t][p<<1], ma[t][p<<1|1]);
}
ll geta(int t, ll l, ll r) {
	ll ans = 1ll<<55;
	for(l += n, r += n+1; l < r; l>>=1, r>>=1) {
		if(l&1) ans = min(ans, ma[t][l++]);
		if(r&1) ans = min(ans, ma[t][--r]);
	}
	return ans;
}
 
map<pair<int, int>, ll> memo;
ll solve(int l, int r) {
	if(r < l) return 0;
	if(memo.count({l, r})) return memo[{l, r}];
	auto [V, tl, tr] = get(l, r);
	ll ans = min(V*1ll*(r-tl+1) + solve(l, tl-1), V*1ll*(tr-l+1) + solve(tr+1, r));
	if(n > 5000) ans = min(ans, V*1ll*(r-l+1) + geta(V, tl, tr-1));
	else ans = min(ans, V*1ll*(tl-l+1+r-tr+1) + geta(V, tl+1, tr-1));
	//cout << l << " " << r << " " << V << " " << tl << " " << tr << " / " << ans << '\n';
	return memo[{l, r}] = ans;
}
 
std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,
                                     std::vector<int> R) {
	q = L.size();
	n = H.size();
	for(int i = 0; i < n; i++) {
		h[i] = H[i];
		l[i] = L[i];
		r[i] = R[i];
	}
	ans.resize(q);
	for(int i = 0; i < n; i++) upd(i, h[i]);
	vector<int> lst(22, -1);
	memset(ma, 0x3f, sizeof ma);
	if(n > 5000)
	for(int i = 0; i < n; i++) {
		if(lst[h[i]] != -1) {
			upda(h[i], lst[h[i]], solve(lst[h[i]]+1, i-1) - h[i]*1ll*(i - lst[h[i]] - 1));
		}
		lst[h[i]] = i;
	}
	for(int i = 0; i < q; i++) ans[i] = solve(l[i], r[i]);
	return ans;
}

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