Submission #1074031

#	Time	Username	Problem	Language	Result	Execution time	Memory
1074031		Gromp15	Radio Towers (IOI22_towers)	C++17	0 / 100	4070 ms	94256 KiB

towers

#include <bits/stdc++.h>
#include "towers.h"
#define ll long long
#define ar array
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T> bool ckmin(T &a, const T &b ) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b ) { return a < b ? a = b, 1 : 0; }

int N; vector<int> h;
void init(int _N, std::vector<int> H) {
	N = _N;
	h = H;
}

int max_towers(int L, int R, int D) {
	map<ar<int, 3>, int> mp;
	auto solve = [&](auto&& s, int l, int r, int lim) -> int {
		if (mp.count({l, r, lim})) return mp[{l, r, lim}];
		if (l > r) return 0;
		if (l == r) return h[l] <= lim;
		int p = l;
		for (int i = l+1; i <= r; i++) if (h[i] > h[p]) p = i;
		return mp[{l, r, lim}] = max({s(s, l, p-1, lim), s(s, p+1, r, lim), int(h[p] <= lim), s(s, l, p-1, h[p] - D) + s(s, p+1, r, h[p] - D)});
	};
	solve(solve, L, R, 1e9);
	return solve(solve, L, R, 1e9);
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23