oj.uz

답안 #231994

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
231994 2020-05-15T15:16:57 Z ruler 수열 (APIO14_sequence) C++14
100 / 100
 1296 ms 81272 KB 
// IOI 2021
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 2e9;
const ll MOD = 1e9 + 7;
 
////////////////////////////////////////////////////////////////////

const int N = 1e5 + 5, K = 2e2 + 5;

int PS[N], OPT[K][N];
ll DP[2][N];

ll C(int l, int r) { return 1LL * (PS[r] - PS[l - 1]) * (PS[r] - PS[l - 1]); }
void DQ(int l, int r, int s, int e, int k) {
	if (r < l) return;
	int md = (l + r) >> 1, &opt = OPT[k][md];
	for (int i = s; i <= min(e, md); i++)
		if (DP[k & 1][md] >= DP[(k & 1) ^ 1][i - 1] + C(i, md))
			DP[k & 1][md] = DP[(k & 1) ^ 1][i - 1] + C(i, md), opt = i;
	DQ(l, md - 1, s, opt, k), DQ(md + 1, r, opt, e, k);
}

int main() {

	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	mt19937 Rnd(time(0));

	memset(DP, 63, sizeof DP); DP[0][0] = 0;

	int n, k; cin >> n >> k; k++;
	for (int i = 1; i <= n; i++) cin >> PS[i], PS[i] += PS[i - 1];
	for (int i = 1; i <= k; i++) DQ(i, n, i, n, i);
	cout << (C(1, n) - DP[k & 1][n]) / 2 << endl;
	while (k > 1) cout << OPT[k][n] - 1 << ends, n = OPT[k][n] - 1, k--;
	cout << endl;
		
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1920 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 6 ms 1920 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 12 ms 3584 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 5 ms 1972 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 12 ms 3584 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 13 ms 3328 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 17 ms 3584 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 11 ms 3584 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 8 ms 2304 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 9 ms 2560 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 2176 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 2176 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 104 ms 10688 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 11 ms 2176 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 72 ms 7288 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 69 ms 8056 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 89 ms 8568 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 60 ms 7288 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 68 ms 8056 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 94 ms 9848 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 3832 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 32 ms 3832 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 899 ms 80956 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 32 ms 3832 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1296 ms 81272 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 774 ms 57588 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 916 ms 61444 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 638 ms 50552 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 714 ms 57588 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 904 ms 73080 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845