| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1267189 | elotelo966 | Holiday (IOI14_holiday) | C++20 | 0 ms | 0 KiB |
#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 n,start,d;
int dizi[lim];
inline lo cal(int x,int y){
lo sol=abs(x-start);
lo sag=abs(y-start);
return sol+sag+min(sol,sag);
}
long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
start++;
FOR{
dizi[i]=attraction[i-1];
}
lo cev=0;
for(int i=1;i<=start;i++){
for(int j=start;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,(int)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;
//~ }