oj.uz

Submission #162190

# Submission time Handle Problem Language Result Execution time Memory
162190 2019-11-06T21:43:51 Z kostia244 Split the sequence (APIO14_sequence) C++14
0 / 100
 1763 ms 82164 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 MK = 220, MN = 1e5 + 3;
ll n, k, a[MN], pref[MN], dp[2][MN], aaa = -1;
int p[MK][MN];
ll f(int l, int r, int k) {
	ll a = pref[k] - pref[l - 1];
	ll b = pref[r] - pref[k];
	return a * b;
}
void solve(int l, int r, int optl, int optr, int v) {
	if (l > r)
		return;
	int t = v & 1;
	int mid = (l + r) / 2;
	pair<ll, ll> opt = { -1e18, -1 };
	for (int i = optl; i <= min(mid-1, optr); i++) {
		opt = max(opt, { dp[t ^ 1][i] + f(i + 1, n, mid), i });
	}
	dp[t][mid] = opt.first;
	p[v][mid] = opt.second;

	solve(l, mid - 1, optl, opt.second, v);
	solve(mid + 1, r, opt.second, optr, v);
}
void bt(int k, int n) {
	if(!n) return;
	cout << n << " ";
	bt(k-1, p[k][n]);
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i], pref[i] = pref[i - 1] + a[i];
	}
	for (int a = 1; a <= k; a++) {
		solve(1, n, 0, n, a);
	}
	int g = k;
	for (int i = 1; i <= n; i++)
		if(dp[k & 1][i] >= dp[k & 1][g])
			g=i;
	cout << dp[k&1][g] << "\n";
	bt(k, g);

}

Compilation message

sequence.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")

Subtask #1
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 Incorrect 2 ms 376 KB Integer 2 violates the range [1, 1]
4 Halted 0 ms 0 KB -

Subtask #2
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 632 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 376 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 Incorrect 2 ms 376 KB Extra information in the output file
9 Halted 0 ms 0 KB -

Subtask #3
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 4 ms 1528 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 1144 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 4 ms 1400 KB Integer 200 violates the range [1, 199]
7 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 504 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 9 ms 2168 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 504 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 14 ms 2296 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 11 ms 1912 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 10 ms 2168 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Incorrect 8 ms 2168 KB Extra information in the output file
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 888 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 888 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 78 ms 9464 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 5 ms 888 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 105 ms 6008 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 94 ms 6776 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 80 ms 7296 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Incorrect 59 ms 6008 KB Extra information in the output file
9 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 4600 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 34 ms 4696 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 862 ms 81956 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 30 ms 5240 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1763 ms 82164 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 1092 ms 58644 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 896 ms 62704 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Incorrect 645 ms 51752 KB Extra information in the output file
9 Halted 0 ms 0 KB -