# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
769052 | vjudge1 | Holiday (IOI14_holiday) | C++17 | 5069 ms | 2996 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include"holiday.h"
#include<bits/stdc++.h>
using namespace std;
long long findMaxAttraction(int n, int start, int d, int attraction[]) {
long long ans;
for(int l = 0; l <= start; l++) {
priority_queue<int, vector<int>, greater<int>> pq;
long long sum = 0;
for(int i = l; i < start; i++) {
pq.push(attraction[i]);
sum+=attraction[i];
}
for(int r = start; r < n; r++) {
int dis = r-l+min(start-l, r-start);
if(dis>=d) break;
pq.push(attraction[r]);
sum+=attraction[r];
while(pq.size()>d-dis) {
sum-=pq.top();
pq.pop();
}
ans = max(ans, sum);
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |