제출 #505987

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
505987		sidon	Candies (JOI18_candies)	C++17	100 / 100	140 ms	11056 KiB

candies

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
const int Z = 200'002;
 
/*
Take maximum value (say A[i]) for K = 1, then we have that we either
take A[i] or both A[i-1] and A[i+1]. So add a virtual element weighing
A[i-1] - A[i] + A[i+1] replacing these three elements. Now solve
inductively for (K - 1).
*/
 
int N, K, L[Z], R[Z], r[Z];
ll A[Z], sum;
 
int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> N;

	priority_queue<array<ll, 2>> pq;
 
	for(int i = 1; i <= N; i++) {
		cin >> A[i];
		L[i] = i - 1;
		R[i] = i + 1;
		pq.push({A[i], i});
	}
 
	R[N+1] = N+1;
	R[0] = 1, L[N+1] = N;
	r[0] = r[N+1] = 1;
 
	for(int k = 1; k<=(N+1)/2; k++) {
		while(r[pq.top()[1]]) pq.pop();
 
		auto [v, i] = pq.top(); pq.pop();
 
		cout << (sum += v) << '\n';
		r[i] = r[L[i]] || r[R[i]];
		if(!r[L[i]]) v -= A[L[i]], r[L[i]] = 1, R[L[i] = L[L[i]]] = i;
		if(!r[R[i]]) v -= A[R[i]], r[R[i]] = 1, L[R[i] = R[R[i]]] = i;

		if(!r[i]) pq.push({A[i] = -v, i});
	}
}

• Subtask 1: 8 / 8
• Subtask 2: 92 / 92