Submission #15706

#	Time	Username	Problem	Language	Result	Execution time	Memory
15706		gs14004	Holiday (IOI14_holiday)	C++14	47 / 100	5000 ms	2644 KiB

holiday

#include"holiday.h"
#include <cstdio>
#include <queue>
using namespace std;
typedef long long lint;
priority_queue<int, vector<int>, greater<int> > pq;

int opt[100005];

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
	lint ret = 0;
	int beforeMax = 0;
	for(int i=0; i<=start; i++){
		lint cret = 0;
		lint pcret = 0;
		int pos = 0;
		for(int j=i; j<start; j++){
			pq.push(attraction[j]);
			cret += attraction[j];
		}
		for(int j=start; j<n; j++){
			pq.push(attraction[j]);
			cret += attraction[j];
			while(!pq.empty() && (int)pq.size() > d - (j - i + min(j - start, start - i) )){
				cret -= pq.top();
				pq.pop();
			}
			if(j >= beforeMax && cret > pcret){
				pcret = cret;
				beforeMax = j;
			}
		}
		while(!pq.empty()) pq.pop();
		cret = 0;
		for(int j=i; j<=beforeMax; j++){
			pq.push(attraction[j]);
			cret += attraction[j];
			while(!pq.empty() && j >= start && (int)pq.size() > d - (j - i + min(j - start, start - i) )){
				cret -= pq.top();
				pq.pop();
			}
		}
		ret = max(ret, cret);
		while(!pq.empty()) pq.pop();
	}
	return ret;
}

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