Submission #550618

#	Time	Username	Problem	Language	Result	Execution time	Memory
550618		CSQ31	Holiday (IOI14_holiday)	C++17	0 / 100	18 ms	680 KiB

holiday

#include "holiday.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5;
typedef long long int ll;
long long int findMaxAttraction(int n, int start, int d, int a[]) {
	ll ans = 0;
	if(start==0){
		vector<int>cnt(101,0);
		d++;
		for(int i=0;i<n;i++){
			d--;
			if(d<=0)break;
			cnt[a[i]]++;
			ll tot = 0;
			ll sum = 0;
			for(ll j=100;j>=0;j--){
				tot+=cnt[j];
				sum+=cnt[j] * j;
				//if(tot <= d)ans = max(ans,sum);
				if(tot-cnt[j]<=d && tot>=d){
					ans = max(ans,sum - (tot-d) * j);
				}
			}
		}
	}
	return ans;
}

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