Submission #572545

#	Time	Username	Problem	Language	Result	Execution time	Memory
572545		Jesus	Holiday (IOI14_holiday)	C++14	23 / 100	16 ms	2708 KiB

holiday

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

using namespace std;

priority_queue<long long int> caso2;

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
        long long int res=0,aux=0;
        for(int i=0;i<n;i++){
            if(d==0){
                aux-=(caso2.top()*-1);
                caso2.pop();
                d++;
            }
            aux+=attraction[i];
            res=max(res,aux);
            caso2.push(attraction[i]*-1);
            d--;
            if(d==0){
                aux-=(caso2.top()*-1);
                caso2.pop();
            }
            else d--;
        }
        return res;
}

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