# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586254 | Tekor | Holiday (IOI14_holiday) | C++17 | 5016 ms | 6976 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;
#define pii pair <int,int>
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(),v.end()
#define ll long long
#define pll pair <ll,ll>
const int N = 3e5 + 100;
long long int findMaxAttraction(int n, int start, int d, int a[]) {
ll ans = 0;
if(start == 0) {
set <pll> q;
ll sum = 0;
for(int i = 0;i < n;i++) {
q.insert(mp(a[i],i));
sum += a[i];
int ost = d - i;
while(q.size() > ost) {
pll vv = *(q.begin());
q.erase(vv);
sum -= vv.f;
}
ans = max(ans,sum);
}
return ans;
}
for(int L = start;L >= 0;L--) {
set <pll> q;
ll sum = 0;
for(int j = start - 1;j >= L;j--) {
q.insert(mp(a[j],j));
sum += a[j];
}
for(int R = start;R < n;R++) {
int dist = min(R - start + R - L,start - L + R - L);
int ost = d - dist;
if(ost <= 0)break;
q.insert(mp(a[R],R));
sum += a[R];
while(q.size() > ost) {
pll vv = *(q.begin());
q.erase(vv);
sum -= vv.f;
}
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... |