답안 #20430 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
20430	2017-02-11T12:31:29 Z	I_forgot_password(#50, mAng0)	Can polan into space? (OJUZ11_space)	C++	100 / 100	146 ms	23176 KB

space

#include<bits/stdc++.h>
#define infll 1000000000000000000LL
using namespace std;

long long dp[200005][3][2];
long long cost[200005][3];
int prv[200005][3][2];
int ans[200005];
vector<int> gak[3];
int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<=n;i++){
        for(int j=0;j<3;j++){
            for(int k=0;k<2;k++){
                dp[i][j][k] = -infll;
            }
        }
    }
    for(int i=1;i<=n;i++){
        scanf("%d%d%d",&cost[i][0],&cost[i][1],&cost[i][2]);
    }
    dp[0][2][1] = 0;
    for(int i=1;i<=n;i++){
        for(int j=0;j<3;j++){
            /**dp[i][j][k] : j�� ����, k�� i+1��°�� i��°���� ���� �Ǿ���ϴ°�??*/
            dp[i][0][0] = max(dp[i][0][0], dp[i-1][j][1] + cost[i][0]);
            if(dp[i][0][0] == dp[i-1][j][1] + cost[i][0]) prv[i][0][0] = j;
            dp[i][1][0] = max(dp[i][1][0], dp[i-1][j][0] + cost[i][1]);
            if(dp[i][1][0] == dp[i-1][j][0] + cost[i][1]) prv[i][1][0] = j;
            dp[i][1][1] = max(dp[i][1][1], dp[i-1][j][1] + cost[i][1]);
            if(dp[i][1][1] == dp[i-1][j][1] + cost[i][1]) prv[i][1][1] = j;
            dp[i][2][1] = max(dp[i][2][1], dp[i-1][j][0] + cost[i][2]);
            if(dp[i][2][1] == dp[i-1][j][0] + cost[i][2]) prv[i][2][1] = j;
        }
        //printf("%lld %lld %lld %lld\n",dp[i][0][0],dp[i][1][0],dp[i][1][1],dp[i][2][1]);
    }
    printf("%lld\n",max(dp[n][0][0],dp[n][1][0]));
    pair<int,int> now_status;
    if(dp[n][0][0]<dp[n][1][0]) now_status = make_pair(1,0);
    else now_status = make_pair(0,0);
    for(int i=n;i>=1;i--){
        ans[i] = now_status.first;
        gak[ans[i]].push_back(i);
        now_status = make_pair(prv[i][now_status.first][now_status.second],1 + now_status.second - now_status.first);
    }
    ans[0] = 2; ans[n+1]=2;
    for(int i=0;i<gak[0].size();i++){
        printf("%d ",gak[0][i]);
        int target = gak[0][i]-1;
        while(ans[target]==1){
            printf("%d ",target);
            target--;
        }
        target = gak[0][i]+1;
        while(ans[target]==1){
            printf("%d ",target);
            target++;
        }
    }
    for(int i=0;i<gak[2].size();i++) printf("%d ",gak[2][i]);
    printf("\n");
}

Compilation message

space.cpp: In function 'int main()':
space.cpp:21:59: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
         scanf("%d%d%d",&cost[i][0],&cost[i][1],&cost[i][2]);
                                                           ^
space.cpp:21:59: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long int*' [-Wformat=]
space.cpp:21:59: warning: format '%d' expects argument of type 'int*', but argument 4 has type 'long long int*' [-Wformat=]
space.cpp:48:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<gak[0].size();i++){
                  ^
space.cpp:61:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<gak[2].size();i++) printf("%d ",gak[2][i]);
                  ^
space.cpp:12:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
space.cpp:21:60: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&cost[i][0],&cost[i][1],&cost[i][2]);
                                                            ^

Subtask #1
11.0 / 11.0

