Submission #320751

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
320751	2020-11-09T18:20:58 Z	saarang123	Discharging (NOI20_discharging)	C++14	36 / 100	123 ms	17508 KB

Discharging

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int inf = 1e15;
const int N = 1502;
int dp[N];
signed main() {
    std::ios::sync_with_stdio(0);
    std::cout.tie(0);
    std::cin.tie(0);
    int n; cin >> n;
    vector<int> a(n + 1);
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = n; i; i--) {
        dp[i] = inf;
        int mx = 0;
        for(int j = i; j <= n; j++) {
            mx = max(mx, a[j]);
            dp[i] = min(dp[i], dp[j + 1] + (n - i + 1) * mx);
            //if u choose it, it gets added to all (n - i + 1) customers after
            //eliminating the need for end_time :D
        }
    }
    cout << dp[1] << '\n';
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
13.0 / 13.0

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

Subtask #3
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	492 KB	Output is correct
2	Correct	2 ms	364 KB	Output is correct
3	Correct	2 ms	364 KB	Output is correct
4	Correct	2 ms	364 KB	Output is correct
5	Correct	3 ms	364 KB	Output is correct
6	Correct	2 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	3 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	3 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	3 ms	364 KB	Output is correct
14	Correct	3 ms	364 KB	Output is correct
15	Correct	2 ms	364 KB	Output is correct
16	Runtime error	95 ms	16944 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
17	Halted	0 ms	0 KB	-

Subtask #4
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	123 ms	17508 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #5
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	0 ms	364 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	3 ms	492 KB	Output is correct
16	Correct	2 ms	364 KB	Output is correct
17	Correct	2 ms	364 KB	Output is correct
18	Correct	2 ms	364 KB	Output is correct
19	Correct	3 ms	364 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	2 ms	364 KB	Output is correct
23	Correct	3 ms	364 KB	Output is correct
24	Correct	2 ms	364 KB	Output is correct
25	Correct	3 ms	364 KB	Output is correct
26	Correct	2 ms	364 KB	Output is correct
27	Correct	3 ms	364 KB	Output is correct
28	Correct	3 ms	364 KB	Output is correct
29	Correct	2 ms	364 KB	Output is correct
30	Correct	2 ms	364 KB	Output is correct
31	Correct	3 ms	364 KB	Output is correct
32	Correct	3 ms	364 KB	Output is correct
33	Correct	3 ms	364 KB	Output is correct
34	Correct	3 ms	364 KB	Output is correct
35	Correct	4 ms	364 KB	Output is correct
36	Correct	2 ms	364 KB	Output is correct
37	Correct	3 ms	364 KB	Output is correct
38	Correct	3 ms	364 KB	Output is correct
39	Correct	3 ms	364 KB	Output is correct
40	Correct	3 ms	364 KB	Output is correct
41	Correct	3 ms	364 KB	Output is correct
42	Correct	3 ms	364 KB	Output is correct
43	Correct	3 ms	364 KB	Output is correct
44	Correct	3 ms	492 KB	Output is correct
45	Correct	3 ms	364 KB	Output is correct
46	Correct	3 ms	364 KB	Output is correct
47	Correct	4 ms	364 KB	Output is correct
48	Correct	3 ms	364 KB	Output is correct
49	Correct	2 ms	364 KB	Output is correct
50	Correct	2 ms	364 KB	Output is correct

Subtask #6
0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	0 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	0 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	0 ms	364 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	3 ms	492 KB	Output is correct
16	Correct	2 ms	364 KB	Output is correct
17	Correct	2 ms	364 KB	Output is correct
18	Correct	2 ms	364 KB	Output is correct
19	Correct	3 ms	364 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	2 ms	364 KB	Output is correct
23	Correct	3 ms	364 KB	Output is correct
24	Correct	2 ms	364 KB	Output is correct
25	Correct	3 ms	364 KB	Output is correct
26	Correct	2 ms	364 KB	Output is correct
27	Correct	3 ms	364 KB	Output is correct
28	Correct	3 ms	364 KB	Output is correct
29	Correct	2 ms	364 KB	Output is correct
30	Runtime error	95 ms	16944 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
31	Halted	0 ms	0 KB	-

Submission #320751

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 13.0 / 13.0

Subtask #3 0 / 25.0

Subtask #4 0 / 11.0

Subtask #5 14.0 / 14.0

Subtask #6 0 / 28.0

Subtask #1
9.0 / 9.0

Subtask #2
13.0 / 13.0

Subtask #3
0 / 25.0

Subtask #4
0 / 11.0

Subtask #5
14.0 / 14.0

Subtask #6
0 / 28.0