제출 #1267392

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1267392		elotelo966	휴가 (IOI14_holiday)	C++20	7 / 100	5092 ms	1680 KiB

holiday

#include"holiday.h"
#include <bits/stdc++.h>
using namespace std;
 
//#define int long long
#define OYY LLONG_MAX
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define pb push_back
#define lim 100005

typedef long long lo;

int st;

int dizi[lim];

inline lo cal(int x,int y){
	lo sol=abs(x-st);
	lo sag=abs(y-st);
	return sol+sag+min(sol,sag);
}

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
	st=start+1;
	
	FOR{
		dizi[i]=attraction[i-1];
	}
	
	lo cev=0;
	
	for(int i=1;i<=st;i++){
		for(int j=st;j<=n;j++){
			lo git=cal(i,j);
			if(git>d)continue;
			lo kalan=d-git;
			vector<lo> tut;
			for(int o=i;o<=j;o++)tut.pb((lo)dizi[o]);
			sort(tut.rbegin(),tut.rend());
			lo cur_cev=0;
			for(int o=0ll;o<min(kalan,(lo)tut.size());o++)cur_cev+=(lo)tut[o];
			cev=max(cev,cur_cev);
		}
	}
	
	return cev;
}

//~ int32_t main(){
	//~ faster
	//~ cin>>n>>start>>d;
	
	//~ start++;
	
	//~ FOR{
		//~ cin>>dizi[i];
	//~ }
	
	//~ int cev=0;
	
	//~ for(int i=1;i<=start;i++){
		//~ for(int j=start;j<=n;j++){
			//~ int git=cal(i,j);
			//~ if(git>d)continue;
			//~ int kalan=d-git;
			//~ vector<int> tut;
			//~ for(int o=i;o<=j;o++)tut.pb(dizi[o]);
			//~ sort(tut.rbegin(),tut.rend());
			//~ int cur_cev=0;
			//~ for(int o=0;o<min(kalan,(int)tut.size());o++)cur_cev+=tut[o];
			//~ cout<<i<<" "<<j<<" "<<git<<" "<<cur_cev<<" "<<kalan<<endl;
			//~ cev=max(cev,cur_cev);
		//~ }
	//~ }
	
	//~ cout<<cev<<'\n';
	
	//~ return 0;
//~ }

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