# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586383 | LastRonin | Holiday (IOI14_holiday) | C++14 | 5076 ms | 5516 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>
#define ll long long
using namespace std;
long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
ll answ = 0;
for(int i = 0; i <= start; i++) {
multiset<ll> a;
ll sum = 0;
for(int j = i; j < start; j++)
a.insert(attraction[j]), sum += attraction[j];
for(int j = start; j < n; j++) {
a.insert(attraction[j]);
sum += attraction[j];
int enrg = d - min(2 * (j - start) + (start - i), (j - start) + 2 * (start - i));
if(enrg < 0)break;
while(a.size() > enrg) {
sum -= *a.begin();
a.erase(a.begin());
}
answ = max(answ, sum);
}
}
return answ;
}
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... |