Submission #584817

#	Time	Username	Problem	Language	Result	Execution time	Memory
584817		jack715	Holiday (IOI14_holiday)	C++14	7 / 100	5022 ms	724 KiB

holiday

#include"holiday.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define bb back
#define ff first
#define ss second

using namespace std;

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    ll ans = 0, D = d;
    for (ll state = 1; state < (1 << n); state++) {
        ll l = -1, r = 0, cnt = 0, now = 0;
        for (ll i = 0; i < n; i++) {
            if (state & (1 << i)) {
                if (l == -1) l = i;
                r = i;
                cnt++;
                now += attraction[i];
            }
        }

        if (l >= start) {
            if (r-start+cnt <= D)
                ans = max(ans, now);
        } else if (r <= start) {
            if (start-l+cnt <= D)
                ans = max(ans, now);
        } else {
            if (min(abs(start-l)*2+abs(start-r), abs(start-r)*2+abs(start-l))+cnt <= D)
                ans = max(ans, now);
        }
    }
    return ans;
}

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