Submission #615123

#	Time	Username	Problem	Language	Result	Execution time	Memory
615123		cheissmart	Holiday (IOI14_holiday)	C++14	7 / 100	5078 ms	2764 KiB

holiday

#include"holiday.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int INF = 1e9 + 7;

ll go(int n, int s, int d, int a[]) {
    priority_queue<int, vi, greater<int>> pq;
    ll ans = 0, sum = 0;
    int cost = 0;
    for(int i = s; i < n; i++) {
        pq.push(a[i]);
        sum += a[i];
        while(SZ(pq) + cost > d) {
            if(pq.empty()) return ans;
            sum -= pq.top();
            pq.pop();
        }
        ans = max(ans, sum);
        cost++;
    }
    return ans;
}

struct DS {
    vi a;
    V<pi> stk;
    int c, n;
    ll test(int d, int i) {
        if(i * c > d) return -1;
        d -= i * c;
        vi aux;
        for(int j = 0; j <= i; j++)
            aux.PB(a[j]);
        sort(ALL(aux));
        ll ans = 0;
        while(d && SZ(aux)) {
            ans += aux.back();
            aux.pop_back();
            d--;
        }
        return ans;
    }
    DS(vi _a, int _c) {
        a = _a;
        c = _c;
        n = SZ(a);
        for(int i = 0; i < n; i++) {
            while(SZ(stk) >= 2 && test(stk.back().F, stk.back().S) < test(stk.back().F, i))
                stk.pop_back();
            if(stk.empty())
                stk.EB(i * c, i);
            else {
                int lb = stk.back().F + 1, rb = INF;
                // find first x s.t. test(x, stk.back().S) < test(x, i)
                while(lb <= rb) {
                    int mb = (lb + rb) / 2;
                    if(test(mb, stk.back().S) < test(mb, i))
                        rb = mb - 1;
                    else
                        lb = mb + 1;
                }
                stk.EB(lb, i);
            }
        }
    }
    ll qry(int d) {
        // ll ans = 0;
        // for(int i = 0; i < n; i++)
            // ans = max(ans, test(d, i));
        // return ans;
        int it = upper_bound(ALL(stk), pi(d, INF)) - stk.begin() - 1;
        return test(d, stk[it].S);
    }
};

ll solve(int n, int s, int d, int a[]) { // go left in the first step
    if(s == 0) return 0;
    vi pl, pr;
    for(int i = s - 1; i >= 0; i--) pl.PB(a[i]);
    for(int i = s; i < n; i++) pr.PB(a[i]);
    DS dsl = DS(pl, 2);
    DS dsr = DS(pr, 1);
    ll ans = 0;
    for(int i = 0; i + 2 <= d; i++) {
        ans = max(ans, dsl.qry(i) + dsr.qry(d - i - 2));
    }
    return ans;
}

ll findMaxAttraction(int n, int s, int d, int a[]) {
    ll ans = go(n, s, d, a);

    ans = max(ans, solve(n, s, d, a));

    reverse(a, a + n);
    s = n - s - 1;

    ans = max(ans, go(n, s, d, a));
    ans = max(ans, solve(n, s, d, a));

    return ans;
}

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