oj.uz

Submission #197821

# Submission time Handle Problem Language Result Execution time Memory
197821 2020-01-23T13:30:08 Z dennisstar Split the sequence (APIO14_sequence) C++17
100 / 100
 640 ms 84540 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define ryan bear
#define sq(X) ((X)*(X))
#define eb emplace_back
#define all(V) (V).begin(), (V).end()
#define unq(V) (V).erase(unique(all(V)), (V).end())
using namespace std;
typedef long long ll;
typedef vector<ll> vlm;
typedef vector<int> vim;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll INF = (1ll<<60);

int N, K; vlm ar; ll mx; int mi; int lst[205][100010];

struct line {
	ll a, b; int ind;
	ll get(ll x) { return a*x+b; }
	line() {}
	line(ll A, ll B, int i) { a=A, b=B, ind=i; }
};

struct CHT {
	line L[100010]; int s, e;
	void init() { s=e=0; }
	void upd(line &v) {
		while (s+1<e && (L[e-1].b<v.b || (L[e-2].b-v.b)*(L[e-1].a-L[e-2].a)<=(L[e-2].b-L[e-1].b)*(v.a-L[e-2].a))) e--;
		L[e++]=v;
	}
	pll get(ll x) {
		while (s+1<e && L[s].get(x)<L[s+1].get(x)) s++;
		return pll(L[s].get(x), L[s].ind);
	}
}cht[2];

void dfs(int k, int i) {
	if (!k) return ;
	dfs(k-1, lst[k][i]);
	printf("%d ", i);
}

int main() {
	scanf("%d %d", &N, &K); ar.resize(N+1);
	for (int i=1; i<=N; i++) { scanf("%lld", &ar[i]); ar[i]+=ar[i-1]; }
	line im=line(ar[N], 0, 0);
	cht[0].init(); cht[0].upd(im);
	for (int i=1; i<K; i++) {
		cht[i&1].init();
		for (int j=i; j<N; j++) {
			auto k=cht[(i-1)&1].get(ar[j]); k.fi-=ar[j]*ar[j];
			lst[i][j]=min((int)k.se, j-1);
			im=line(ar[N]+ar[j], k.fi-ar[N]*ar[j], j);
			cht[i&1].upd(im);
		}
	}
	for (int i=K; i<N; i++) {
		auto k=cht[(K-1)&1].get(ar[i]);
		lst[K][i]=min((int)k.se, i-1);
		if (mx<=k.fi-ar[i]*ar[i]) mx=k.fi-ar[i]*ar[i], mi=i;
	}
	printf("%lld\n", mx);
	dfs(K, mi); puts("");
	return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &K); ar.resize(N+1);
  ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:49:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i=1; i<=N; i++) { scanf("%lld", &ar[i]); ar[i]+=ar[i-1]; }
                             ~~~~~^~~~~~~~~~~~~~~~

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 3 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 360 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 3 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 0 ms 376 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 380 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 632 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 8 ms 380 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 5 ms 380 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 376 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 3 ms 376 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 420 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 376 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 1400 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 3 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 3 ms 1016 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 4 ms 1272 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 1272 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 504 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 504 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 376 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 376 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 9 ms 2168 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 376 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 10 ms 2168 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 ms 1912 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 10 ms 2168 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 7 ms 2168 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 760 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 1016 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 888 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 892 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 49 ms 9848 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 1016 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 41 ms 6108 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 42 ms 6932 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 46 ms 7544 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 32 ms 6208 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 37 ms 6904 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 43 ms 8696 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 6152 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 21 ms 6136 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 379 ms 84540 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 26 ms 7544 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 640 ms 83476 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 406 ms 59548 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 449 ms 65016 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 308 ms 53900 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 324 ms 60536 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 410 ms 76284 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845