| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 153299 | arnold518 | Holiday (IOI14_holiday) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "holiday.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5;
const int MAXS = 2e6;
int N, S, D, A[MAXN+10];
vector<int> comp;
int getcomp(int x) { return lower_bound(comp.begin(), comp.end(), x)-comp.begin(); }
ll ans;
struct Node
{
int cnt; ll sum;
Node *lc, *rc;
Node() : cnt(0), sum(0), lc(0), rc(0) {}
};
Node nodes[MAXS+10]; int cnt=0;
Node *tree[MAXN+10];
Node *newNode()
{
return &nodes[cnt++];
}
void makeTree(Node *node, int tl, int tr)
{
if(tl==tr) return;
int mid=tl+tr>>1;
node->lc=newNode();
node->rc=newNode();
makeTree(node->lc, tl, mid);
makeTree(node->rc, mid+1, tr);
}
Node *addTree(Node *node, int tl, int tr, int pos)
{
Node *ret=newNode();
if(pos<tl || tr<pos) return node;
if(tl==tr)
{
ret->cnt=(node->cnt)+1;
ret->sum=(node->sum)+comp[pos];
return ret;
}
int mid=tl+tr>>1;
ret->lc=addTree(node->lc, tl, mid, pos);
ret->rc=addTree(node->rc, mid+1, tr, pos);
ret->cnt=(ret->lc->cnt)+(ret->rc->cnt);
ret->sum=(ret->lc->sum)+(ret->rc->sum);
return ret;
}
ll query(Node *nodel, Node *noder, int tl, int tr, int k)
{
if(tl==tr) return comp[tl]*min((ll)k, (noder->cnt)-(nodel->cnt));
int mid=tl+tr>>1;
ll t=(noder->rc->cnt)-(nodel->rc->cnt);
if(t>=k) return query(nodel->rc, noder->rc, mid+1, tr, k);
else return query(nodel->lc, noder->lc, tl, mid, k-t)+(noder->rc->sum)-(nodel->rc->sum);
}
int dist(int l, int r) { return D-(r-l+min(abs(S-l), abs(r-S))); }
void solve(int sl, int sr, int el, int er)
{
if(sl>sr) return;
int i, j;
int smid=sl+sr>>1, emid; ll val=-1;
for(i=max(smid, el); i<=er; i++)
{
ll t=query(tree[smid-1], tree[i], 1, comp.size()-1, dist(smid, i));
if(t>val) val=t, emid=i;
}
ans=max(ans, val);
solve(sl, smid-1, el, emid);
solve(smid+1, sr, emid, er);
}
ll findMaxAttraction(int _N, int _S, int _D, int *_A)
{
int i, j;
N=_N; S=_S; D=_D; S++;
for(i=1; i<=N; i++) A[i]=_A[i-1], comp.push_back(A[i]); comp.push_back(-1);
sort(comp.begin(), comp.end());
comp.erase(unique(comp.begin(), comp.end()), comp.end());
tree[0]=newNode();
makeTree(tree[0], 1, comp.size()-1);
for(i=1; i<=N; i++) tree[i]=addTree(tree[i-1], 1, comp.size()-1, getcomp(A[i]));
solve(1, N, 1, N);
return ans;
}