#	결과	메모리	Grader output
1	Correct	21552 KB	Output is correct
2	Correct	21552 KB	Output is correct
3	Correct	21552 KB	Output is correct
4	Correct	21552 KB	Output is correct
5	Correct	21552 KB	Output is correct
6	Correct	21552 KB	Output is correct
7	Correct	21552 KB	Output is correct
8	Correct	21552 KB	Output is correct
9	Correct	21552 KB	Output is correct
10	Correct	21552 KB	Output is correct
11	Correct	21552 KB	Output is correct
12	Correct	21552 KB	Output is correct
13	Correct	21552 KB	Output is correct
14	Correct	21552 KB	Output is correct
15	Correct	21552 KB	Output is correct
16	Correct	21552 KB	Output is correct
17	Correct	21552 KB	Output is correct
18	Correct	21552 KB	Output is correct
19	Correct	21552 KB	Output is correct
20	Correct	21552 KB	Output is correct
21	Correct	21552 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	메모리	Grader output
1	Correct	21552 KB	Output is correct
2	Correct	21552 KB	Output is correct
3	Correct	21552 KB	Output is correct
4	Correct	21552 KB	Output is correct
5	Correct	21552 KB	Output is correct
6	Correct	21552 KB	Output is correct
7	Correct	21552 KB	Output is correct
8	Correct	21552 KB	Output is correct
9	Correct	21552 KB	Output is correct
10	Correct	21552 KB	Output is correct
11	Correct	21552 KB	Output is correct
12	Correct	21552 KB	Output is correct
13	Correct	21552 KB	Output is correct
14	Correct	21552 KB	Output is correct
15	Correct	21552 KB	Output is correct
16	Correct	21552 KB	Output is correct
17	Correct	21552 KB	Output is correct
18	Correct	21552 KB	Output is correct
19	Correct	21552 KB	Output is correct
20	Correct	21552 KB	Output is correct
21	Correct	21552 KB	Output is correct
22	Correct	21552 KB	Output is correct
23	Correct	21552 KB	Output is correct
24	Correct	21552 KB	Output is correct
25	Correct	21552 KB	Output is correct
26	Correct	21552 KB	Output is correct
27	Correct	21552 KB	Output is correct
28	Correct	21552 KB	Output is correct
29	Correct	21552 KB	Output is correct
30	Correct	21552 KB	Output is correct
31	Correct	21552 KB	Output is correct
32	Correct	21552 KB	Output is correct
33	Correct	21552 KB	Output is correct
34	Correct	21552 KB	Output is correct
35	Correct	21552 KB	Output is correct
36	Correct	21552 KB	Output is correct
37	Correct	21552 KB	Output is correct

Subtask #3
23.0 / 23.0

#	결과	메모리	Grader output
1	Correct	21552 KB	Output is correct
2	Correct	21552 KB	Output is correct
3	Correct	21552 KB	Output is correct
4	Correct	21552 KB	Output is correct
5	Correct	21552 KB	Output is correct
6	Correct	21552 KB	Output is correct
7	Correct	21552 KB	Output is correct
8	Correct	21552 KB	Output is correct
9	Correct	21552 KB	Output is correct
10	Correct	21552 KB	Output is correct
11	Correct	21552 KB	Output is correct
12	Correct	21552 KB	Output is correct
13	Correct	21552 KB	Output is correct
14	Correct	21552 KB	Output is correct
15	Correct	21552 KB	Output is correct
16	Correct	21552 KB	Output is correct
17	Correct	21552 KB	Output is correct
18	Correct	21552 KB	Output is correct
19	Correct	21552 KB	Output is correct
20	Correct	21552 KB	Output is correct
21	Correct	21552 KB	Output is correct
22	Correct	21552 KB	Output is correct
23	Correct	21552 KB	Output is correct
24	Correct	21552 KB	Output is correct
25	Correct	21552 KB	Output is correct
26	Correct	21552 KB	Output is correct
27	Correct	21552 KB	Output is correct
28	Correct	21552 KB	Output is correct
29	Correct	21552 KB	Output is correct
30	Correct	21552 KB	Output is correct
31	Correct	21552 KB	Output is correct
32	Correct	21552 KB	Output is correct
33	Correct	21552 KB	Output is correct
34	Correct	21552 KB	Output is correct
35	Correct	21552 KB	Output is correct
36	Correct	21552 KB	Output is correct
37	Correct	21552 KB	Output is correct
38	Correct	21552 KB	Output is correct
39	Correct	21552 KB	Output is correct
40	Correct	21552 KB	Output is correct
41	Correct	21552 KB	Output is correct
42	Correct	21552 KB	Output is correct
43	Correct	21552 KB	Output is correct
44	Correct	21552 KB	Output is correct
45	Correct	21552 KB	Output is correct
46	Correct	21552 KB	Output is correct
47	Correct	21552 KB	Output is correct
48	Correct	21552 KB	Output is correct
49	Correct	21552 KB	Output is correct
50	Correct	21552 KB	Output is correct
51	Correct	21552 KB	Output is correct
52	Correct	21552 KB	Output is correct
53	Correct	21552 KB	Output is correct

