Submission #985472

#	Time	Username	Problem	Language	Result	Execution time	Memory
985472		Math4Life2020	Split the sequence (APIO14_sequence)	C++17	0 / 100	13 ms	2256 KiB

sequence

// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

void solve(long long N, long long K, vector<long long> a) {
	long long tval = 0;
	for (long long i=0;i<N;i++) {
		tval += a[i];
	}
	tval = tval*tval;
	deque<long long> d[K+1];
	long long dsums[K+1];
	for (long long i=0;i<=K;i++) {
		dsums[i]=0;
	}
	for (long long i=0;i<N;i++) {
		d[0].push_back(a[i]);
		dsums[0] += a[i];
	}
	for (long long t=0;t<(2*N);t++) {
		for (long long i=0;i<K;i++) {
			while (1) {
				long long r = d[i].back();
				if (max(dsums[i]-r,dsums[i+1]+r)<max(dsums[i],dsums[i+1])) {
					d[i].pop_back();
					d[i+1].push_front(r);
					dsums[i]=dsums[i]-r;
					dsums[i+1]=dsums[i+1]+r;
				} else {
					break;
				}
			}
		}
	}
	for (long long i=0;i<=K;i++) {
		tval -= dsums[i]*dsums[i];
		/*cout << "i="<<i<<", dsums="<<dsums[i]<<"\n";
		for (long long x: d[i]) {
			cout << "term: "<<x<<"\n";
		}*/
	}
	tval = tval/2;
	cout << tval;
}

int main() {
	long long N,K; cin >> N >> K;
	vector<long long> a;
	for (long long i=0;i<N;i++) {
		long long x; cin >> x;
		if (x != 0) {
			a.push_back(x);
		}
	}
	K = min(K,(long long) (a.size()-1));
	solve(a.size(),K,a);
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29