Submission #582279

#	Time	Username	Problem	Language	Result	Execution time	Memory
582279		Josia	Holiday (IOI14_holiday)	C++14	23 / 100	13 ms	2060 KiB

holiday

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

using namespace std;






long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    assert(start == 0);
    map<int, int> bestAttractions;
    int res = 0;
    int sum = 0;
    int inUse = 0;
    for (int i = 0; i<min(d, n); i++) {
        sum += attraction[i]; bestAttractions[attraction[i]]++; inUse++;

        while (i + inUse > d) {
            sum -= (*bestAttractions.begin()).first; bestAttractions[(*bestAttractions.begin()).first]--; inUse--;
            if (bestAttractions[(*bestAttractions.begin()).first] == 0) bestAttractions.erase((*bestAttractions.begin()).first);
        }
        // cerr << i << " " << inUse << "\n";

        res = max(sum, res);
    }

    return res;
}

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