Submission #284993

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
284993	2020-08-28T08:45:49 Z	lukameladze	Discharging (NOI20_discharging)	C++14	9 / 100	1000 ms	8516 KB

Discharging

# include <bits/stdc++.h>
using namespace std;
long long b[1000005], n,a[1000005],mn,mx,raod,x,w;
pair <long long ,long long > dp[1000005];
int main()
{
	cin>>n;
	for (int i=1; i<=n; i++)
	{
		cin>>a[i];
	}
	dp[0]={0,0};
	dp[1]={a[1],a[1]};
	for (int i=2; i<=n; i++)
	{
		dp[i].first=1e18;
		x=0;
		for (int j=i; j>=1; j--)
		{
			raod=i-j+1;
			x=max(x,a[j]);
			w=dp[j-1].second+x;
			if (dp[j-1].first+raod*w<dp[i].first)
			{
			     dp[i].first=dp[j-1].first+raod*w;
			     dp[i].second=w;
			}
			
		}
	}
	cout<<dp[n].first;
}

Subtask #1

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct

Subtask #2

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	4 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	4 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 11.0

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

Subtask #5

0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Incorrect	4 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #6

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Incorrect	4 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-