Submission #1143503

#TimeUsernameProblemLanguageResultExecution timeMemory
1143503simplemind_31Holiday (IOI14_holiday)C++20
0 / 100
5093 ms6824 KiB
#include"holiday.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> llset;
vector<ll> ATRA;
vector<vector<ll>> dp;
ll findMaxAttraction(int n,int start,int d,int attraction[]) {
    ll maxi=0;
    for(ll i=0;i<n;i++){
        llset res;
        ll sum=0;
        for(ll j=i;j<n;j++){
            ll usado;
            if(i<=start && j<=start){
                usado=abs(start-i);
            }else if(i>start && j>start){
                usado=abs(start-j);
            }else{
                usado=2*min(abs(start-i),abs(start-j))+max(abs(start-i),abs(start-j));
            }
            sum+=(ll)attraction[j];
            res.insert(attraction[j]);
            while(res.size()>0 && res.size()>d-usado){
                sum-=*res.begin();
                res.erase(res.begin());
            }
            maxi=max(maxi,sum);
        }
    }
    return maxi;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...