oj.uz

Submission #162160

# Submission time Handle Problem Language Result Execution time Memory
162160 2019-11-06T18:42:35 Z kostia244 Split the sequence (APIO14_sequence) C++14
50 / 100
 202 ms 3524 KB 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<bits/extc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll mod = 998244353;
using oset = tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MN = 1e3 + 3;
ll n, a[MN], pref[MN], dp[MN][MN], C[MN][MN], p[MN][MN];
ll f(ll l, ll r, ll i) {
	ll a = pref[i] - pref[l - 1];
	ll b = pref[r] - pref[i];
	return a * b;
}
void bt(int a, int b) {
	if(b>n)exit(-1);
	cout << b << " ";
	if(a>1)
		bt(a-1, p[a][b]);
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
		cin >> a[i], pref[i] = pref[i - 1] + a[i];
	ll ans = 0, g = n-1;
	for(int a = 1; a <= k; a++) {
		for(int i = 1; i < n; i++) {
			for(int j = 1; j <= i; j++) {
				ll t = dp[a-1][j-1] + f(j, n, i);
				dp[a][i] = max(dp[a][i], t);
				if(dp[a][i]==t)
					p[a][i]=j-1;
			}
			ans = max(ans, dp[a][i]);
			if(ans==dp[a][i]) g=i;
		}
	}

	cout << ans << '\n';
	bt(k, g);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 376 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 376 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 376 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 376 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 376 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 376 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 380 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 376 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 376 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 376 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 376 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 760 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 504 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 376 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 504 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 504 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 376 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 504 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 376 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 10 ms 2552 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 380 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 9 ms 1912 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 23 ms 2424 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 10 ms 2552 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 4 ms 764 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 4 ms 636 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 5 ms 1016 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 4 ms 376 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 146 ms 3524 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 4 ms 376 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 202 ms 3476 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 169 ms 3232 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 150 ms 3448 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 147 ms 3516 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 38 ms 996 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 79 ms 1648 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -1 violates the range [1, 9999]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB declared answer doesn't correspond to the split scheme: declared = 96, real = 2757000
2 Halted 0 ms 0 KB -