oj.uz

Submission #20504

# Submission time Handle Problem Language Result Execution time Memory
20504 2017-02-12T07:01:50 Z 안녕하세요 투어리스트입니다 진짜에요(#49, Namnamseo) Can polan into space? (OJUZ11_space) C++14
100 / 100
 143 ms 14520 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back

int n;
ll a[200010];
ll b[200010];
ll c[200010];

ll inf = (1LL<<60);

ll dp[200010][4];

int use[200010];

#define NOA 0
#define HEA 1
#define AFA 2
#define HEC 3

int adjc[200010];

int main()
{
	//freopen("in", "r", stdin);
    read(n); for(int i=1; i<=n; ++i) read(a[i], b[i], c[i]);
    dp[0][NOA] = 0;
    dp[0][HEA] = -inf;
    dp[0][AFA] = -inf;
    dp[0][HEC] = -inf;
    
    for(int i=1; i<=n; ++i){
		dp[i][NOA] = max(dp[i-1][HEC], dp[i-1][NOA]) + b[i];
		dp[i][HEA] = max(dp[i-1][HEC], dp[i-1][NOA]) + a[i];
		dp[i][AFA] = max(dp[i-1][AFA], dp[i-1][HEA]) + b[i];
		dp[i][HEC] = max(dp[i-1][AFA], dp[i-1][HEA]) + c[i];
    }
    
    ll ans = max(dp[n][AFA], dp[n][HEA]);
    printf("%lld\n", ans);
    int mi=0;
    if(ans == dp[n][AFA]) mi=AFA; else mi=HEA;
    for(int i=n; 1<=i; --i){
		if(mi == NOA){
			use[i]=2;
			mi = (dp[i-1][HEC] > dp[i-1][NOA] ? HEC : NOA);
		} else if(mi == HEA){
			use[i]=1;
			mi = (dp[i-1][HEC] > dp[i-1][NOA] ? HEC : NOA);
		} else if(mi == AFA){
			use[i]=2;
			mi = (dp[i-1][HEA] > dp[i-1][AFA] ? HEA : AFA);
		} else if(mi == HEC){
			use[i]=3;
			mi = (dp[i-1][HEA] > dp[i-1][AFA] ? HEA : AFA);
		}
    }
    
    for(int i=1; i<=n; ++i) if(use[i]==1){
		printf("%d ", i);
		for(int j=i-1; j>=1; --j){
			if(use[j] != 2) break;
			printf("%d ", j);
		}
		for(int j=i+1; j<=n; ++j){
			if(use[j] != 2) break;
			printf("%d ", j);
		}
    }
    for(int i=1; i<=n; ++i) if(use[i]==3){
		printf("%d ", i);
    }
    return 0;
}

Compilation message

space.cpp: In function 'void read(int&)':
space.cpp:5:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void read(int& x){ scanf("%d",&x); }
                                  ^
space.cpp: In function 'void read(ll&)':
space.cpp:6:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void read(ll& x){ scanf("%lld",&x); }
                                   ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 14520 KB Output is correct
2 Correct 0 ms 14520 KB Output is correct
3 Correct 0 ms 14520 KB Output is correct
4 Correct 0 ms 14520 KB Output is correct
5 Correct 0 ms 14520 KB Output is correct
6 Correct 0 ms 14520 KB Output is correct
7 Correct 0 ms 14520 KB Output is correct
8 Correct 0 ms 14520 KB Output is correct
9 Correct 0 ms 14520 KB Output is correct
10 Correct 0 ms 14520 KB Output is correct
11 Correct 0 ms 14520 KB Output is correct
12 Correct 0 ms 14520 KB Output is correct
13 Correct 0 ms 14520 KB Output is correct
14 Correct 0 ms 14520 KB Output is correct
15 Correct 0 ms 14520 KB Output is correct
16 Correct 0 ms 14520 KB Output is correct
17 Correct 0 ms 14520 KB Output is correct
18 Correct 0 ms 14520 KB Output is correct
19 Correct 0 ms 14520 KB Output is correct
20 Correct 0 ms 14520 KB Output is correct
21 Correct 0 ms 14520 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 14520 KB Output is correct
2 Correct 0 ms 14520 KB Output is correct
3 Correct 0 ms 14520 KB Output is correct
4 Correct 0 ms 14520 KB Output is correct
5 Correct 0 ms 14520 KB Output is correct
6 Correct 0 ms 14520 KB Output is correct
7 Correct 0 ms 14520 KB Output is correct
8 Correct 0 ms 14520 KB Output is correct
9 Correct 0 ms 14520 KB Output is correct
10 Correct 0 ms 14520 KB Output is correct
11 Correct 0 ms 14520 KB Output is correct
12 Correct 0 ms 14520 KB Output is correct
13 Correct 0 ms 14520 KB Output is correct
14 Correct 0 ms 14520 KB Output is correct
15 Correct 0 ms 14520 KB Output is correct
16 Correct 0 ms 14520 KB Output is correct
17 Correct 0 ms 14520 KB Output is correct
18 Correct 0 ms 14520 KB Output is correct
19 Correct 0 ms 14520 KB Output is correct
20 Correct 0 ms 14520 KB Output is correct
21 Correct 0 ms 14520 KB Output is correct
22 Correct 0 ms 14520 KB Output is correct
23 Correct 0 ms 14520 KB Output is correct
24 Correct 0 ms 14520 KB Output is correct
25 Correct 0 ms 14520 KB Output is correct
26 Correct 0 ms 14520 KB Output is correct
27 Correct 0 ms 14520 KB Output is correct
28 Correct 0 ms 14520 KB Output is correct
29 Correct 0 ms 14520 KB Output is correct
30 Correct 0 ms 14520 KB Output is correct
31 Correct 0 ms 14520 KB Output is correct
32 Correct 0 ms 14520 KB Output is correct
33 Correct 0 ms 14520 KB Output is correct
34 Correct 0 ms 14520 KB Output is correct
35 Correct 0 ms 14520 KB Output is correct
36 Correct 0 ms 14520 KB Output is correct
37 Correct 0 ms 14520 KB Output is correct

Subtask #3
23.0 / 23.0

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

Subtask #4
26.0 / 26.0

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

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 14520 KB Output is correct
2 Correct 0 ms 14520 KB Output is correct
3 Correct 0 ms 14520 KB Output is correct
4 Correct 0 ms 14520 KB Output is correct
5 Correct 0 ms 14520 KB Output is correct
6 Correct 0 ms 14520 KB Output is correct
7 Correct 0 ms 14520 KB Output is correct
8 Correct 0 ms 14520 KB Output is correct
9 Correct 0 ms 14520 KB Output is correct
10 Correct 0 ms 14520 KB Output is correct
11 Correct 0 ms 14520 KB Output is correct
12 Correct 0 ms 14520 KB Output is correct
13 Correct 0 ms 14520 KB Output is correct
14 Correct 0 ms 14520 KB Output is correct
15 Correct 0 ms 14520 KB Output is correct
16 Correct 0 ms 14520 KB Output is correct
17 Correct 0 ms 14520 KB Output is correct
18 Correct 0 ms 14520 KB Output is correct
19 Correct 0 ms 14520 KB Output is correct
20 Correct 0 ms 14520 KB Output is correct
21 Correct 0 ms 14520 KB Output is correct
22 Correct 0 ms 14520 KB Output is correct
23 Correct 0 ms 14520 KB Output is correct
24 Correct 0 ms 14520 KB Output is correct
25 Correct 0 ms 14520 KB Output is correct
26 Correct 0 ms 14520 KB Output is correct
27 Correct 0 ms 14520 KB Output is correct
28 Correct 0 ms 14520 KB Output is correct
29 Correct 0 ms 14520 KB Output is correct
30 Correct 0 ms 14520 KB Output is correct
31 Correct 0 ms 14520 KB Output is correct
32 Correct 0 ms 14520 KB Output is correct
33 Correct 0 ms 14520 KB Output is correct
34 Correct 0 ms 14520 KB Output is correct
35 Correct 0 ms 14520 KB Output is correct
36 Correct 0 ms 14520 KB Output is correct
37 Correct 0 ms 14520 KB Output is correct
38 Correct 0 ms 14520 KB Output is correct
39 Correct 0 ms 14520 KB Output is correct
40 Correct 0 ms 14520 KB Output is correct
41 Correct 0 ms 14520 KB Output is correct
42 Correct 0 ms 14520 KB Output is correct
43 Correct 0 ms 14520 KB Output is correct
44 Correct 0 ms 14520 KB Output is correct
45 Correct 0 ms 14520 KB Output is correct
46 Correct 0 ms 14520 KB Output is correct
47 Correct 0 ms 14520 KB Output is correct
48 Correct 0 ms 14520 KB Output is correct
49 Correct 0 ms 14520 KB Output is correct
50 Correct 0 ms 14520 KB Output is correct
51 Correct 0 ms 14520 KB Output is correct
52 Correct 0 ms 14520 KB Output is correct
53 Correct 0 ms 14520 KB Output is correct
54 Correct 0 ms 14520 KB Output is correct
55 Correct 6 ms 14520 KB Output is correct
56 Correct 6 ms 14520 KB Output is correct
57 Correct 6 ms 14520 KB Output is correct
58 Correct 6 ms 14520 KB Output is correct
59 Correct 6 ms 14520 KB Output is correct
60 Correct 6 ms 14520 KB Output is correct
61 Correct 3 ms 14520 KB Output is correct
62 Correct 3 ms 14520 KB Output is correct
63 Correct 0 ms 14520 KB Output is correct
64 Correct 6 ms 14520 KB Output is correct
65 Correct 3 ms 14520 KB Output is correct
66 Correct 6 ms 14520 KB Output is correct
67 Correct 3 ms 14520 KB Output is correct
68 Correct 0 ms 14520 KB Output is correct
69 Correct 6 ms 14520 KB Output is correct
70 Correct 6 ms 14520 KB Output is correct
71 Correct 123 ms 14520 KB Output is correct
72 Correct 89 ms 14520 KB Output is correct
73 Correct 139 ms 14520 KB Output is correct
74 Correct 96 ms 14520 KB Output is correct
75 Correct 113 ms 14520 KB Output is correct
76 Correct 129 ms 14520 KB Output is correct
77 Correct 53 ms 14520 KB Output is correct
78 Correct 113 ms 14520 KB Output is correct
79 Correct 123 ms 14520 KB Output is correct
80 Correct 109 ms 14520 KB Output is correct
81 Correct 26 ms 14520 KB Output is correct
82 Correct 83 ms 14520 KB Output is correct
83 Correct 133 ms 14520 KB Output is correct
84 Correct 109 ms 14520 KB Output is correct
85 Correct 133 ms 14520 KB Output is correct
86 Correct 143 ms 14520 KB Output is correct
87 Correct 129 ms 14520 KB Output is correct
88 Correct 16 ms 14520 KB Output is correct
89 Correct 69 ms 14520 KB Output is correct
90 Correct 43 ms 14520 KB Output is correct
91 Correct 3 ms 14520 KB Output is correct
92 Correct 43 ms 14520 KB Output is correct