Submission #477653

# Submission time Handle Problem Language Result Execution time Memory
477653 2021-10-03T01:25:07 Z hollwo_pelw Split the sequence (APIO14_sequence) C++17
89 / 100
1581 ms 81024 KB
/*
// is short or still long ???
hollwo_pelw's template(short)
// Note : -Dhollwo_pelw_local
*/

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>

using namespace std;
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;

void FAST_IO(string filein = "", string fileout = "", string fileerr = ""){
	if (fopen(filein.c_str(), "r")){
		freopen(filein.c_str(), "r", stdin);
		freopen(fileout.c_str(), "w", stdout);
#ifdef hollwo_pelw_local
		freopen(fileerr.c_str(), "w", stderr);
#endif
	}
	cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
}

void Hollwo_Pelw();

signed main(){
#ifdef hollwo_pelw_local
	FAST_IO("input.inp", "output.out", "error.err");
	auto start = chrono::steady_clock::now();
#else
	FAST_IO("hollwo_pelw.inp", "hollwo_pelw.out");
#endif
	int testcases = 1;
	// cin >> testcases;
	for (int test = 1; test <= testcases; test++){
		// cout << "Case #" << test << ": ";
		Hollwo_Pelw();
	}
#ifdef hollwo_pelw_local
	auto end = chrono::steady_clock::now();
	cout << "\nExcution time : " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif
	return 0;
}

const int N = 1e5 + 5, K = 202;

int n, k, pre[N], tr[K][N];

int64_t dp[2][N];

inline bool chkmax(int64_t &a, int64_t b) {
	return a < b ? a = b, 1 : 0;
}

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

void solve(int lvl, int l, int r, int opl, int opr) {
	if (l > r) return ;
	int m = l + r >> 1, opm = 0;
	dp[lvl & 1][m] = -1e18;
	for (int i = opl; i <= min(m + 1, opr); i++)
		if (chkmax(dp[lvl & 1][m], dp[lvl & 1 ^ 1][i] + calc(i, m))) opm = i;
	tr[lvl][m] = opm;
	solve(lvl, l, m - 1, opl, opm);
	solve(lvl, m + 1, r, opm, opr);
}

void Hollwo_Pelw() {
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
		cin >> pre[i], pre[i] += pre[i - 1];

	for (int i = 1; i <= k; i++)
		solve(i, i, n - 1, 0, n - 1);

	// for (int i = 1; i < n; i++)
	// 	cout << dp[k & 1][i] << " ";
	int64_t res = -1e18, cur = 0;
	for (int i = 1; i < n; i++)
		if (chkmax(res, dp[k & 1][i])) cur = i;
	cout << res << '\n';
	for (; k; cur = tr[k --][cur])
		cout << cur << ' ';
}

Compilation message

sequence.cpp: In function 'void solve(int, int, int, int, int)':
sequence.cpp:65:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |  int m = l + r >> 1, opm = 0;
      |          ~~^~~
sequence.cpp:68:37: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   68 |   if (chkmax(dp[lvl & 1][m], dp[lvl & 1 ^ 1][i] + calc(i, m))) opm = i;
      |                                 ~~~~^~~
sequence.cpp: In function 'void FAST_IO(std::string, std::string, std::string)':
sequence.cpp:18:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   freopen(filein.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:19:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |   freopen(fileout.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 108 == 108
2 Correct 0 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 0 ms 332 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 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 0 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 0 ms 332 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 332 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 316 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 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 332 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 332 KB contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 332 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 332 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 332 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 332 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 332 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 332 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 332 KB contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 332 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 1356 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 332 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 972 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 2 ms 1228 KB Integer 0 violates the range [1, 199]
7 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 332 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 7 ms 1996 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 332 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 12 ms 2052 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 12 ms 1760 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 9 ms 1952 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 6 ms 1996 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 588 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 924 KB contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 3 ms 588 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 2 ms 588 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 72 ms 9148 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 2 ms 720 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 93 ms 5664 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 80 ms 6600 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 78 ms 6984 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 54 ms 5792 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 77 ms 6572 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 101 ms 8312 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 26 ms 3452 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 22 ms 3536 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 802 ms 81024 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 20 ms 3880 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1581 ms 80676 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 965 ms 57164 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 808 ms 61336 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 576 ms 50404 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 837 ms 57400 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1036 ms 73036 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845