oj.uz

Submission #964193

# Submission time Handle Problem Language Result Execution time Memory
964193 2024-04-16T12:01:36 Z Syrius Split the sequence (APIO14_sequence) C++14
28 / 100
 2000 ms 69120 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ll long long
#define ff first
#define ss second
#define pint pair < int , int >
#define fast ios_base::sync_with_stdio(NULL); cin.tie(NULL)

const int inf = 1e18 + 9;
const int mxn = 1e5 + 2;
const int mod = 1e9 + 7;

int dp[mxn][201] , a[mxn];
int pre[mxn];
int id[mxn][201];

int sq(int x) {
	return x * x;
}

signed main() {

	int n , k;
	cin >> n >> k;

	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		pre[i] = pre[i-1] + a[i];
	}

	for (int i = 0; i <= k; i++) dp[0][i] = 0;

	for (int i = 1; i <= n; i++) {
		dp[i][1] = sq(pre[i]);
		for (int j = 2; j <= k+1; j++) {
			dp[i][j] = inf;
			for (int q = 0; q < i; q++) {
				if (dp[i][j] > dp[q][j-1] + sq(pre[i] - pre[q])) {
					dp[i][j] = dp[q][j-1] + sq(pre[i] - pre[q]);
					id[i][j] = q;
				}
			}
		}
	}

	cout << (sq(pre[n]) - dp[n][k+1]) / 2 << '\n';
	int x = id[n][k+1];
	k++;
	while (k > 0) {
		if (x == 0) break;
		cout << x << ' ';
		k--;
		x = id[x][k];
	}
	return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 4444 KB contestant found the optimal answer: 999 == 999
3 Incorrect 1 ms 4444 KB Unexpected end of file - int32 expected
4 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 6588 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 6 ms 6744 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 6748 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 5 ms 6584 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 5 ms 6748 KB Unexpected end of file - int32 expected
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8792 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 8796 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 111 ms 8812 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 8792 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 121 ms 8784 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 98 ms 8800 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 119 ms 8816 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 110 ms 8796 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 28 ms 8792 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 54 ms 8788 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 37496 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 299 ms 37512 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2079 ms 19296 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2056 ms 69120 KB Time limit exceeded
2 Halted 0 ms 0 KB -