Submission #586573

#	Time	Username	Problem	Language	Result	Execution time	Memory
586573		SeDunion	Holiday (IOI14_holiday)	C++17	24 / 100	5068 ms	5348 KiB

holiday

#include"holiday.h"
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
 
using namespace std;
using ll = long long;
 
const int N = 222;
const int D = 2*N + N/2;

ll sum = 0;
multiset<ll>st;
 
ll findMaxAttraction(int n, int start, int d, int attraction[]) {
	ll ans = 0;
	for (int _ = 0 ; _ < 2 ; ++ _) {
		for (int i = start ; i < n ; ++ i) {
			int x = d - (i - start);
			st.clear();
			sum = 0;
			for (int j = i ; j >= 0 ; -- j) {
				sum += attraction[j];
				st.insert(attraction[j]);
				int y = x - (i - j);
				if (y < 0) break;
				while ((int)st.size() > y) {
					sum -= *st.begin();
					st.erase(st.begin());
				}
				ans = max(ans, sum);
			}
		}
		reverse(attraction, attraction + n);
		start = n - start - 1;
	}
	return ans;
}

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