oj.uz

Submission #94855

# Submission time Handle Problem Language Result Execution time Memory
94855 2019-01-24T15:16:58 Z Origims Split the sequence (APIO14_sequence) C++14
71 / 100
 128 ms 132096 KB 
// In The Name Of God
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#define sqr(A) ((A) * (A))
#define X first
#define Y second
#define MP make_pair
#define bsz  __builtin_popcount
#define all(A) A.begin(), A.end()
using namespace std;
using namespace __gnu_pbds;
template < typename T >
using ordered_set = tree < T , null_type , less < T > , rb_tree_tag , tree_order_statistics_node_update >;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef complex<ll> point;
const int MOD = 1e9 + 7;
const int MOD2 = 1e9 + 9;
const int PR = 727;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;

struct convexHull {
	vector<point> lines;
	vector<int>   idx;
	int pos = 0;

	ll F(point p, ll x) {
		return p.real() * x + p.imag();
	}

	ld I(point p1, point p2) {
		return (ld)(p2.imag() - p1.imag()) / (ld)(p1.real() - p2.real());
	}

	void add(point p, int id) {
		if (lines.size() && p.real() == lines.back().real()) return ;
		while (lines.size()) {
			point a = lines[lines.size() - 1];
			point b = lines[lines.size() - 2];
			if (I(p, b) <= I(b, a)) {
				lines.pop_back();
				idx.pop_back();
			}
			else
				break;
		}
		lines.push_back(p);
		idx.push_back(id);
	}

	pii get(ll x) {
		while (pos + 1 < lines.size() && I(lines[pos], lines[pos + 1]) <= (ld)x) pos++;
		return MP(F(lines[pos], x), idx[pos]);
	}

	void clear() {
		lines.clear();
		idx.clear();
		pos = 0;
	}
};

const int N = 1e5 + 20;
const int K = 2e2 + 20;
ll a[N], dp[N], p[N], par[N][K], n, k;
vector<int> ans;
convexHull CHT;

int main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> n >> k; k++;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	for (int i = 1; i <= n; i++) {
		p[i] = a[i] + p[i - 1];
		dp[i] = sqr(p[i]);
	}
	for (int i = 2; i <= k; i++) {
		CHT.add({p[i - 1] * -2, dp[i - 1] + sqr(p[i - 1])}, i - 1);
		for (int j = i; j <= n; j++) {
			pii tmp = CHT.get(p[j]);
			ll D = dp[j];
			dp[j] = tmp.X + sqr(p[j]);
			par[j][i] = tmp.Y;
			CHT.add({p[j] * -2, D + sqr(p[j])}, j);
		}
		CHT.clear();
	}
	int v = par[n][k];
	for (int i = k - 1; i; i--) {
		ans.push_back(v);
		v = par[v][i];
	}
//	cout << sqr(p[n]) << ' ' << dp[n] << endl;
	cout << (sqr(p[n]) - dp[n]) / 2 << endl;
	for (int i = ans.size() - 1; i >= 0; i--)
		cout << ans[i] << ' ';
	cout << endl;
}

Compilation message

sequence.cpp: In member function 'pii convexHull::get(ll)':
sequence.cpp:56:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (pos + 1 < lines.size() && I(lines[pos], lines[pos + 1]) <= (ld)x) pos++;
          ~~~~~~~~^~~~~~~~~~~~~~

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 380 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 376 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 380 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 440 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 380 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 504 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 504 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 376 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 408 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 376 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 632 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 632 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 760 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 760 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 3 ms 760 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 760 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 760 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 632 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 632 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2168 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 2168 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 8 ms 2168 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 2168 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 8 ms 2168 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 8 ms 2168 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 9 ms 2168 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 9 ms 2168 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 4 ms 2168 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 5 ms 2168 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 18040 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 16 ms 18040 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 128 ms 18224 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 17 ms 18116 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 78 ms 18040 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 91 ms 18040 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 99 ms 18232 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 85 ms 18232 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 108 ms 18208 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 113 ms 18244 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 97 ms 132096 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -