Submission #572528

#	Time	Username	Problem	Language	Result	Execution time	Memory
572528		Leo121	Holiday (IOI14_holiday)	C++14	23 / 100	16 ms	1564 KiB

holiday

#include <bits/stdc++.h>
#include"holiday.h"

#define for0(i, n) for(int i = 0; i < int(n); ++ i)

using namespace std;

typedef long long ll;

priority_queue<int> pq;

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    ll res = 0, aux = 0;
    int cantidad, aux2;
    if(!start){
        for0(i, n){
            aux += (ll) attraction[i];
            pq.push(-1 * attraction[i]);
            cantidad = d - i;
            while((int) pq.size() > cantidad){
                aux2 = pq.top();
                pq.pop();
                aux -= (ll) aux2 * -1LL;
            }
            res = max(res, aux);
        }
    }
    return res;
}

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