Submission #589402

#	Time	Username	Problem	Language	Result	Execution time	Memory
589402		yutabi	Holiday (IOI14_holiday)	C++14	0 / 100	5050 ms	3008 KiB

holiday

#include"holiday.h"


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


typedef long long ll;








ll subtask(int n, int start, int d, int attraction[])
{
    ll ans=attraction[0];

    multiset <int> st;

    st.insert(-attraction[0]);

    ll sum=attraction[0];

    for(int i=1;i<n;i++)
    {
        sum+=attraction[i];
        st.insert(-attraction[i]);

        ll res=0;

        int j=0;
        for(multiset <int>::iterator it=st.begin();j<d-i && it!=st.end();j++,it++)
        {
            res+=-(*it);
        }

        //printf("%lld %lld\n",sum,res);

        ans=max(ans,res);
    }

    return ans;
}



long long int findMaxAttraction(int n, int start, int d, int attraction[])
{
    if(d==0)
    {
        return 0;
    }

    if(start==0)
    {
        return subtask(n,start,d,attraction);
    }

    assert(0);



    return 0;
}

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