Subtask #4
26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	21552 KB	Output is correct
2	Correct	0 ms	21552 KB	Output is correct
3	Correct	0 ms	21552 KB	Output is correct
4	Correct	0 ms	21552 KB	Output is correct
5	Correct	0 ms	21552 KB	Output is correct
6	Correct	0 ms	21552 KB	Output is correct
7	Correct	0 ms	21552 KB	Output is correct
8	Correct	0 ms	21552 KB	Output is correct
9	Correct	0 ms	21552 KB	Output is correct
10	Correct	0 ms	21552 KB	Output is correct
11	Correct	0 ms	21552 KB	Output is correct
12	Correct	0 ms	21552 KB	Output is correct
13	Correct	0 ms	21552 KB	Output is correct
14	Correct	0 ms	21552 KB	Output is correct
15	Correct	0 ms	21552 KB	Output is correct
16	Correct	0 ms	21552 KB	Output is correct
17	Correct	0 ms	21552 KB	Output is correct
18	Correct	0 ms	21552 KB	Output is correct
19	Correct	0 ms	21552 KB	Output is correct
20	Correct	0 ms	21552 KB	Output is correct
21	Correct	0 ms	21552 KB	Output is correct
22	Correct	0 ms	21552 KB	Output is correct
23	Correct	0 ms	21552 KB	Output is correct
24	Correct	0 ms	21552 KB	Output is correct
25	Correct	0 ms	21552 KB	Output is correct
26	Correct	0 ms	21552 KB	Output is correct
27	Correct	0 ms	21552 KB	Output is correct
28	Correct	0 ms	21552 KB	Output is correct
29	Correct	0 ms	21552 KB	Output is correct
30	Correct	0 ms	21552 KB	Output is correct
31	Correct	0 ms	21552 KB	Output is correct
32	Correct	0 ms	21552 KB	Output is correct
33	Correct	0 ms	21552 KB	Output is correct
34	Correct	0 ms	21552 KB	Output is correct
35	Correct	0 ms	21552 KB	Output is correct
36	Correct	0 ms	21552 KB	Output is correct
37	Correct	0 ms	21552 KB	Output is correct
38	Correct	0 ms	21552 KB	Output is correct
39	Correct	0 ms	21552 KB	Output is correct
40	Correct	0 ms	21552 KB	Output is correct
41	Correct	0 ms	21552 KB	Output is correct
42	Correct	0 ms	21552 KB	Output is correct
43	Correct	0 ms	21552 KB	Output is correct
44	Correct	0 ms	21552 KB	Output is correct
45	Correct	0 ms	21552 KB	Output is correct
46	Correct	0 ms	21552 KB	Output is correct
47	Correct	0 ms	21552 KB	Output is correct
48	Correct	0 ms	21552 KB	Output is correct
49	Correct	0 ms	21552 KB	Output is correct
50	Correct	0 ms	21552 KB	Output is correct
51	Correct	0 ms	21552 KB	Output is correct
52	Correct	0 ms	21552 KB	Output is correct
53	Correct	0 ms	21552 KB	Output is correct
54	Correct	0 ms	21552 KB	Output is correct
55	Correct	6 ms	21696 KB	Output is correct
56	Correct	6 ms	21696 KB	Output is correct
57	Correct	6 ms	21696 KB	Output is correct
58	Correct	6 ms	21696 KB	Output is correct
59	Correct	6 ms	21696 KB	Output is correct
60	Correct	6 ms	21696 KB	Output is correct
61	Correct	6 ms	21696 KB	Output is correct
62	Correct	3 ms	21552 KB	Output is correct
63	Correct	0 ms	21552 KB	Output is correct
64	Correct	6 ms	21696 KB	Output is correct
65	Correct	0 ms	21696 KB	Output is correct
66	Correct	6 ms	21696 KB	Output is correct
67	Correct	3 ms	21552 KB	Output is correct
68	Correct	0 ms	21552 KB	Output is correct
69	Correct	13 ms	21684 KB	Output is correct

