Submission #229391

#	Time	Username	Problem	Language	Result	Execution time	Memory
229391		osaaateiasavtnl	Holiday (IOI14_holiday)	C++14	100 / 100	283 ms	49776 KiB

holiday

#include<bits/stdc++.h>                
#include"holiday.h"
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair                                                                                                       
#define f first
#define s second                                                                       
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 1e5 + 7;
int start, hol, a[N];
vector <int> c;

struct Node {
    int cnt;
    ll sum;
    int l, r;
};
int ptr = 0;
const int V = N * 20;
Node d[V];  
int t[N];

int newNode() {
    ++ptr;
    return ptr - 1;
}   

int build(int l, int r) {
    int t = newNode();
    if (l == r)
        return t;
    int m = (l + r) >> 1;
    d[t].l = build(l, m);
    d[t].r = build(m + 1, r);
    return t;
}   
int add(int t, int l, int r, int i) {
    int ans = newNode();
    if (l == r) {
        d[ans].cnt = d[t].cnt + 1;
        d[ans].sum = d[t].sum + c[i];
        return ans;
    }   
    int m = (l + r) >> 1;
    if (i <= m) {
        d[ans].l = add(d[t].l, l, m, i);
        d[ans].r = d[t].r;
    }   
    else {
        d[ans].l = d[t].l;
        d[ans].r = add(d[t].r, m + 1, r, i);
    }   
    d[ans].cnt = d[d[ans].l].cnt + d[d[ans].r].cnt;
    d[ans].sum = d[d[ans].l].sum + d[d[ans].r].sum;
    return ans;
}   
ll sum(int tl, int tr, int l, int r, int k) {
    if (l == r)
        return (ll)k * c[l];
    int m = (l + r) >> 1;
    int r_cnt = d[d[tr].r].cnt - d[d[tl].r].cnt;
    if (k <= r_cnt)
        return sum(d[tl].r, d[tr].r, m + 1, r, k);
    else
        return (d[d[tr].r].sum - d[d[tl].r].sum) + sum(d[tl].l, d[tr].l, l, m, k - r_cnt);
}   

ll ans = 0;
ll get(int l, int r) {
    int go = (start - l) + (r - start) + min(start - l, r - start);
    if (hol <= go)
        return 0;
    int k = hol - go;
    return sum(t[l], t[r + 1], 0, N, min(r - l + 1, k));
}   
int get_opt(int r, int opt_l, int opt_r) {
    ll nn = 0, opt = opt_l;
    for (int l = opt_l; l <= opt_r; ++l) {
        ll t = get(l, r);
        if (t > nn) {
            nn = t;
            opt = l;
        }   
    }   
    ans = max(ans, nn);
    return opt;
}   
void solve(int l, int r, int opt_l, int opt_r) {
    if (r < l)
        return;
    int m = (l + r) >> 1;
    int opt_m = get_opt(m, opt_l, opt_r);
    solve(l, m - 1, opt_l, opt_m);
    solve(m + 1, r, opt_m, opt_r);                        
}   
long long int findMaxAttraction(int n, int start_, int hol_, int a_[]) {
    for (int i = 0; i < V; ++i) {
        d[i].cnt = d[i].sum = 0;
        d[i].l = d[i].r = -1;
    }   

    start = start_;
    hol = hol_;
    for (int i = 0; i < n; ++i)
        a[i] = a_[i];

    for (int i = 0; i < n; ++i) 
        c.app(a[i]);
    sort(all(c));
    c.resize(unique(all(c)) - c.begin());
    for (int i = 0; i < n; ++i)
        a[i] = lower_bound(all(c), a[i]) - c.begin();
    
    t[0] = build(0, N);
    for (int i = 0; i < n; ++i) 
        t[i + 1] = add(t[i], 0, N, a[i]);

    solve(start, n - 1, 0, start);
    return ans;
}

• Subtask 1: 7 / 7
• Subtask 2: 23 / 23
• Subtask 3: 17 / 17
• Subtask 4: 53 / 53