답안 #98314 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
98314	2019-02-22T07:15:49 Z	someone_aa	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	100 / 100	151 ms	165084 KB

joi2019_ho_t3

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 410;
const int inf = 100000000;
int dp[maxn][maxn][maxn][3];
int n, arr[maxn], pref[maxn][3];
string code;

vector<int>v[3];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n;
    cin>>code;

    for(int i=0;i<code.length();i++) {
        if(code[i] == 'R') arr[i + 1] = 0;
        else if(code[i] == 'G') arr[i + 1] = 1;
        else arr[i + 1] = 2;
        v[arr[i+1]].pb(i + 1);

        for(int j=0;j<=2;j++) {
            pref[i+1][j] = pref[i][j];
        }
        pref[i+1][arr[i+1]]++;
    }

    for(int i=0;i<=v[0].size()+1;i++) {
        for(int j=0;j<=v[1].size()+1;j++) {
            for(int k=0;k<=v[2].size()+1;k++) {
                for(int l=0;l<=2;l++) {
                    dp[i][j][k][l] = inf;
                }
            }
        }
    }

    dp[0][0][0][0] = dp[0][0][0][1] = dp[0][0][0][2] = 0;

    for(int c0=0;c0<=v[0].size();c0++) {
        for(int c1=0;c1<=v[1].size();c1++) {
            for(int c2=0;c2<=v[2].size();c2++) {
                for(int last=0;last<=2;last++) {
                    if(dp[c0][c1][c2][last] == inf) continue;

                    //cout<<c0<<", "<<c1<<", "<<c2<<", "<<last<<" -> "<<dp[c0][c1][c2][last]<<"\n";

                    if(last != 0 && c0 < v[0].size()) {
                        int ind = v[0][c0];
                        int cost = max(0, pref[ind][1] - c1) + max(0, pref[ind][2] - c2);
                        //cout<<"Place 0: "<<ind<<" "<<max(0, pref[1][ind] - c1)<<" "<<max(0, pref[2][ind] - c0)<<"\n";
                        dp[c0+1][c1][c2][0] = min(dp[c0+1][c1][c2][0], dp[c0][c1][c2][last] + cost);
                    }
                    if(last != 1 && c1 < v[1].size()) {
                        int ind = v[1][c1];
                        int cost = max(0, pref[ind][0] - c0) + max(0, pref[ind][2] - c2);
                        //cout<<"Place 1: "<<ind<<" "<<max(0, pref[0][ind] - c0)<<" "<<max(0, pref[2][ind] - c2)<<"\n";
                        dp[c0][c1+1][c2][1] = min(dp[c0][c1+1][c2][1], dp[c0][c1][c2][last] + cost);
                    }
                    if(last != 2 && c2 < v[2].size()) {
                        int ind = v[2][c2];
                        int cost = max(0, pref[ind][0] - c0) + max(0, pref[ind][1] - c1);
                        //cout<<"Place 2: "<<ind<<" "<<max(0, pref[1][ind] - c1)<<" "<<max(0, pref[0][ind] - c0)<<"\n";
                        dp[c0][c1][c2+1][2] = min(dp[c0][c1][c2+1][2], dp[c0][c1][c2][last] + cost);
                    }
                }
            }
        }
    }

    int result = min(min(dp[v[0].size()][v[1].size()][v[2].size()][0], dp[v[0].size()][v[1].size()][v[2].size()][1]), dp[v[0].size()][v[1].size()][v[2].size()][2]);

    if(result == inf) {
        cout<<"-1\n";
        return 0;
    }

    cout<<result<<"\n";
    return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:20:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<code.length();i++) {
                 ~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:32:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<=v[0].size()+1;i++) {
                 ~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:33:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0;j<=v[1].size()+1;j++) {
                     ~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:34:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int k=0;k<=v[2].size()+1;k++) {
                         ~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:44:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int c0=0;c0<=v[0].size();c0++) {
                  ~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:45:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int c1=0;c1<=v[1].size();c1++) {
                      ~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:46:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int c2=0;c2<=v[2].size();c2++) {
                          ~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:52:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     if(last != 0 && c0 < v[0].size()) {
                                     ~~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:58:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     if(last != 1 && c1 < v[1].size()) {
                                     ~~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:64:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     if(last != 2 && c2 < v[2].size()) {
                                     ~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	356 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	640 KB	Output is correct
8	Correct	2 ms	640 KB	Output is correct
9	Correct	3 ms	640 KB	Output is correct
10	Correct	3 ms	768 KB	Output is correct
11	Correct	3 ms	640 KB	Output is correct
12	Correct	3 ms	512 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Correct	3 ms	640 KB	Output is correct
15	Correct	2 ms	512 KB	Output is correct
16	Correct	0 ms	512 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct

Subtask #2
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	356 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	640 KB	Output is correct
8	Correct	2 ms	640 KB	Output is correct
9	Correct	3 ms	640 KB	Output is correct
10	Correct	3 ms	768 KB	Output is correct
11	Correct	3 ms	640 KB	Output is correct
12	Correct	3 ms	512 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Correct	3 ms	640 KB	Output is correct
15	Correct	2 ms	512 KB	Output is correct
16	Correct	0 ms	512 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	4 ms	2560 KB	Output is correct
19	Correct	4 ms	2176 KB	Output is correct
20	Correct	4 ms	2560 KB	Output is correct
21	Correct	4 ms	2692 KB	Output is correct
22	Correct	4 ms	1920 KB	Output is correct
23	Correct	4 ms	2304 KB	Output is correct
24	Correct	4 ms	1792 KB	Output is correct
25	Correct	7 ms	4508 KB	Output is correct
26	Correct	6 ms	4480 KB	Output is correct
27	Correct	5 ms	3328 KB	Output is correct
28	Correct	4 ms	2560 KB	Output is correct
29	Correct	5 ms	2560 KB	Output is correct
30	Correct	4 ms	2560 KB	Output is correct
31	Correct	5 ms	2304 KB	Output is correct
32	Correct	4 ms	2688 KB	Output is correct
33	Correct	6 ms	4096 KB	Output is correct
34	Correct	5 ms	3840 KB	Output is correct
35	Correct	5 ms	2944 KB	Output is correct
36	Correct	4 ms	2176 KB	Output is correct
37	Correct	2 ms	1920 KB	Output is correct
38	Correct	4 ms	2432 KB	Output is correct
39	Correct	4 ms	2560 KB	Output is correct
40	Correct	2 ms	512 KB	Output is correct
41	Correct	4 ms	2560 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	126 ms	164956 KB	Output is correct
3	Correct	130 ms	164088 KB	Output is correct
4	Correct	131 ms	164964 KB	Output is correct
5	Correct	137 ms	165024 KB	Output is correct
6	Correct	133 ms	164988 KB	Output is correct
7	Correct	128 ms	164180 KB	Output is correct
8	Correct	132 ms	164216 KB	Output is correct
9	Correct	117 ms	163308 KB	Output is correct
10	Correct	125 ms	164992 KB	Output is correct
11	Correct	133 ms	164984 KB	Output is correct
12	Correct	34 ms	45048 KB	Output is correct
13	Correct	63 ms	78456 KB	Output is correct
14	Correct	86 ms	113016 KB	Output is correct
15	Correct	116 ms	164984 KB	Output is correct
16	Correct	131 ms	165084 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	356 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	2 ms	512 KB	Output is correct
6	Correct	2 ms	640 KB	Output is correct
7	Correct	2 ms	640 KB	Output is correct
8	Correct	2 ms	640 KB	Output is correct
9	Correct	3 ms	640 KB	Output is correct
10	Correct	3 ms	768 KB	Output is correct
11	Correct	3 ms	640 KB	Output is correct
12	Correct	3 ms	512 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Correct	3 ms	640 KB	Output is correct
15	Correct	2 ms	512 KB	Output is correct
16	Correct	0 ms	512 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	4 ms	2560 KB	Output is correct
19	Correct	4 ms	2176 KB	Output is correct
20	Correct	4 ms	2560 KB	Output is correct
21	Correct	4 ms	2692 KB	Output is correct
22	Correct	4 ms	1920 KB	Output is correct
23	Correct	4 ms	2304 KB	Output is correct
24	Correct	4 ms	1792 KB	Output is correct
25	Correct	7 ms	4508 KB	Output is correct
26	Correct	6 ms	4480 KB	Output is correct
27	Correct	5 ms	3328 KB	Output is correct
28	Correct	4 ms	2560 KB	Output is correct
29	Correct	5 ms	2560 KB	Output is correct
30	Correct	4 ms	2560 KB	Output is correct
31	Correct	5 ms	2304 KB	Output is correct
32	Correct	4 ms	2688 KB	Output is correct
33	Correct	6 ms	4096 KB	Output is correct
34	Correct	5 ms	3840 KB	Output is correct
35	Correct	5 ms	2944 KB	Output is correct
36	Correct	4 ms	2176 KB	Output is correct
37	Correct	2 ms	1920 KB	Output is correct
38	Correct	4 ms	2432 KB	Output is correct
39	Correct	4 ms	2560 KB	Output is correct
40	Correct	2 ms	512 KB	Output is correct
41	Correct	4 ms	2560 KB	Output is correct
42	Correct	2 ms	384 KB	Output is correct
43	Correct	126 ms	164956 KB	Output is correct
44	Correct	130 ms	164088 KB	Output is correct
45	Correct	131 ms	164964 KB	Output is correct
46	Correct	137 ms	165024 KB	Output is correct
47	Correct	133 ms	164988 KB	Output is correct
48	Correct	128 ms	164180 KB	Output is correct
49	Correct	132 ms	164216 KB	Output is correct
50	Correct	117 ms	163308 KB	Output is correct
51	Correct	125 ms	164992 KB	Output is correct
52	Correct	133 ms	164984 KB	Output is correct
53	Correct	34 ms	45048 KB	Output is correct
54	Correct	63 ms	78456 KB	Output is correct
55	Correct	86 ms	113016 KB	Output is correct
56	Correct	116 ms	164984 KB	Output is correct
57	Correct	131 ms	165084 KB	Output is correct
58	Correct	115 ms	78496 KB	Output is correct
59	Correct	113 ms	99252 KB	Output is correct
60	Correct	101 ms	90284 KB	Output is correct
61	Correct	105 ms	87288 KB	Output is correct
62	Correct	142 ms	162680 KB	Output is correct
63	Correct	123 ms	162260 KB	Output is correct
64	Correct	143 ms	152048 KB	Output is correct
65	Correct	151 ms	140652 KB	Output is correct
66	Correct	109 ms	88572 KB	Output is correct
67	Correct	111 ms	85208 KB	Output is correct
68	Correct	120 ms	91220 KB	Output is correct
69	Correct	115 ms	87876 KB	Output is correct
70	Correct	110 ms	95096 KB	Output is correct
71	Correct	90 ms	86292 KB	Output is correct
72	Correct	43 ms	43768 KB	Output is correct
73	Correct	6 ms	3456 KB	Output is correct

답안 #98314

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 55.0 / 55.0

Subtask #3 15.0 / 15.0

Subtask #4 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
55.0 / 55.0

Subtask #3
15.0 / 15.0

Subtask #4
25.0 / 25.0