oj.uz

Submission #45547

# Submission time Handle Problem Language Result Execution time Memory
45547 2018-04-15T10:11:08 Z gnoor Split the sequence (APIO14_sequence) C++17
100 / 100
 614 ms 83932 KB 
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

long long tbl[100100];

struct line {
	long long m,c;
	int id;
	long long eval(long long x) {
		return m*x+c;
	}
};

bool bad(const line &a, const line &b, const line &c) {
	//return a-c is left to a-b
	return (b.c-a.c)*(a.m-c.m)>=(c.c-a.c)*(a.m-b.m);
}

long long dp[2][100100];
int par[210][100100];

int main () {
	int n,k;
	scanf("%d%d",&n,&k);
	for (int i=1;i<=n;i++) {
		scanf("%lld",&tbl[i]);
		tbl[i]+=tbl[i-1];
	}
	vector<line> stk;
	int cur,mn;
	line tmp;
	for (int j=1;j<=k;j++) {
		stk.clear();
		cur=j;
		mn=0;
		for (int i=j+1;i<=n;i++) {
			while (cur<i) {
				tmp.m=tbl[cur];
				tmp.c=dp[(j-1)%2][cur]-tbl[cur]*tbl[cur];
				tmp.id=cur;
				while (stk.size()>=2&&bad(stk[stk.size()-2],stk.back(),tmp)) stk.pop_back();
				stk.push_back(tmp);
				cur++;
			}	
			mn=min(mn,(int)stk.size()-1);
			while (mn+1<(int)stk.size()&&stk[mn+1].eval(tbl[i])>stk[mn].eval(tbl[i])) mn++;
			dp[j%2][i]=stk[mn].eval(tbl[i]);
			par[j][i]=stk[mn].id;
		}
	}						
	printf("%lld\n",dp[k%2][n]);
	int nn=n;
	for (int i=k;i>0;i--) {
		printf("%d ",par[i][nn]);
		nn=par[i][nn];	
	}
	printf("\n");
	return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
  ~~~~~^~~~~~~~~~~~~~
sequence.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&tbl[i]);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 356 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 432 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 468 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 672 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 672 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 672 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 672 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 672 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 672 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 672 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 672 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 672 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 672 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 672 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 672 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 672 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 672 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 672 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 764 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 764 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 764 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 764 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 764 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 764 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 764 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 764 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2300 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 2300 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 50 ms 9848 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 5 ms 9848 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 41 ms 9848 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 60 ms 9848 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 44 ms 9848 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 39 ms 9848 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 47 ms 9848 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 58 ms 9848 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 9848 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 24 ms 9848 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 453 ms 83932 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 30 ms 83932 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 614 ms 83932 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 443 ms 83932 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 477 ms 83932 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 313 ms 83932 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 344 ms 83932 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 493 ms 83932 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845