oj.uz

Submission #135271

# Submission time Handle Problem Language Result Execution time Memory
135271 2019-07-23T23:58:04 Z Lawliet Split the sequence (APIO14_sequence) C++14
71 / 100
 2000 ms 86732 KB 
#include <bits/stdc++.h>
 
#define MAXK 210
#define MAXN 100010
#define INF 1000000000000000000LL
 
using namespace std;
typedef long long int lli;
typedef pair<int,int> pii; 

int n, k;
 
int v[MAXN];
int opt[MAXN][MAXK];
 
lli sv[MAXN];
lli dp[MAXN][2];
 
lli cost(int l, int c, int r)
{
	lli firstPart = sv[c - 1] - sv[l - 1];
	lli secondPart = sv[r] - sv[c - 1];
 
	return firstPart*secondPart;
}
 
void DivAndConquer(int line)
{
	queue<pii> q;

	q.push({1 , n});
	q.push({2 , n});

	while(!q.empty())
	{
		int L = q.front().first;
		int R = q.front().second;

		q.pop();

		int optmin = q.front().first;
		int optmax = q.front().second;

		q.pop();

		if(L > R) continue;

		int m = (L + R)/2;
 
		int optInd = L;
		lli optValue = -1;

		for(int g = optmin ; g <= optmax && g <= m ; g++)
		{
			lli curAns = dp[g - 1][1 - line%2] + cost(1 , g , m);

			if(curAns > optValue)
			{
				optInd = g;
				optValue = curAns;
			}
		}

		dp[m][line%2] = optValue;
		opt[m][line] = optInd;

		q.push({L , m - 1});
		q.push({optmin , optInd});

		q.push({m + 1 , R});
		q.push({optInd , optmax});
	}
}
 
int main()
{
	scanf("%d %d",&n,&k);
 
	for(int g = 1 ; g <= n ; g++)
	{
		scanf("%d",&v[g]);
 
		sv[g] = sv[g - 1] + v[g];
	}
 
	dp[0][0] = dp[0][1] = -INF;
 
	for(int l = 1 ; l <= k ; l++)
		DivAndConquer( l );
 
	printf("%lld\n",dp[n][k%2]);
 
	int cur = n;
 
	for(int g = k ; g > 0 ; g--)
	{
		printf("%d ",opt[cur][g] - 1);
 
		cur = opt[cur][g] - 1;
	} 
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:77: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:81:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&v[g]);
   ~~~~~^~~~~~~~~~~~

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 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 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 380 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 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 376 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 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 376 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 376 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 404 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 504 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 4 ms 504 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 504 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 4 ms 504 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 4 ms 504 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 4 ms 504 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 3 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 3 ms 504 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8952 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 12 ms 8956 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 231 ms 9012 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 18 ms 8952 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 163 ms 9156 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 178 ms 9116 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 172 ms 9124 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 139 ms 9012 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 171 ms 9004 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 261 ms 9160 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 86400 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 139 ms 86388 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Execution timed out 2056 ms 86732 KB Time limit exceeded
4 Halted 0 ms 0 KB -