Submission #744697

#	Time	Username	Problem	Language	Result	Execution time	Memory
744697		PixelCat	Holiday (IOI14_holiday)	C++14	23 / 100	17 ms	2132 KiB

holiday

#include"holiday.h"
#ifdef NYAOWO
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

LL findMaxAttraction(int32_t n, int32_t start, int32_t d, int32_t a[]) {
    assert(start == 0);
    int sum = 0;
    priority_queue<int, vector<int>, greater<int>> pq;
    int res = 0;
    For(i, 0, min(d, n - 1)) {
        sum += a[i];
        pq.emplace(a[i]);
        while(sz(pq) + i > d) {
            sum -= pq.top();
            pq.pop();
        }
        res = max(res, sum);
    }
    return res;
}

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