Submission #516770

#	Time	Username	Problem	Language	Result	Execution time	Memory
516770		amukkalir	Holiday (IOI14_holiday)	C++17	7 / 100	5092 ms	680 KiB

holiday

#include <bits/stdc++.h>
#include"holiday.h"
using namespace std; 
typedef long long ll;

const int nax = 20; 
int n; 

int s, d; 

bool ok (int mask) {
    int l=n, r=0; 
    for(int i=0; (1<<i)<=mask; i++) {
        if(mask & (1<<i)) {
            l = min(l, i); 
            r = max(r, i); 
        }
    }

    int travel = (r-l) + min(abs(s-l), abs(r-s)); 
    return travel + __builtin_popcount(mask) <= d; 
}

long long int findMaxAttraction(int N, int S, int D, int attraction[]) {
    n = N; 
    s = S; d = D; 
    ll ans = 0; 

    for(int mask = 1; mask <(1<<n); mask++) {
        if(ok(mask)) {
            ll sum = 0; 
            for(int i=0; i<N; i++) if(mask & (1<<i)) sum += attraction[i]; 
            ans = max(ans, sum); 
        }
    }

    return ans; 
}

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