제출 #422290

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422290		dreezy	휴가 (IOI14_holiday)	C++17	0 / 100	5082 ms	680 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 = INT_MAX;
		
		if(smallest <= start){
			if(largest < start){
				dist = start - smallest;
			}
			else{
				dist = start - smallest + largest - smallest;
			}
		}
		if (largest > start){
			if(smallest > start){
				dist = min(dist, largest - start);
			}
			else{
				dist = min(dist, largest - smallest + largest - start);
			}
		}
		//if(smallest == largest && smallest == start)
			//cout <<dist<<endl;
		if(dist + numbits <= d){
			ans = max(ans, posans);
		}
	}

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

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