oj.uz

답안 #879917

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879917 2023-11-28T10:11:42 Z iskhakkutbilim 수열 (APIO14_sequence) C++17
50 / 100
 2000 ms 32860 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int mod = 1e17;
const int N = 1e5;
 
/*
 7 3
 4 1 3 4 0 2 3 
*/
signed main(){
	//ios::sync_with_stdio(0);
	//cin.tie(0); cout.tie(0);
	int n, k; cin >> n >> k;
	vector< vector<int> > dp(n + 1, vector<int>(k + 2, -mod));
	vector< vector<int> > where(n + 1, vector<int>(k + 2, -1));
	vector<int> a(n + 1, 0);
	for(int i = 1;i <= n; i++) cin >> a[i];
	vector<int> suff(n + 2, 0), pref(n + 1, 0);
	suff[n] = a[n];
	for(int i = 1;i <= n; i++) pref[i] = pref[i-1] + a[i];
	for(int i = n-1;i >= 1; i--) suff[i] = suff[i + 1] + a[i];
	
	
	
	
	dp[0][0] = 0;
	k++;
	for(int i = 1;i <= n; i++){
		for(int sub = 1; sub <= k; sub++){
			for(int j = i; j >= 1; j--){
				int pr = pref[i] - pref[j-1];
				if(dp[i][sub] < dp[j-1][sub-1] + (suff[i+1] * pr)){
					dp[i][sub] = dp[j-1][sub-1] + (suff[i + 1] * pr);
					where[i][sub] = j - 1;
				}
			}
			
		}
	}
	vector<int> path;
	cout << dp[n][k] << '\n';
	int idx = n;
	for(int j = k; j > 0 && idx > 0; j--){
		if(where[idx][j]) cout << where[idx][j] << ' ';
		idx = where[idx][j];
	}
	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 348 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 348 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 348 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 348 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 348 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 348 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 348 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 348 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 436 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 348 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 436 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 348 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 344 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 432 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 348 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 348 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 348 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 348 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 348 KB contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 348 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 348 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 348 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 348 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 348 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 5 ms 860 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 348 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 860 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 5 ms 948 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 5 ms 860 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 604 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 552 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 600 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 348 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 5 ms 604 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 133 ms 3416 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 348 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 139 ms 3676 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 106 ms 3160 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 127 ms 3684 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 133 ms 3920 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 25 ms 1208 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 51 ms 1640 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 477 ms 2084 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 614 ms 2080 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2058 ms 32860 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2051 ms 16732 KB Time limit exceeded
2 Halted 0 ms 0 KB -