#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define N 100005
using namespace std;
int n,d,s,a[N],tt;
bool lst[3 * N + 60000];
long long ans,co,cur,z,kk,sum1,sum2,of;
int t,raod,pp,mid,ind;
vector<long long>v[3*N + 60000];
vector<int>b[3*N + 60000],g;
void build(int x){
if((int)v[x].size() <= 1){
lst[x] = 1;
return;
}
g.clear();
for(int i=1; i<v[x].size(); i++)
g.pb(v[x][i]);
sort(g.begin() , g.end());
if(g[0] == g[g.size() - 1]){
lst[x] = 1;
return;
}
of=0;
mid = g[((int)g.size() - 1) / 2];
for(int i=((int)g.size() - 1) / 2; i>=0; i--){
if(g[i] == mid)of++;
}
raod = 0,pp = 0;
v[2*x].pb(0);b[2*x].pb(0);
v[2*x+1].pb(0);b[2*x+1].pb(0);
kk = v[x][1] , sum1 = 0 , sum2 = 0;
for(int i=1; i<v[x].size(); i++){
t = v[x][i];
if(t == mid)of--;
if(t != kk)pp = 1;
if(t <= mid && !(t == mid && of < 0)){
v[2 * x].pb(t);
sum1 += t;
raod++;
}
else{
v[2 * x + 1].pb(t);
sum2 += t;
}
b[x].pb(raod);
v[x][i] = sum2;
}
if(!pp){lst[x] = 1;return;}
build(2 * x);
build(2 * x + 1);
}
void count(int x,int L,int R,int rao){
//if(x >= 100000)exit(0);
if(lst[x] == 1){
if((int)v[x].size() <= 1)return;
co += min((ll)rao , (ll)((int)v[x].size() - 1)) * v[x][1];
return;
}
if(R - L + 1 - b[x][R] + b[x][L - 1] >= rao)
count(2 * x + 1 , L - b[x][L - 1] , R - b[x][R] , rao);
if(R - L + 1 - b[x][R] + b[x][L - 1] < rao){
co += v[x][R] - v[x][L - 1];
count(2 * x, b[x][L - 1] + 1 , b[x][R] , rao - (R - L + 1 - b[x][R] + b[x][L - 1]));
}
}
void buildwavelet(){
v[1].pb(0);
b[1].pb(0);
for(int i=1; i<=n; i++)
v[1].pb(a[i]);
build(1);
}
ll get(int x,int y,int k){
co = 0;
count(1 , x , y , k);
return co;
}
void solve(int x,int y,int p,int q){
if(y < x || q < 1 || p > n)return;
mid = (x + y) / 2,ind = q; cur = -100000000000000;
for(int i=p; i<=q; i++){
z = get(i , mid , d - 2 * (mid - s) - (s - i));
if(z > cur){
cur = z;
if(z > ans)ans = z;
ind = i;
}
}
solve(x , mid - 1 , p , ind);
solve(mid + 1 , y , ind , q);
}
void solverev(int x,int y,int p,int q){
if(y < x || q < 1 || p > n)return;
mid = (x + y) / 2 , ind = p; cur = -100000000000000;
for(int i=p; i<=q; i++){
z = get(mid , i , d - 2 * (s - mid) - (i - s));
if(z > cur){
cur = z;
ind = i;
if(z > ans)ans = z;
}
}
solverev(x , mid - 1 , p , ind);
solverev(mid + 1 , y , ind , q);
}
long long int findMaxAttraction(int nnn,int sss,int ddd, int aaa[]){
n = nnn;
s = sss + 1;
d = ddd;
for(int i=1; i<=n; i++)a[i] = aaa[i - 1];
ans = 0;
buildwavelet();
solve(s , n , 1 , s - 1);
for(int i=s; i<=n; i++){
z = get(s , i , d - (i - s));
if(z > ans)
ans = z;
}
for(int i=s; i>=1; i--){
z = get(i , s , d - (s - i));
if(z > ans)
ans = z;
}
solverev(1 , s , s + 1 , n);
return ans;
}
/*
int main(){
ifstream cin("input.in");
int nn,aa[200005],ss,dd;
cin >> nn >> ss >> dd;
for(int i=0; i<nn; i++){
cin >> aa[i];
}
cout << findMaxAttraction(nn , ss , dd , aa) << endl;
return 0;
}
*/
Compilation message
holiday.cpp: In function 'void build(int)':
holiday.cpp:20:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1; i<v[x].size(); i++)
~^~~~~~~~~~~~
holiday.cpp:36:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1; i<v[x].size(); i++){
~^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
17272 KB |
Output is correct |
2 |
Correct |
17 ms |
17272 KB |
Output is correct |
3 |
Correct |
17 ms |
17240 KB |
Output is correct |
4 |
Correct |
18 ms |
17272 KB |
Output is correct |
5 |
Correct |
18 ms |
17272 KB |
Output is correct |
6 |
Correct |
17 ms |
17272 KB |
Output is correct |
7 |
Correct |
18 ms |
17276 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
34 ms |
19820 KB |
Output is correct |
2 |
Correct |
35 ms |
19764 KB |
Output is correct |
3 |
Correct |
62 ms |
21912 KB |
Output is correct |
4 |
Correct |
42 ms |
21840 KB |
Output is correct |
5 |
Correct |
94 ms |
31236 KB |
Output is correct |
6 |
Correct |
40 ms |
21108 KB |
Output is correct |
7 |
Correct |
61 ms |
24816 KB |
Output is correct |
8 |
Correct |
68 ms |
25200 KB |
Output is correct |
9 |
Correct |
35 ms |
20724 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
18168 KB |
Output is correct |
2 |
Correct |
18 ms |
17272 KB |
Output is correct |
3 |
Correct |
24 ms |
18112 KB |
Output is correct |
4 |
Correct |
28 ms |
18148 KB |
Output is correct |
5 |
Correct |
26 ms |
18040 KB |
Output is correct |
6 |
Correct |
39 ms |
17528 KB |
Output is correct |
7 |
Correct |
22 ms |
17528 KB |
Output is correct |
8 |
Correct |
20 ms |
17400 KB |
Output is correct |
9 |
Correct |
21 ms |
17452 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
19692 KB |
Output is correct |
2 |
Correct |
232 ms |
53024 KB |
Output is correct |
3 |
Correct |
265 ms |
34016 KB |
Output is correct |
4 |
Correct |
29 ms |
18168 KB |
Output is correct |
5 |
Correct |
21 ms |
17528 KB |
Output is correct |
6 |
Correct |
21 ms |
17656 KB |
Output is correct |
7 |
Correct |
20 ms |
17400 KB |
Output is correct |
8 |
Correct |
729 ms |
53592 KB |
Output is correct |
9 |
Correct |
719 ms |
53624 KB |
Output is correct |