# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254552 | b00n0rp | Holiday (IOI14_holiday) | C++17 | 5075 ms | 2868 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 int findMaxAttraction(int n, int start, int d, int attraction[]) {
long long ans = 0;
for(int l = 0; l <= start; l ++){
priority_queue<int,vector<int>,greater<int> > pq;
long long cur = 0;
for(int i = l; i < start; i ++){
pq.push(attraction[i]);
cur += attraction[i];
}
for(int r = start; r < n; r++){
int gg = d-2*min(start-l,r-start)-max(start-l,r-start);
pq.push(attraction[r]);
cur += attraction[r];
if(gg <= 0) break;
while(pq.size() > gg){
cur -= pq.top();
pq.pop();
}
ans = max(ans,cur);
}
}
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... |