# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122155 | brcode | Holiday (IOI14_holiday) | C++14 | 5095 ms | 2176 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 <iostream>
#include <queue>
#include <holiday.h>
using namespace std;
long long int findMaxAttraction(int n, int start, int d,int attraction[]){
if(start == 0){
priority_queue<int> pq;
int sum = 0;
int ans = 0;
for(int i=0;i<n;i++){
pq.push(-1*attraction[i]);
sum+=attraction[i];
while(pq.size()+i>d){
int hold = pq.top();
sum+=hold;
pq.pop();
}
ans= max(sum,ans);
}
return ans;
}else{
int ans = 0;
for(int l=0;l<=start;l++){
priority_queue<int> pq;
int sum = 0;
for(int i=l;i<start;i++){
pq.push(-1*attraction[i]);
sum+=attraction[i];
}
for(int r=start;r<n;r++){
if(r-l+1>d){
break;
}
pq.push(-1*attraction[r]);
sum+=attraction[r];
while(pq.size()+r-l+1>d){
int hold = pq.top();
sum+=hold;
pq.pop();
}
ans = max(ans,sum+(r-l)+min(start-l,r-start));
}
}
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... |