Subtask #5
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	21552 KB	Output is correct
2	Correct	0 ms	21552 KB	Output is correct
3	Correct	0 ms	21552 KB	Output is correct
4	Correct	0 ms	21552 KB	Output is correct
5	Correct	0 ms	21552 KB	Output is correct
6	Correct	0 ms	21552 KB	Output is correct
7	Correct	0 ms	21552 KB	Output is correct
8	Correct	0 ms	21552 KB	Output is correct
9	Correct	0 ms	21552 KB	Output is correct
10	Correct	0 ms	21552 KB	Output is correct
11	Correct	0 ms	21552 KB	Output is correct
12	Correct	0 ms	21552 KB	Output is correct
13	Correct	0 ms	21552 KB	Output is correct
14	Correct	0 ms	21552 KB	Output is correct
15	Correct	0 ms	21552 KB	Output is correct
16	Correct	0 ms	21552 KB	Output is correct
17	Correct	0 ms	21552 KB	Output is correct
18	Correct	0 ms	21552 KB	Output is correct
19	Correct	0 ms	21552 KB	Output is correct
20	Correct	0 ms	21552 KB	Output is correct
21	Correct	0 ms	21552 KB	Output is correct
22	Correct	0 ms	21552 KB	Output is correct
23	Correct	0 ms	21552 KB	Output is correct
24	Correct	0 ms	21552 KB	Output is correct
25	Correct	0 ms	21552 KB	Output is correct
26	Correct	0 ms	21552 KB	Output is correct
27	Correct	0 ms	21552 KB	Output is correct
28	Correct	0 ms	21552 KB	Output is correct
29	Correct	0 ms	21552 KB	Output is correct
30	Correct	0 ms	21552 KB	Output is correct
31	Correct	0 ms	21552 KB	Output is correct
32	Correct	0 ms	21552 KB	Output is correct
33	Correct	0 ms	21552 KB	Output is correct
34	Correct	0 ms	21552 KB	Output is correct
35	Correct	0 ms	21552 KB	Output is correct
36	Correct	0 ms	21552 KB	Output is correct
37	Correct	0 ms	21552 KB	Output is correct
38	Correct	0 ms	21552 KB	Output is correct
39	Correct	0 ms	21552 KB	Output is correct
40	Correct	0 ms	21552 KB	Output is correct
41	Correct	0 ms	21552 KB	Output is correct
42	Correct	0 ms	21552 KB	Output is correct
43	Correct	0 ms	21552 KB	Output is correct
44	Correct	0 ms	21552 KB	Output is correct
45	Correct	0 ms	21552 KB	Output is correct
46	Correct	0 ms	21552 KB	Output is correct
47	Correct	0 ms	21552 KB	Output is correct
48	Correct	0 ms	21552 KB	Output is correct
49	Correct	0 ms	21552 KB	Output is correct
50	Correct	0 ms	21552 KB	Output is correct
51	Correct	0 ms	21552 KB	Output is correct
52	Correct	0 ms	21552 KB	Output is correct
53	Correct	0 ms	21552 KB	Output is correct
54	Correct	0 ms	21552 KB	Output is correct
55	Correct	6 ms	21696 KB	Output is correct
56	Correct	6 ms	21696 KB	Output is correct
57	Correct	6 ms	21696 KB	Output is correct
58	Correct	6 ms	21696 KB	Output is correct
59	Correct	6 ms	21696 KB	Output is correct
60	Correct	6 ms	21696 KB	Output is correct
61	Correct	6 ms	21696 KB	Output is correct
62	Correct	3 ms	21552 KB	Output is correct
63	Correct	0 ms	21552 KB	Output is correct
64	Correct	6 ms	21696 KB	Output is correct
65	Correct	0 ms	21696 KB	Output is correct
66	Correct	6 ms	21696 KB	Output is correct
67	Correct	3 ms	21552 KB	Output is correct
68	Correct	0 ms	21552 KB	Output is correct
69	Correct	13 ms	21684 KB	Output is correct
70	Correct	6 ms	21696 KB	Output is correct
71	Correct	129 ms	22928 KB	Output is correct
72	Correct	109 ms	23176 KB	Output is correct
73	Correct	129 ms	22928 KB	Output is correct
74	Correct	96 ms	23176 KB	Output is correct
75	Correct	129 ms	22928 KB	Output is correct
76	Correct	146 ms	22928 KB	Output is correct
77	Correct	53 ms	22280 KB	Output is correct
78	Correct	136 ms	22928 KB	Output is correct
79	Correct	116 ms	23056 KB	Output is correct
80	Correct	119 ms	23176 KB	Output is correct
81	Correct	26 ms	21960 KB	Output is correct
82	Correct	79 ms	22668 KB	Output is correct
83	Correct	123 ms	22928 KB	Output is correct
84	Correct	103 ms	22928 KB	Output is correct
85	Correct	126 ms	22928 KB	Output is correct
86	Correct	126 ms	22928 KB	Output is correct
87	Correct	133 ms	22924 KB	Output is correct
88	Correct	19 ms	21888 KB	Output is correct
89	Correct	83 ms	22280 KB	Output is correct
90	Correct	43 ms	22408 KB	Output is correct
91	Correct	6 ms	21696 KB	Output is correct
92	Correct	39 ms	22408 KB	Output is correct

답안 #20430

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 12.0 / 12.0

Subtask #3 23.0 / 23.0

Subtask #4 26.0 / 26.0

Subtask #5 28.0 / 28.0

Subtask #1
11.0 / 11.0

Subtask #2
12.0 / 12.0

Subtask #3
23.0 / 23.0

Subtask #4
26.0 / 26.0

Subtask #5
28.0 / 28.0