Submission #422294

#	Time	Username	Problem	Language	Result	Execution time	Memory
422294		dreezy	휴가 (IOI14_holiday)	C++17	7 / 100	5058 ms	676 KiB

holiday

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


/***********************/


long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
	ll ans = 0;
	for(int mask = 1; mask< (1<<n) ; mask++){
		
		ll posans = 0;
		int smallest = INT_MAX;
		int largest = 0;
		int numbits = 0;
		for(int i =0; i<n; i++){
			if(mask & (1<<i)){
				numbits++;
				smallest = min(i, smallest);
				largest = i;
				posans += attraction[i];
			}
		}
		
		int dist = largest - smallest;
		
		if(largest < start)
			dist += start - largest;
		else if(smallest > start)
			dist+= smallest -start;
			
		else
			dist+= min(start - smallest, largest - start);
		
		//if(smallest == largest && smallest == start)
			//cout <<dist<<endl;
		if(dist + numbits <= d){
			ans = max(ans, posans);
		}
	}

	
	
    return ans;
}
/***********************/

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