/*************************************
* author: marvinthang *
* created: 08.06.2023 17:57:18 *
*************************************/
#include "holiday.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b) { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b) { if (a < b) { a = b; return true; } return false; }
// end of template
long long findMaxAttraction(int n, int start, int d, int attraction[]) {
vector <int> values(attraction, attraction + n);
sort(ALL(values));
values.erase(unique(ALL(values)), values.end());
REP(i, n) attraction[i] = lower_bound(ALL(values), attraction[i]) - values.begin();
auto solve = [&] {
int cur_l = 0, cur_r = -1;
vector <int> cnt(values.size() * 4 + 23);
vector <long long> sum(values.size() * 4 + 23);
function <void(int, int, int, int, int)> upd = [&] (int i, int l, int r, int p, int v) {
if (r - l == 1) {
cnt[i] += v;
sum[i] += v * values[l];
return;
}
int m = l + r >> 1;
if (p < m) upd(i << 1, l, m, p, v);
else upd(i << 1 | 1, m, r, p, v);
cnt[i] = cnt[i << 1] + cnt[i << 1 | 1];
sum[i] = sum[i << 1] + sum[i << 1 | 1];
};
auto update = [&] (int p, int v) {
upd(1, 0, values.size(), p, v);
};
auto get_a = [&] (int l, int r) {
int f = d - (start - l + r - l);
if (f < 0) return 0LL;
while (cur_l > l) update(attraction[--cur_l], +1);
while (cur_r < r) update(attraction[++cur_r], +1);
while (cur_l < l) update(attraction[cur_l++], -1);
while (cur_r > r) update(attraction[cur_r--], -1);
int i = 1; l = 0, r = values.size();
long long res = 0;
while (true) {
if (r - l == 1) return res + 1LL * min(f, cnt[i]) * values[l];
int m = l + r >> 1;
if (cnt[i << 1 | 1] < f) {
f -= cnt[i << 1 | 1];
res += sum[i << 1 | 1];
i = i << 1;
r = m;
} else {
i = i << 1 | 1;
l = m;
}
}
return 0LL;
};
function <long long(int, int, int, int)> dnc = [&] (int l, int r, int from, int to) {
if (l > r) return 0LL;
int m = l + r >> 1;
long long best = -1, pos = from;
FORE(i, from, to) if (maximize(best, get_a(m, i))) pos = i;
return max({best, dnc(l, m - 1, from, pos), dnc(m + 1, r, pos, to)});
};
return dnc(0, start, start, n - 1);
};
long long res = solve();
reverse(attraction, attraction + n);
start = n - start - 1;
maximize(res, solve());
return res;
}
#ifdef LOCAL
#include <cstdio>
#include "holiday.h"
int main() {
file("holiday");
int n, start, d;
int attraction[100000];
int i, n_s;
n_s = scanf("%d %d %d", &n, &start, &d);
for (i = 0 ; i < n; ++i) {
n_s = scanf("%d", &attraction[i]);
}
printf("%lld\n", findMaxAttraction(n, start, d, attraction));
return 0;
}
#endif
Compilation message
holiday.cpp: In lambda function:
holiday.cpp:63:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
63 | int m = l + r >> 1;
| ~~^~~
holiday.cpp: In lambda function:
holiday.cpp:83:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
83 | int m = l + r >> 1;
| ~~^~~
holiday.cpp: In lambda function:
holiday.cpp:98:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
98 | int m = l + r >> 1;
| ~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
Output is correct |
| 2 |
Correct |
1 ms |
596 KB |
Output is correct |
| 3 |
Correct |
1 ms |
596 KB |
Output is correct |
| 4 |
Correct |
1 ms |
684 KB |
Output is correct |
| 5 |
Correct |
1 ms |
596 KB |
Output is correct |
| 6 |
Correct |
1 ms |
596 KB |
Output is correct |
| 7 |
Correct |
1 ms |
688 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
32 ms |
1180 KB |
Output is correct |
| 3 |
Correct |
53 ms |
1208 KB |
Output is correct |
| 4 |
Correct |
46 ms |
1284 KB |
Output is correct |
| 5 |
Correct |
125 ms |
1324 KB |
Output is correct |
| 6 |
Correct |
46 ms |
876 KB |
Output is correct |
| 7 |
Correct |
75 ms |
1052 KB |
Output is correct |
| 8 |
Correct |
83 ms |
1120 KB |
Output is correct |
| 9 |
Correct |
33 ms |
724 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
832 KB |
Output is correct |
| 2 |
Correct |
1 ms |
704 KB |
Output is correct |
| 3 |
Correct |
7 ms |
832 KB |
Output is correct |
| 4 |
Correct |
20 ms |
852 KB |
Output is correct |
| 5 |
Correct |
17 ms |
724 KB |
Output is correct |
| 6 |
Correct |
4 ms |
724 KB |
Output is correct |
| 7 |
Correct |
4 ms |
724 KB |
Output is correct |
| 8 |
Correct |
5 ms |
596 KB |
Output is correct |
| 9 |
Correct |
4 ms |
596 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
41 ms |
1072 KB |
Output is correct |
| 2 |
Correct |
354 ms |
6608 KB |
Output is correct |
| 3 |
Correct |
223 ms |
3368 KB |
Output is correct |
| 4 |
Correct |
14 ms |
848 KB |
Output is correct |
| 5 |
Correct |
4 ms |
724 KB |
Output is correct |
| 6 |
Correct |
4 ms |
724 KB |
Output is correct |
| 7 |
Correct |
4 ms |
696 KB |
Output is correct |
| 8 |
Correct |
1256 ms |
6132 KB |
Output is correct |
| 9 |
Correct |
1260 ms |
6044 KB |
Output is correct |
