oj.uz

답안 #445751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
445751 2021-07-19T13:19:54 Z hibye1217 수열 (APIO14_sequence) C++17
33 / 100
 65 ms 131076 KB 
#include <bits/stdc++.h>
#define endl '\n'
#define fr first
#define sc second
#define all(v) v.begin(),v.end()
#define unq(v) sort( all(v) ); v.erase( unique( all(v) ), v.end() )
#define bout(x) cout << bitset<sizeof(x)*8>(x) << endl
#define mkp(a,b) make_pair(a,b)
#define gcd(a,b) __gcd(a,b)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pi2 = pair<int, int>;
using pl2 = pair<ll, ll>;
using cpl = complex<ld>;
const ld pi = 3.14159265358979323846264338327950288;
const ld tau = 2 * pi;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, ddy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int nx[8] = {1, 2, 2, 1, -1, -2, -2, -1}, ny[8] = {-2, -1, 1, 2, 2, 1, -1, -2};

// #define DEBUG

ll arr[100020];
ll sum[100020];
pl2 dp[100020][220];
int ptr[220];

inline ll qry(int st, int ed){ return sum[ed] - sum[st-1]; }

void Main(){
	int n, k; cin >> n >> k;
	for (int i = 1; i <= n; i++){
		cin >> arr[i];
		sum[i] = sum[i-1] + arr[i];
	}
	for (int j = 1; j <= k; j++){
		ptr[j] = j;
	}
	for (int j = 1; j <= k; j++){
		for (int i = j+1; i <= n; i++){
			while (ptr[j]+2 <= i){
				int p = ptr[j];
				ll v1 = dp[p][j-1].fr + qry(1, p) * qry(p+1, i);
				ll v2 = dp[p+1][j-1].fr + qry(1, p+1) * qry(p+2, i);
				if (v1 <= v2){ ptr[j] += 1; }
				else{ break; }
			}
			int p = ptr[j];
			dp[i][j] = { dp[p][j-1].fr + qry(1, p) * qry(p+1, i), p };
		}
	}
	cout << dp[n][k].fr << endl;
	int p = dp[n][k].sc;
	while (k--){
		cout << p << ' ';
		p = dp[p][k].sc;
	}
}

int main(){
#ifndef DEBUG
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
#endif
	cout.setf(ios::fixed);
	cout.precision(0);
	Main();
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3788 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 3788 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 4 ms 3788 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 3788 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 5 ms 3788 KB contestant found the optimal answer: 679388326 == 679388326
6 Incorrect 5 ms 3788 KB contestant didn't find the optimal answer: 4698976842 < 4699030287
7 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 34852 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 18 ms 34908 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 43 ms 34892 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 18 ms 34896 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 40 ms 34876 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Incorrect 40 ms 34888 KB contestant didn't find the optimal answer: 514785562499 < 514790755404
7 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 65 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -