# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162048 | oolimry | 휴가 (IOI14_holiday) | C++14 | 5082 ms | 2388 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 arr[]) {
long long ovans = 0;
for(int l = start; l >= 0;l--){
priority_queue<long long, vector<long long>, greater<long long> > pq;
long long ans = 0;
long long visit = d - 2 * abs(l-start);
for(int i = l;i <= start;i++){
ans += arr[i];
pq.push(arr[i]);
}
for(int r = start;r < n;r++){
if(visit <= 0) break;
if(r != start){
pq.push(arr[r]);
ans += arr[r];
}
while(pq.size() > visit){
ans -= pq.top();
pq.pop();
}
//cout << l << " " << r << " " << visit << " " << ans << "\n";
ovans = max(ans,ovans);
visit--;
}
}
reverse(arr,arr+n);
start = n-start-1;
for(int l = start; l >= 0;l--){
priority_queue<long long, vector<long long>, greater<long long> > pq;
long long ans = 0;
long long visit = d - 2 * abs(l-start);
for(int i = l;i <= start;i++){
ans += arr[i];
pq.push(arr[i]);
}
for(int r = start;r < n;r++){
if(visit <= 0) break;
if(r != start){
pq.push(arr[r]);
ans += arr[r];
}
while(pq.size() > visit){
ans -= pq.top();
pq.pop();
}
//cout << l << " " << r << " " << visit << " " << ans << "\n";
ovans = max(ans,ovans);
visit--;
}
}
return ovans;
}
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... |