Submission #1147834

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147834		Luvidi	Holiday (IOI14_holiday)	C++20	47 / 100	5089 ms	5448 KiB

holiday

#include"holiday.h"
#include <bits/stdc++.h>
using namespace std;

long long int findMaxAttraction(int n, int s, int d, int a[]) {
    long long ans=0;
    for(int i=s;i>-1&&s-i<=d;i--){
        multiset<long long> c;
        long long sum=0;
        for(int j=i;j<s;j++){
            c.insert(a[j]);
            sum+=a[j];
        }
        while(c.size()+s-i>d){
            sum-=*c.begin();
            c.erase(c.find(*c.begin()));
        }
        for(int j=s;j<n&&min(s-i,j-s)+j-i<=d;j++){
            c.insert(a[j]);
            sum+=a[j];
            while(c.size()+min(s-i,j-s)+j-i>d){
                sum-=*c.begin();
                c.erase(c.find(*c.begin()));
            }
            ans=max(ans,sum);
        }
    }
    return ans;
}

• Subtask 1: 7 / 7
• Subtask 2: 23 / 23
• Subtask 3: 17 / 17
• Subtask 4: 0 / 53