oj.uz

Submission #989910

# Submission time Handle Problem Language Result Execution time Memory
989910 2024-05-29T03:36:35 Z awf Split the sequence (APIO14_sequence) C++14
49 / 100
 62 ms 131072 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 15;
#define int long long

int a[N];
int b[N];
int n, k;
int dp[N][215];
int pre[N];
int nm; 
int w[N];
int x[N];
int tv[N][215];
int id = 0;

int cost(int l, int r){
	return (pre[r] - pre[l-1]) * (pre[n] - pre[r]);
}

void cal(int k, int l, int r, int opl, int opr) {
    if (l > r) return;
    int mid = (l + r) / 2;
    int opm = -1;
    dp[mid][k] = 0;
    for (int i = opr; i >= opl; i--) {
        int val = dp[i][k-1] + cost(i+1,mid);
        if (val > dp[mid][k]) {
            dp[mid][k] = val;
            opm = i;
        }
    }
    tv[mid][id] = opm;
    // cout << mid << " " << id << " " << opm << endl;
    cal(k, l, mid - 1, opl, opm);
    cal(k, mid + 1, r, opm, opr);
}
signed main() {
    ios_base::sync_with_stdio();
    cin.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    
    for (int i = 1; i <= n; i++) {
        pre[i] = pre[i-1] + a[i];
    }
	
    for (int i = 1; i <= n; i++) dp[i][1] = cost(1,i);

    for (int i = 2; i <= k; i++) {
    	id++;
        cal(i, 1, n, 1, n);
        // for (int j = 1; j <= n; j++) {
            // dp[j][0] = dp[j][1];
            // dp[j][1] = 0;
        // }
    }
    // for(int i=2; i<=k; i++){
    	// for(int j=1; j<=n; j++){
    		// cout << dp[j][i] << endl;
    	// }
    	// cout << endl;
    // }
	int mx = 0;
	int last = 0;
	for(int i=1; i<=n; i++){
		if(mx < dp[i][k]){
			last = i;
			mx = dp[i][k];
		}
	}
	cout << mx << endl;
	for(int i=k-1; i>=0; i--){
		cout << last << " ";
		// cout << last << " " << i << " " << tv[last][i] << endl;
		last = tv[last][i]; 
	}
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 2396 KB contestant found the optimal answer: 999 == 999
3 Incorrect 0 ms 2396 KB Integer 0 violates the range [1, 1]
4 Halted 0 ms 0 KB -

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 0 ms 2396 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 2396 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 2396 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 2396 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 2396 KB contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 2396 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 2396 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 2396 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 2396 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 4700 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 4700 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 4552 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 4700 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 1 ms 4700 KB position 199 occurs twice in split scheme
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 4700 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 4 ms 4700 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 4700 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 6 ms 4700 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 5 ms 4700 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 5 ms 4700 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 4 ms 4696 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 2 ms 4700 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 3 ms 4696 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 37724 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 5 ms 37724 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 60 ms 37532 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 37652 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 58 ms 37728 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 56 ms 37720 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 60 ms 37724 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 39 ms 37724 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 51 ms 37724 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 62 ms 37720 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -