oj.uz

Submission #215893

# Submission time Handle Problem Language Result Execution time Memory
215893 2020-03-26T12:12:47 Z T0p_ Split the sequence (APIO14_sequence) C++14
39 / 100
 2000 ms 5436 KB 
#include<bits/stdc++.h>
using namespace std;

int back[202][100100];
long long arr[100100], qs[100100], dp[202][100100];
stack<int> p;

int main()
{
	int n, m;
	scanf(" %d %d",&n,&m);
	assert(m > 0);
	for(int i=1 ; i<=n ; i++)
	{
		scanf(" %lld",&arr[i]); 
		qs[i] = arr[i] + qs[i-1];
	}
	for(int i=1 ; i<=m ; i++)
	{
		for(int j=i ; j<=n ; j++)
		{
			int pos;
			for(int k=i-1 ; k<j ; k++)
			{
				long long nv = dp[i-1][k] + (qs[j] - qs[k]) * (qs[n] - qs[j]);
				if(nv > dp[i][j])
				{
					dp[i][j] = nv;
					pos = k;
				}
			}
			back[i][j] = pos;
		}
	}
	int pos;
	long long Mval = 0;
	for(int i=m ; i<=n ; i++)
	{
		if(dp[m][i] > Mval)
		{
			Mval = dp[m][i];
			pos = i;
		}
	}
	for(int i=m ; i>0 ; i--)
	{
		p.push(pos);
		pos = back[i][pos];
	}
	printf("%lld\n",Mval);
	while(!p.empty())
	{
		printf("%d ",p.top());
		p.pop();
	}
    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf(" %d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %lld",&arr[i]); 
   ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:48:20: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   pos = back[i][pos];
         ~~~~~~~~~~~^
sequence.cpp:32:15: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
    back[i][j] = pos;
    ~~~~~~~~~~~^~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB contestant found the optimal answer: 108 == 108
2 Correct 5 ms 384 KB contestant found the optimal answer: 999 == 999
3 Incorrect 4 ms 384 KB Integer 0 violates the range [1, 1]
4 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 5 ms 384 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 8 ms 2664 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 5 ms 416 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 8 ms 2048 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 8 ms 2432 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 8 ms 2560 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 6 ms 896 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 5 ms 640 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 6 ms 1024 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 6 ms 512 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 102 ms 4472 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 7 ms 384 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 131 ms 4540 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 117 ms 3960 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 101 ms 4600 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 102 ms 4472 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 37 ms 1152 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 75 ms 2040 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 1088 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 155 ms 892 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2070 ms 5436 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2089 ms 2944 KB Time limit exceeded
2 Halted 0 ms 0 KB -