oj.uz

Submission #964271

# Submission time Handle Problem Language Result Execution time Memory
964271 2024-04-16T14:03:43 Z dubabuba Split the sequence (APIO14_sequence) C++14
50 / 100
 120 ms 7260 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long i64;
typedef pair<int, int> pii;
#define ff first
#define ss second
#define MP make_pair

const int mxk = 220;
const int mxn = 1010;
const i64 inf = 1e18;
int a[mxn], p[mxn], n, k;
i64 dp[mxn][mxk], ls[mxn][mxk];

i64 kv(i64 a) { return a * a; }

void solve() {
	cin >> n >> k;
	for(int i = 0; i <= n; i++)
	for(int j = 0; j <= k; j++)
		dp[i][j] = inf;

	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		p[i] = p[i - 1] + a[i];
		dp[i][0] = kv(p[i]);
	}

	for(int i = 2; i <= n; i++)
	for(int j = 1; j <= k; j++) {
		for(int q = 1; q < i; q++)
		if(dp[i][j] > dp[q][j - 1] + kv(p[i] - p[q])) {
			dp[i][j] = dp[q][j - 1] + kv(p[i] - p[q]);
			ls[i][j] = q;
		}
	}

	cout << (kv(p[n]) - dp[n][k]) / 2 << endl;

	int last = ls[n][k];
	for(int i = k - 1; i >= 0; i--) {
		cout << last << ' ';
		last = ls[last][i];
	}
}

signed main() {
	#ifdef LOCAL
		auto start = chrono::high_resolution_clock::now();
	#endif

	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	signed t = 1; // cin >> t;
	while(t--) solve();
	
	#ifdef LOCAL
		auto end = chrono::high_resolution_clock::now();
		cout << "\n"; for(int i = 0; i <= 20; ++i) cout << '-';
		cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
	#endif
	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 2396 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 2396 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 2396 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 1 ms 2396 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 2396 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 2396 KB contestant found the optimal answer: 1 == 1
8 Correct 1 ms 2400 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 2396 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 2396 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 2396 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 2396 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 2396 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 2396 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 2392 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 2400 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 2396 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 2396 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 2552 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 2392 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 2760 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 2512 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 2396 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 2396 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 2396 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 2396 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2652 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 6 ms 2508 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2652 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 6 ms 2576 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 7 ms 2652 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 5 ms 2652 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 2508 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 2652 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 2652 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3676 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 5 ms 3676 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 119 ms 3932 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 3672 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 120 ms 3908 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 100 ms 3676 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 118 ms 3928 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 118 ms 3676 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 25 ms 3932 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 49 ms 3936 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 7256 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 7260 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -