Submission #1153550

#TimeUsernameProblemLanguageResultExecution timeMemory
1153550BlockOG휴가 (IOI14_holiday)C++20
23 / 100
11 ms1224 KiB
#include "holiday.h"
#include <iostream>
#include <queue>

// meow mrrow nya nya :3c
// play vivid/stasis. free on steam

using namespace std;

long long findMaxAttraction(int n, int start, int d, int attraction[]) {
    long long res = 0;

    for (int j = 0; j <= start; j++) {
        long long sum = 0;
        priority_queue<int, vector<int>, greater<int>> q;
        for (int i = j, cd = d; i < n && cd; i++) {
            sum += attraction[i];
            q.push(attraction[i]);

            while (q.size() > cd) {
                sum -= q.top();
                q.pop();
            }

            if (i >= start) res = max(res, sum);
            cd -= 1 + (start < i && i <= 2 * start - j);
        }
    }

    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...