Submission #1019764

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019764		NValchanov	Holiday (IOI14_holiday)	C++17	23 / 100	123 ms	860 KiB

holiday

#include <bits/stdc++.h>
#include "holiday.h"

using namespace std;

typedef long long ll;

ll start0(int n, int d, int a[])
{
    ll ans = 0;

    map < ll, ll > m; 

    for(int i = 0; i < n; i++)
    {
        m[a[i]]++;

        ll ost = d - i;
        ll sum = 0;

        for(ll val = 100; val >= 1; val--)
        {
            if(ost == 0)
                break;

            ll cur = min(ost, m[val]);

            sum += cur * val;

            ost -= cur;
        }

        ans = max(ans, sum);
    }

    return ans;
}

ll slow(int n, int start, int d, int a[])
{
    return -1;
}

long long int findMaxAttraction(int n, int start, int d, int a[]) 
{
    if(start == 0)
        return start0(n, d, a);
    else
        return slow(n, start, d, a);
}

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