oj.uz

답안 #162170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
162170 2019-11-06T19:43:13 Z kostia244 수열 (APIO14_sequence) C++14
60 / 100
 2000 ms 75388 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());
using vec = complex<ll>;
using ld = long double;
using vld = complex<ld>;
ll dot(vec a, vec b) {
	return (conj(a) * b).real();
}
ll cross(vec a, vec b) {
	return (conj(a) * b).imag();
}
struct cht {
	vector<vec> hull;
	void clear() {
		hull.clear();
	}
	bool nok(ld x, ld y, ld x1, ld y1, ld x2, ld y2) {
		vld a(x1 - x, y1 - y);
		vld b(x2 - x1, y2 - y1);
		return (conj(a) * b).imag() > -(1e-3);
	}
	bool rem() {
		int n = hull.size();
		if (n < 3)
			return 0;
		return nok(hull[n - 3].real(), hull[n - 3].imag(), hull[n - 2].real(),
				hull[n - 2].imag(), hull[n - 1].real(), hull[n - 1].imag());
	}
	void add(vec x) {
		hull.pb(x);
		while (rem())
			swap(hull.back(), hull[hull.size() - 2]), hull.pop_back();
	}
	vec get(vec x) {
		ll l = 0, r = (int)hull.size() - 1, a, b;
		while (r - l > 3) {
			a = l + (r - l) / 3;
			b = r - (r - l) / 3;
			if (dot(x, hull[a]) < dot(x, hull[b]))
				l = a;
			else
				r = b;
		}
		ll ans = 0;
		vec z;
		while (l <= r) {
			ans = max(ans, dot(x, hull[l]));
			if(ans==dot(x, hull[l]))
				z=hull[l];
			l++;
		}
		return z;
	}
};

const int MK = 220, MN = 1e5 + 3;
ll n, a[MN], pref[MN], dp[MK][MN], p[MK][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-1)exit(-1);
	cout << b << " ";
	if (a > 1)
		bt(a - 1, p[a][b]);
}
#define val(j) ((dp[a - 1][(j) - 1] + f(j, n, i)))
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll k;
	map<ll, int> bc;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i], pref[i] = pref[i - 1] + a[i];
		if (a[i])
			bc[pref[i]] = i;
	}
	ll ans = -10000, g = n - 1;
	cht x;
	for (int a = 1; a <= k; a++) {
		x.clear();
		x.add(vec(0, 0));
		for (int i = 1; i < n; i++) {
			vec t = x.get(vec(1, pref[n]-pref[i]));
			dp[a][i] = dot(t, vec(1, pref[n]-pref[i])) + pref[i]*(pref[n]-pref[i]);
			p[a][i] = bc[-t.imag()];
//			cout << -t.real() << " ";
			ans = max(ans, dp[a][i]);
			if (ans == dp[a][i])
				g = i;
			x.add(vec(dp[a - 1][i], -pref[i]));
		}
	}

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 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 548 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 424 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 380 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

# 결과 실행 시간 메모리 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 10 ms 1016 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 632 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 508 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 504 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 10 ms 3192 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 7 ms 2424 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Incorrect 9 ms 2936 KB Integer 0 violates the range [1, 199]
7 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 504 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 82 ms 5736 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 504 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 51 ms 5980 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 43 ms 4984 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 52 ms 5856 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 52 ms 5752 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 12 ms 1528 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 40 ms 2596 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1784 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 11 ms 1784 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 694 ms 34996 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 13 ms 1908 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 389 ms 21468 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 412 ms 24700 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 527 ms 26524 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 414 ms 21748 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 468 ms 24716 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 603 ms 31564 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 144 ms 13104 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 141 ms 13208 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Execution timed out 2053 ms 75388 KB Time limit exceeded
4 Halted 0 ms 0 KB -