Submission #1075358

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075358		mindiyak	Holiday (IOI14_holiday)	C++14	0 / 100	5049 ms	10472 KiB

holiday

#include"holiday.h"
#include <vector>
#include <set>
#include <iostream>
using namespace std;
#define ll long long 

ll ans = 0;

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {

    for(int k=1;k<(1<<n);k++){
        int a = n+1, b = -1, cnt = 0;
        ll val = 0;
        // cerr << k << " ";
        for(int i=0;i<n;i++){
            cerr << ((1<<i)&k);
            if(((1<<i)&k)>0){
                a = min(i,a);
                b = max(b,i);
                cnt ++;
                val += attraction[i];
            }
        }

        // cerr << " | " << a << " " << b;

        int len = b-a;
        a = min(abs(start - a),abs(start - b));

        // cerr << " | " << a << " " << len << " " << cnt << " " << val << endl;

        if((a+len+cnt) > d)continue;

        ans = max(ans,val);
    }

    return ans;
}

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