oj.uz

Submission #466938

# Submission time Handle Problem Language Result Execution time Memory
466938 2021-08-21T03:46:05 Z AMO5 Discharging (NOI20_discharging) C++17
9 / 100
 1000 ms 33472 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define ld long double
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define dbg if(0)
#define BUG(x) dbg cerr << (#x) << " is " << (x) << endl

const int mxn = (int)1e6+5;
const int64_t inf = 5e18;

void solve(){
	int n; cin>>n;
	vector<int64_t>a(n); 
	for(auto &x:a)
	{
		cin>>x;
	}
	//dp
	//when n is small
	vector<array<int64_t,2>>dp(n);
	for(int i=0; i<n; i++){
		int64_t now = a[i], res = 0, tmp = 0;
		for(int len=1,j=i; j>=0; j--,len++){
			now = max(now,a[j]);
			int64_t prev_sum = (j>0?dp[j-1][1]:(int64_t)0);
			int64_t sum = (j>0?dp[j-1][0]:(int64_t)0);
			int64_t curr = len*(now+sum)+prev_sum;
			dbg cerr<<i<<" "<<j<<" "<<sum<<" "<<now<<" "<<len<<" "<<prev_sum<<" "<<curr<<"\n";
			if(j==i)res = curr, tmp = sum+now;
			else if(curr<res){
				res = curr;
				tmp = sum+now;
			}else if(curr==res){
				tmp = min(tmp, sum+now);
			}
		}
		dp[i][0]=tmp;
		dp[i][1]=res;
		dbg cerr<<dp[i][0]<<" "<<dp[i][1]<<"\n";
	}
	cout<<dp[n-1][1]<<"\n";
}

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	// int t=1; cin>>t; while(t--)
	solve();
	return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 360 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 1087 ms 33472 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

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

Subtask #6
0 / 28.0

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