# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
961583 | IUA_Hasin | Holiday (IOI14_holiday) | C++17 | 11 ms | 1628 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include"holiday.h"
#include <bits/stdc++.h>
#define endl "\n"
#define yeap cout<<"YES"<<endl
#define nope cout<<"NO"<<endl
#define ll long long
using namespace std;
const ll N = 100;
ll vis[N];
long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
ll sum = 0;
for(int i=0; i<n; i++){
sum = sum+attraction[i];
}
if(start==0){
if(d>=(2*n-1)){
return sum;
} else if(d<=2){
ll ans = attraction[0];
if(d==0){
return 0;
} else {
return ans;
}
} else {
ll a = min(d-1, n-1);
ll b;
if(d%2==0){
b = d/2;
} else {
b = floor(d/2)+1;
}
b--;
for(int i=0; i<b; i++){
ll a = attraction[i];
vis[a]++;
}
ll ans1 = 0;
for(int i=b; i<=a; i++){
ll a = attraction[i];
ll extr = d-i-1;
ll ans = 0;
for(int i=100; i>=0; i--){
if(vis[i]>0){
if(extr<=vis[i]){
ans = ans+i*extr;
break;
} else {
ans = ans+i*vis[i];
extr = extr-vis[i];
}
}
}
ans1 = max(ans1, ans);
vis[a++];
}
return ans1;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |