답안 #770403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
770403	2023-07-01T07:18:51 Z	Plurm	Copy and Paste 3 (JOI22_copypaste3)	C++11	1 / 100	16 ms	320 KB

copypaste3

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

int dp[2505];
int main() {
    int n;
    string s;
    int a, b, c;
    cin >> n >> s >> a >> b >> c;
    if (n == 3) {
        set<char> st;
        st.insert(s[0]);
        st.insert(s[1]);
        st.insert(s[2]);
        if (st.size() == 3)
            cout << 3ll * a << endl;
        else if (st.size() == 2)
            cout << min(3ll * a, 2ll * a + b + 2ll * c) << endl;
        else
            cout << min({3ll * a, 2ll * a + b + 2ll * c, a + b + 3ll * c})
                 << endl;
    } else {
        dp[1] = a;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + a;
            for (int j = 1; j < i; j++) {
                dp[i] = min(dp[i], dp[j] + dp[i - j]);
                for (int k = 2; j * k <= i; k++) {
                    dp[i] = min(dp[i], dp[j] + b + c * k + dp[i - j * k]);
                }
            }
        }
        cout << dp[n] << endl;
    }
    return 0;
}

Subtask #1

1.0 / 1.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	236 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct

Subtask #2

0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	13 ms	308 KB	Output is correct
4	Incorrect	16 ms	320 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #3

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	236 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Incorrect	0 ms	212 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	236 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Incorrect	0 ms	212 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	236 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Incorrect	0 ms	212 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #6

0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	236 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	13 ms	308 KB	Output is correct
14	Incorrect	16 ms	320 KB	Output isn't correct
15	Halted	0 ms	0 KB	-