답안 #367356

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
367356	2021-02-16T23:37:05 Z	534351	Discharging (NOI20_discharging)	C++17	36 / 100	1000 ms	18312 KB

Discharging

#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)

const int MAXN = 1e6 + 13;
const long long LLINF = 3e18;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N;
ll arr[MAXN];
ll dp[MAXN];

int32_t main()
{
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(4);
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> N;
    FOR(i, 0, N)
    {
        cin >> arr[i];
    }
    FOR(i, 1, N)
    {
        ckmax(arr[i], arr[i - 1]);
    }
    dp[N] = 0;
    FORD(i, N, 0)
    {
        dp[i] = LLINF;
        FOR(j, i + 1, N + 1)
        {
            ckmin(dp[i], dp[j] + arr[j - 1] * (N - i));
        }
    }
    cout << dp[0] << '\n';
    return 0;
}

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 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	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	364 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	384 KB	Output is correct
6	Correct	3 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	4 ms	364 KB	Output is correct
9	Correct	4 ms	364 KB	Output is correct
10	Correct	4 ms	364 KB	Output is correct
11	Correct	4 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	492 KB	Output is correct

Subtask #3
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	364 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	384 KB	Output is correct
6	Correct	3 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	4 ms	364 KB	Output is correct
9	Correct	4 ms	364 KB	Output is correct
10	Correct	4 ms	364 KB	Output is correct
11	Correct	4 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	492 KB	Output is correct
16	Execution timed out	1089 ms	13676 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #4
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1095 ms	18312 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 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	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	5 ms	364 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	384 KB	Output is correct
20	Correct	3 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	4 ms	364 KB	Output is correct
23	Correct	4 ms	364 KB	Output is correct
24	Correct	4 ms	364 KB	Output is correct
25	Correct	4 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	492 KB	Output is correct
30	Correct	2 ms	364 KB	Output is correct
31	Correct	3 ms	364 KB	Output is correct
32	Correct	2 ms	364 KB	Output is correct
33	Correct	3 ms	364 KB	Output is correct
34	Correct	2 ms	364 KB	Output is correct
35	Correct	3 ms	492 KB	Output is correct
36	Correct	2 ms	364 KB	Output is correct
37	Correct	2 ms	364 KB	Output is correct
38	Correct	2 ms	364 KB	Output is correct
39	Correct	2 ms	364 KB	Output is correct
40	Correct	2 ms	364 KB	Output is correct
41	Correct	2 ms	364 KB	Output is correct
42	Correct	2 ms	364 KB	Output is correct
43	Correct	3 ms	364 KB	Output is correct
44	Correct	2 ms	364 KB	Output is correct
45	Correct	2 ms	364 KB	Output is correct
46	Correct	2 ms	364 KB	Output is correct
47	Correct	2 ms	364 KB	Output is correct
48	Correct	2 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 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	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	5 ms	364 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	384 KB	Output is correct
20	Correct	3 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	4 ms	364 KB	Output is correct
23	Correct	4 ms	364 KB	Output is correct
24	Correct	4 ms	364 KB	Output is correct
25	Correct	4 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	492 KB	Output is correct
30	Execution timed out	1089 ms	13676 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-

답안 #367356

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