oj.uz

Submission #1032712

# Submission time Handle Problem Language Result Execution time Memory
1032712 2024-07-24T06:40:59 Z vannnnnnnn Split the sequence (APIO14_sequence) C++14
39 / 100
 2000 ms 31836 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
ll n, k, pre[10005], a[10005];
pair<ll, ll>dp[205][10005];
int main()
{
	ll n, k;
	scanf("%lld %lld", &n, &k);
	for(int i=1; i<=n; i++)
	{
		scanf("%lld", &a[i]);
		pre[i]=pre[i-1]+a[i];
	}
	for(int i=0; i<=k; i++)for(int j=0; j<=n; j++)dp[i][j].fi=-1e9;
	dp[0][0].fi=0;
	for(int i=1; i<=k; i++)
	{
		for(int l=0; l<n-1; l++)
		{
			for(int r=l+1; r<n; r++)
			{
				if(dp[i][r].fi<dp[i-1][l].fi+(pre[r]-pre[l])*(pre[n]-pre[r]) && dp[i-1][l].fi!=-1e9)
				{
					dp[i][r].fi=dp[i-1][l].fi+(pre[r]-pre[l])*(pre[n]-pre[r]);
					dp[i][r].se=l;
//					printf("%lld %lld %d %d %d\n", dp[i][r].fi, dp[i][r].se, i, r, l);
				}
			}
		}
	}
	ll ans=0, idx;
	for(int i=1; i<=n; i++)
	{
		if(ans<dp[k][i].fi)
		{
			ans=dp[k][i].fi;
			idx=i;
		}
	}
	printf("%lld\n", ans);
	vector<ll>res;
	while(idx!=0)
	{
		res.push_back(idx);
		idx=dp[k][idx].se;
		k--;
	}
	reverse(res.begin(), res.end());
	for(auto x:res)printf("%lld ", x);
	printf("\n");
}
/*
7 3
4 1 3 4 0 2 3
*/

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]
   11 |  scanf("%lld %lld", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~
sequence.cpp:14:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |   scanf("%lld", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 2396 KB contestant found the optimal answer: 999 == 999
3 Runtime error 1 ms 348 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2396 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 12 ms 31260 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2556 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 6 ms 22876 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 8 ms 29016 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 9 ms 31068 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 8540 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 6492 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 3 ms 10588 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 2396 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 137 ms 31068 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 2396 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 131 ms 27740 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 117 ms 26968 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 138 ms 29532 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 130 ms 29532 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 29 ms 6492 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 59 ms 14684 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 2652 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 144 ms 2652 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2048 ms 31836 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -