| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 160977 | achibasadzishvili | 휴가 (IOI14_holiday) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#pragma GCC diagnostic warning "-std=c++11"
#define ll long long
#define int long long
#define f first
#define s second
#define pb push_back
#define N 100005
using namespace std;
long long n,d,s,a[N],lst[N];
long long ans,co,cur,z,kk,sum1,sum2,of;
int t;
vector<long long>s2[3*N];
vector<int>v[3*N],b[3*N],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]);
/*
if(x >= 100000){
cout << x << '\n';
for(auto t : v[x])cout << t << " ";
cout << '\n';
exit(0);
}
if(x >= 200000)exit(0);
*/
sort(g.begin() , g.end());
of=0;
int mid = g[((int)g.size() - 1) / 2];
for(int i=((int)g.size() - 1) / 2; i>=0; i--){
if(g[i] == mid)of++;
}
int raod = 0,pp = 0;
v[2*x].pb(0);b[2*x].pb(0);s2[2*x].pb(0);
v[2*x+1].pb(0);b[2*x+1].pb(0);s2[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);
s2[x].pb(sum2);
}
if(!pp){lst[x] = 1;return;}
build(2 * x);
build(2 * x + 1);
}
void count(int x,int L,int R,int raod){
//if(x >= 100000)exit(0);
if(lst[x] == 1){
if((int)v[x].size() <= 1)return;
co += min((ll)raod , (ll)((int)v[x].size() - 1)) * v[x][1];
return;
}
if(R - L + 1 - b[x][R] + b[x][L - 1] >= raod)
count(2 * x + 1 , L - b[x][L - 1] , R - b[x][R] , raod);
if(R - L + 1 - b[x][R] + b[x][L - 1] < raod){
co += s2[x][R] - s2[x][L - 1];
count(2 * x, b[x][L - 1] + 1 , b[x][R] , raod - (R - L + 1 - b[x][R] + b[x][L - 1]));
}
}
void buildwavelet(){
v[1].pb(0);
b[1].pb(0);
s2[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;
int mid = (x + y) / 2,ind = q; cur = -1;
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;
int mid = (x + y) / 2 , ind = -1; cur = -1;
for(int i=p; i<=q; i++){
z = get(i , mid , 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 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;
}
/*
main(){
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;
}
*/