oj.uz

Submission #961251

# Submission time Handle Problem Language Result Execution time Memory
961251 2024-04-11T18:48:09 Z Nurislam Split the sequence (APIO14_sequence) C++14
0 / 100
 2000 ms 131072 KB 
///*                                                    __                    __                        __                    */
///*        ======     _      /| /|  __   _            /   |  |   /|  |   *  |    |  |  | /   /| |\  | /   |  |  * | /        */
///* \-       ||  |_| |_     / |/ | |  | |_  |-        |   |--|  /-|  |   |  \ \  |==|  |-   /=| | \ | |   |--|  | |-         */
///*          ||  | | |_    /     | |__|  _| |_        \__ |  | /  |  |__ |  __|  |  |  | \ /  | |  \| \__ |  |  | | \        */
///* 
// autor :: Rick Prime
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
//#define int long long
typedef vector<int> vi;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef vector<pii> vii;
const int N = 2e5+50, mod = 1e9+7;

void solve(){
	short n, k;
	cin >> n >> k;
	int dp[n][k+1];
	memset(dp, 0, sizeof(dp));
	dp[0][0] = 1;
	short a[n];
	for(short &i:a)cin >> i; 	
	int sf[n+1]{};
	for(int i = n-1; i >= 0; i--){
		sf[i] = a[i]+sf[i+1];
	}
	int pr[n][k];
	int ans = 0, ps = 0;
	for(int i = 0; i < n; i++){
		int sm = 0;
		for(int j = i-1; j >= 0; j--){
			sm = sf[j]-sf[i];
			for(int x = 0; x < k; x++){
				if(!dp[j][x])continue;
				//dp[j][x] + sm*sf[i]
				//dp[i][x+1]
				if(dp[i][x+1] < dp[j][x] + sm*sf[i]){
					pr[i][x+1] = j;
					dp[i][x+1] = dp[j][x] + sm*sf[i];
				}
			}
		}
		if(dp[i][k] >= ans){
			ps = i;
			ans = dp[i][k];
		}
	}
	cout << ans-1 << '\n';
	//for(int i = 0; i <= k; i++){
		//for(int j = 0; j < n; j++){
			//cout << dp[j][i] << ' ';
		//}cout << '\n';
	//}
	vector<short> v;
	while(k){
		v.pb(ps);
		ps = pr[ps][k--];
	}reverse(all(v));
	for(auto i:v)cout << i << ' ';
	cout << '\n';
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 344 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 600 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 452 KB contestant found the optimal answer: 1542524 == 1542524
5 Runtime error 1 ms 348 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 348 KB contestant found the optimal answer: 302460000 == 302460000
3 Runtime error 1 ms 604 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 344 KB contestant found the optimal answer: 311760000 == 311760000
3 Runtime error 6 ms 1116 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 348 KB contestant found the optimal answer: 140412195 == 140412195
3 Incorrect 90 ms 2000 KB declared answer doesn't correspond to the split scheme: declared = 2147461935, real = 40881646185263
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 600 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 254 ms 600 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2063 ms 15964 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

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