Submission #550557

#	Time	Username	Problem	Language	Result	Execution time	Memory
550557		CSQ31	Holiday (IOI14_holiday)	C++17	23 / 100	16 ms	1616 KiB

holiday

#include "holiday.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5;
typedef long long int ll;
int f[MAXN];
long long int findMaxAttraction(int n, int start, int d, int a[]) {
    ll ans = 0;
    priority_queue<int,vector<int>,greater<int>>pq;
    int cost = -1;
    ll sum = 0;
    if(start == 0){
		for(int i=0;i<n;i++){
			cost++;
			sum+=a[i];
			pq.push(a[i]);
			cost++;
			while(!pq.empty() && cost > d){
				cost--;
				sum-=pq.top();
				pq.pop();
			}
			if(cost > d)break;
			ans = max(ans,sum);
			//cout<<cost<<" "<<pq.size()<<'\n';
		}
	}
	return ans;
}

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