oj.uz

답안 #541046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541046 2022-03-22T07:12:40 Z mansur 수열 (APIO14_sequence) C++17
100 / 100
 1006 ms 110320 KB 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
 
#include<bits/stdc++.h>	
 
using namespace std;
 
#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define sz(a) a.size()
//#define int long long               
#define pb push_back
#define vt vector
#define s second
#define f first
#define nl '\n'
 
using ll = long long;
using pii = pair<ll, ll>;

 
vt<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
const int inf = 1e9, N = 1e6 + 5, mod = 1e9 + 7;                    
 
double eps = 1e-6;
 
bool fl = 0;
 
ll ntr(pii a, pii b) {
	ll x = b.f - a.f;
	ll y = a.s - b.s;
	return (x + y - 1) / y;
}
 
void solve() {
	int n, k;
	cin >> n >> k;          	
	ll p[n + 1];
	int pr[n + 1][k + 1];
	bool is[n + 1][k + 1];	
	p[0] = 0;
	for (int i = 1, a; i <= n; i++) {
		cin >> a;
		p[i] = p[i - 1] + a;
	}
	ll dp[2][k + 1];
	for (int s = 1; s <= k; s++) dp[0][s] = -inf;
	dp[0][0] = 0;
	vt<pair<pii, pii>> s;
	s.pb({{0, -1}, {0, 0}});
	for (int j = 0; j <= k; j++) {
		int l = 0;
		vt<pair<pii, pii>> h;
		for (int i = j + 1; i <= n; i++) {
			while (l < sz(s) && s[l].f.s < i && s[l].f.f <= p[i]) l++;
			dp[1][j] = max(dp[0][j], s[l - 1].s.f + s[l - 1].s.s * p[i]);
			if (dp[1][j] == dp[0][j]) {
				pr[i][j] = i - 1;
				is[i][j] = 0;
			}else {
				pr[i][j] = s[l - 1].f.s;
				is[i][j] = 1;
			}
			dp[0][j] = dp[1][j];
			ll a = dp[1][j] - p[i] * p[i], b = p[i];
			ll ps = 0;
			if (sz(h) && b == h.back().s.s) {
				if (a > h.back().s.f) {
				 	h.pop_back();
				 	while (sz(h) && ntr({a, b}, h.back().s) <= h.back().f.f) h.pop_back();
				 	if (sz(h)) ps = ntr({a, b}, h.back().s);
					h.pb({{ps, i}, {a, b}});
				}
				continue;
			}
			while (sz(h) && ntr({a, b}, h.back().s) <= h.back().f.f) h.pop_back();
			if (sz(h)) ps = ntr({a, b}, h.back().s);
			h.pb({{ps, i}, {a, b}});
		}
		swap(s, h);
	}
	cout << dp[0][k] << nl;
	vt<int> ans;
	int i = n, j = k;                                                             
	while (j > 0) {
		if (!is[i][j]) {
			i = pr[i][j];
			continue;
		}
		i = pr[i][j];
		j--;
		ans.pb(i);
	}
	for (int x: ans) cout << x << ' ';
}   
 
main() {                                                         
	//freopen("input.txt", "r", stdin);                                                                                     
	//freopen("output.txt", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                       
	cin.tie(NULL);
	int tp = 1;
	if (fl) cin >> tp;
	while (tp--) solve();
}

Compilation message

sequence.cpp: In function 'void solve()':
sequence.cpp:56:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |    while (l < sz(s) && s[l].f.s < i && s[l].f.f <= p[i]) l++;
      |             ^
sequence.cpp: At global scope:
sequence.cpp:98:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   98 | main() {
      | ^~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 212 KB contestant found the optimal answer: 999 == 999
3 Correct 0 ms 212 KB contestant found the optimal answer: 0 == 0
4 Correct 0 ms 212 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 212 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 212 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 212 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 212 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 212 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 212 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 212 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 212 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 212 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 212 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 212 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 212 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 212 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 212 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 212 KB contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 212 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 212 KB contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 212 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 212 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 340 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 468 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 340 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 468 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 468 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 468 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 340 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 340 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 340 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 340 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 5 ms 1364 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 340 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 5 ms 1364 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 5 ms 1236 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 5 ms 1364 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 5 ms 1408 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 1 ms 596 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 2 ms 724 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1252 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 3 ms 1240 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 53 ms 11360 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 3 ms 1692 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 30 ms 7072 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 36 ms 7896 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 42 ms 8860 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 35 ms 7544 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 36 ms 8380 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 45 ms 10300 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 11924 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 26 ms 11908 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1006 ms 110320 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 26 ms 13908 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 962 ms 108504 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 573 ms 76856 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 687 ms 85644 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 489 ms 71752 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 643 ms 80276 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 817 ms 99736 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845