답안 #1043264

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1043264	2024-08-04T07:02:58 Z	Whisper	Discharging (NOI20_discharging)	C++17	36 / 100	1000 ms	25680 KB

Discharging

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX             1000005
int nArr;

int dp[MAX], A[MAX];
void process(void){
    cin >> nArr;
    for (int i = 1; i <= nArr; ++i) cin >> A[i];

    memset(dp, 0x3f, sizeof dp);
    dp[0] = 0;
    FOR(i, 1, nArr){
        int val = 0;
        for (int j = i; j >= 1; --j){
            maximize(val, A[j]);
            minimize(dp[i], dp[j - 1] + val * (nArr - j + 1));
        }
    }
    cout << dp[nArr];
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	8284 KB	Output is correct
2	Correct	3 ms	8284 KB	Output is correct
3	Correct	3 ms	8284 KB	Output is correct
4	Correct	3 ms	8284 KB	Output is correct
5	Correct	2 ms	8284 KB	Output is correct
6	Correct	3 ms	8108 KB	Output is correct
7	Correct	3 ms	8284 KB	Output is correct
8	Correct	4 ms	8284 KB	Output is correct
9	Correct	2 ms	8304 KB	Output is correct
10	Correct	3 ms	8252 KB	Output is correct
11	Correct	3 ms	8284 KB	Output is correct
12	Correct	3 ms	8284 KB	Output is correct
13	Correct	2 ms	8284 KB	Output is correct
14	Correct	3 ms	8284 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	8284 KB	Output is correct
2	Correct	4 ms	8072 KB	Output is correct
3	Correct	4 ms	8284 KB	Output is correct
4	Correct	4 ms	8284 KB	Output is correct
5	Correct	4 ms	8284 KB	Output is correct
6	Correct	4 ms	8284 KB	Output is correct
7	Correct	4 ms	8284 KB	Output is correct
8	Correct	4 ms	8284 KB	Output is correct
9	Correct	4 ms	8536 KB	Output is correct
10	Correct	6 ms	8316 KB	Output is correct
11	Correct	4 ms	8284 KB	Output is correct
12	Correct	6 ms	8320 KB	Output is correct
13	Correct	4 ms	8284 KB	Output is correct
14	Correct	5 ms	8284 KB	Output is correct
15	Correct	4 ms	8080 KB	Output is correct

Subtask #3
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	8284 KB	Output is correct
2	Correct	4 ms	8072 KB	Output is correct
3	Correct	4 ms	8284 KB	Output is correct
4	Correct	4 ms	8284 KB	Output is correct
5	Correct	4 ms	8284 KB	Output is correct
6	Correct	4 ms	8284 KB	Output is correct
7	Correct	4 ms	8284 KB	Output is correct
8	Correct	4 ms	8284 KB	Output is correct
9	Correct	4 ms	8536 KB	Output is correct
10	Correct	6 ms	8316 KB	Output is correct
11	Correct	4 ms	8284 KB	Output is correct
12	Correct	6 ms	8320 KB	Output is correct
13	Correct	4 ms	8284 KB	Output is correct
14	Correct	5 ms	8284 KB	Output is correct
15	Correct	4 ms	8080 KB	Output is correct
16	Execution timed out	1065 ms	21072 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #4
0 / 11.0

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

Subtask #5
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	8284 KB	Output is correct
2	Correct	3 ms	8284 KB	Output is correct
3	Correct	3 ms	8284 KB	Output is correct
4	Correct	3 ms	8284 KB	Output is correct
5	Correct	2 ms	8284 KB	Output is correct
6	Correct	3 ms	8108 KB	Output is correct
7	Correct	3 ms	8284 KB	Output is correct
8	Correct	4 ms	8284 KB	Output is correct
9	Correct	2 ms	8304 KB	Output is correct
10	Correct	3 ms	8252 KB	Output is correct
11	Correct	3 ms	8284 KB	Output is correct
12	Correct	3 ms	8284 KB	Output is correct
13	Correct	2 ms	8284 KB	Output is correct
14	Correct	3 ms	8284 KB	Output is correct
15	Correct	4 ms	8284 KB	Output is correct
16	Correct	4 ms	8072 KB	Output is correct
17	Correct	4 ms	8284 KB	Output is correct
18	Correct	4 ms	8284 KB	Output is correct
19	Correct	4 ms	8284 KB	Output is correct
20	Correct	4 ms	8284 KB	Output is correct
21	Correct	4 ms	8284 KB	Output is correct
22	Correct	4 ms	8284 KB	Output is correct
23	Correct	4 ms	8536 KB	Output is correct
24	Correct	6 ms	8316 KB	Output is correct
25	Correct	4 ms	8284 KB	Output is correct
26	Correct	6 ms	8320 KB	Output is correct
27	Correct	4 ms	8284 KB	Output is correct
28	Correct	5 ms	8284 KB	Output is correct
29	Correct	4 ms	8080 KB	Output is correct
30	Correct	4 ms	8536 KB	Output is correct
31	Correct	5 ms	8284 KB	Output is correct
32	Correct	4 ms	8280 KB	Output is correct
33	Correct	4 ms	8284 KB	Output is correct
34	Correct	3 ms	8324 KB	Output is correct
35	Correct	4 ms	8180 KB	Output is correct
36	Correct	4 ms	8284 KB	Output is correct
37	Correct	3 ms	8284 KB	Output is correct
38	Correct	4 ms	8284 KB	Output is correct
39	Correct	4 ms	8284 KB	Output is correct
40	Correct	4 ms	8284 KB	Output is correct
41	Correct	4 ms	8284 KB	Output is correct
42	Correct	6 ms	8284 KB	Output is correct
43	Correct	4 ms	8284 KB	Output is correct
44	Correct	4 ms	8284 KB	Output is correct
45	Correct	4 ms	8284 KB	Output is correct
46	Correct	3 ms	8284 KB	Output is correct
47	Correct	3 ms	8284 KB	Output is correct
48	Correct	5 ms	8284 KB	Output is correct
49	Correct	3 ms	8152 KB	Output is correct
50	Correct	4 ms	8284 KB	Output is correct

Subtask #6
0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	8284 KB	Output is correct
2	Correct	3 ms	8284 KB	Output is correct
3	Correct	3 ms	8284 KB	Output is correct
4	Correct	3 ms	8284 KB	Output is correct
5	Correct	2 ms	8284 KB	Output is correct
6	Correct	3 ms	8108 KB	Output is correct
7	Correct	3 ms	8284 KB	Output is correct
8	Correct	4 ms	8284 KB	Output is correct
9	Correct	2 ms	8304 KB	Output is correct
10	Correct	3 ms	8252 KB	Output is correct
11	Correct	3 ms	8284 KB	Output is correct
12	Correct	3 ms	8284 KB	Output is correct
13	Correct	2 ms	8284 KB	Output is correct
14	Correct	3 ms	8284 KB	Output is correct
15	Correct	4 ms	8284 KB	Output is correct
16	Correct	4 ms	8072 KB	Output is correct
17	Correct	4 ms	8284 KB	Output is correct
18	Correct	4 ms	8284 KB	Output is correct
19	Correct	4 ms	8284 KB	Output is correct
20	Correct	4 ms	8284 KB	Output is correct
21	Correct	4 ms	8284 KB	Output is correct
22	Correct	4 ms	8284 KB	Output is correct
23	Correct	4 ms	8536 KB	Output is correct
24	Correct	6 ms	8316 KB	Output is correct
25	Correct	4 ms	8284 KB	Output is correct
26	Correct	6 ms	8320 KB	Output is correct
27	Correct	4 ms	8284 KB	Output is correct
28	Correct	5 ms	8284 KB	Output is correct
29	Correct	4 ms	8080 KB	Output is correct
30	Execution timed out	1065 ms	21072 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-

답안 #1043264

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