/*************************************
* 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; }
// index from 0
template <class T = int>
struct Fenwick {
T *bit = nullptr;
int n;
Fenwick(int _n = 0) {
resize(_n);
}
void reset(void) {
fill(bit, bit + 1 + n, T(0));
}
void resize(int _n) {
if (bit != nullptr) delete[] bit;
n = _n;
bit = new T[n + 1];
reset();
}
void update(int i, T val) {
assert(0 <= i);
++i;
for (; i <= n; i += i & -i) bit[i] += val;
}
T get(int i) {
if (i < 0) return T(0);
++i;
i = min(i, n);
T res(0);
for (; i > 0; i -= i & -i)
res += bit[i];
return res;
}
int upper_bound(T val) {
int res = 0;
for (int i = __lg(n); i >= 0; --i) {
if ((res | MASK(i)) <= n && val >= bit[res | MASK(i)]) {
res |= MASK(i);
val -= bit[res];
}
}
return res;
}
int lower_bound(T val) {
int res = 0;
for (int i = __lg(n); i >= 0; --i) {
if ((res | MASK(i)) <= n && val > bit[res | MASK(i)]) {
res |= MASK(i);
val -= bit[res];
}
}
return res;
}
};
// 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] = values.end() - lower_bound(ALL(values), attraction[i]) - 1;
int m = values.size();
reverse(ALL(values));
auto solve = [&] {
int cur_l = 0, cur_r = -1;
Fenwick <int> cnt(m);
Fenwick <long long> sum(m);
auto update = [&] (int p, int v) {
cnt.update(p, v);
sum.update(p, v * values[p]);
};
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);
if (f > r - l) return sum.get(m);
int p = cnt.lower_bound(f);
return sum.get(p - 1) + 1LL * (f - cnt.get(p - 1)) * values[p];
};
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:138:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
138 | 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 |
0 ms |
596 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 |
596 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
1072 KB |
Output is correct |
| 2 |
Correct |
20 ms |
1068 KB |
Output is correct |
| 3 |
Correct |
21 ms |
980 KB |
Output is correct |
| 4 |
Correct |
21 ms |
1028 KB |
Output is correct |
| 5 |
Correct |
34 ms |
936 KB |
Output is correct |
| 6 |
Correct |
12 ms |
796 KB |
Output is correct |
| 7 |
Correct |
19 ms |
852 KB |
Output is correct |
| 8 |
Correct |
21 ms |
940 KB |
Output is correct |
| 9 |
Correct |
9 ms |
724 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
724 KB |
Output is correct |
| 2 |
Correct |
2 ms |
596 KB |
Output is correct |
| 3 |
Correct |
2 ms |
724 KB |
Output is correct |
| 4 |
Correct |
5 ms |
724 KB |
Output is correct |
| 5 |
Correct |
4 ms |
724 KB |
Output is correct |
| 6 |
Correct |
2 ms |
596 KB |
Output is correct |
| 7 |
Correct |
2 ms |
596 KB |
Output is correct |
| 8 |
Correct |
2 ms |
596 KB |
Output is correct |
| 9 |
Correct |
1 ms |
596 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
1068 KB |
Output is correct |
| 2 |
Correct |
58 ms |
3432 KB |
Output is correct |
| 3 |
Correct |
62 ms |
1908 KB |
Output is correct |
| 4 |
Correct |
6 ms |
724 KB |
Output is correct |
| 5 |
Correct |
2 ms |
596 KB |
Output is correct |
| 6 |
Correct |
2 ms |
596 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
328 ms |
3132 KB |
Output is correct |
| 9 |
Correct |
317 ms |
3236 KB |
Output is correct |
