//#include <iostream>
#include "holiday.h"
// #include <fstream>
// std::ifstream cin ("cbarn.in");
// std::ofstream cout ("cbarn.out");
// includes
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>
#include <bitset>
#include <complex>
// usings
using namespace std;
using namespace __gnu_pbds;
// misc
#define ll long long
#define ld long double
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template <typename T, typename U>
bool emin(T &a, const U &b) { return b < a ? a = b, true : false; }
template <typename T, typename U>
bool emax(T &a, const U &b) { return b > a ? a = b, true : false; }
typedef uint64_t hash_t;
// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()
#define vc vector<char>
#define vvc vector<vc>
// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second
// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T>
using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// maps
#define mii map<int, int>
#define mll map<ll, ll>
// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRE(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define FE(x, y) F(x, y + 1)
#define A(x, y) for (auto &x : y)
int N, D;
vl a; int z;
vpll lef, rig;
vpll seg; vi o;
void plop(int x){ seg[x] = {seg[x * 2].f + seg[x * 2 + 1].f, seg[x * 2].s + seg[x * 2 + 1].s}; }
void upd(int l, int r, int x, int v, pll y) {
if(r < v || l > v) return;
if(l == r) {seg[x] = y; return;}
int m = (l + r) / 2;
upd(l, m, x * 2, v, y); upd(m + 1, r, x * 2 + 1, v, y);
plop(x);
}
ll get(int l, int r, int x, int v){
if(seg[x].s <= v) return seg[x].f;
if(v <= 0) return 0;
int m = (l + r) / 2;
return get(l, m, x * 2, v) + get(m + 1, r, x * 2 + 1, v - seg[x * 2].s);
}
void go(int l, int r, int rl, int rr){
int m = (l + r) / 2;
ll bes = -1, p = -1;
for(int i = z + 1; i < rl; i++) upd(0, N * 2 - 1, 1, o[i], {a[i], 1});
for(int i = rl ; i <= rr; i++){
upd(0, N * 2 - 1, 1, o[i], {a[i], 1});
ll c = get(0, N * 2 - 1, 1, m - abs(z - i));
if(c > bes) bes = c, p = i;
}
for(int i = z + 1; i <= rr; i++) upd(0, N * 2 - 1, 1, o[i], {0, 0});
rig[m] = {bes, p};
if(l != r) go(l, m, rl, p), go(m + 1, r, p, rr);
}
void ge(int l, int r, int rl, int rr){
int m = (l + r) / 2;
ll bes = -1, p = -1;
for(int i = z - 1; i > rr; i--) upd(0, N * 2 - 1, 1, o[i], {a[i], 1});
for(int i = rr ; i >= rl; i--){
upd(0, N * 2 - 1, 1, o[i], {a[i], 1});
ll c = get(0, N * 2 - 1, 1, m - abs(z - i));
if(c > bes) bes = c, p = i;
}
for(int i = z - 1; i >= rl; i--) upd(0, N * 2 - 1, 1, o[i], {0, 0});
lef[m] = {bes, p};
if(l != r) ge(l, m, rl, p), ge(m + 1, r, p, rr);
}
ll findMaxAttraction(int n, int start, int d, int attraction[]){
N = n, D = d; a = vl(N); F(i, N) a[i] = attraction[i]; z = start;
seg = vpll(N * 4, {0, 0}); o = vi(N); vi temp(N); F(i, N) temp[i] = i;
sort(all(temp), [](auto x, auto y){return a[x] > a[y];});
F(i, N) o[temp[i]] = i;
lef = rig = vpll(D + 1, {0, start});
return 0;
if(start != N - 1) go(0, D, start + 1, N - 1);
if(start != 0) ge(0, D, 0, start - 1);
ll an = 0;
F(i, D) emax(rig[i + 1].f, rig[i].f), emax(lef[i + 1].f, lef[i].f);
emax(an, rig[D].f);
emax(an, rig[D - 1].f + a[start]);
emax(an, lef[D].f);
emax(an, lef[D - 1].f + a[start]);
FE(i, D) emax(an, rig[i].f + lef[max(0ll, D - i - rig[i].s + start)].f);
FE(i, D) emax(an, lef[i].f + rig[max(0ll, D - i - start + lef[i].s)].f);
F(i, D) emax(an, rig[i].f + lef[max(0ll, D - i - rig[i].s - 1 + start)].f + a[start]);
F(i, D) emax(an, lef[i].f + rig[max(0ll, D - i - start + lef[i].s - 1)].f + a[start]);
//FE(i, D) cout << rig[i].f << " " << rig[i].s << endl; cout << endl;
//FE(i, D) cout << lef[i].f << " " << lef[i].s << endl; cout << endl;
return an;
}
// int main(){
// int r[] = {10, 2, 20, 30, 1};
// cout << findMaxAttraction(5, 2, 7, r);
// }
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
600 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
14940 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
1116 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
16 ms |
17236 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
