oj.uz

Submission #114167

# Submission time Handle Problem Language Result Execution time Memory
114167 2019-05-31T07:31:22 Z TAMREF Can polan into space? (OJUZ11_space) C++11
100 / 100
 127 ms 28664 KB 
#include <bits/stdc++.h>
#define va first
#define vb second
#define lb lower_bound
#define ub upper_bound
#define pp push_back
#define ep emplace_back
#define all(v) (v).begin(),(v).end()
#define szz(v) ((int)(v).size())
#define psm partial_sum
#define acm accumulate
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
using ll = long long; using lf = long double;
using pii = pair<int,int>; using ppi = pair<int,pii>;
using pss = pair<short,short>; using pll = pair<ll,ll>;
const lf PI = 3.14159265358979323846264338L;
template <typename T>
inline T umax(T& u, T v){return u = max(u, v);}
template <typename T>
inline T umin(T& u, T v){return u = min(u, v);}

ll d[200005][4];
char b[200005][4];
char ideg[200005]; 
// 0 = <<, 1 = <>, 2 = ><, 3 = >>
int a[200005][3];
int n;
vector<int> G[200005];

void dp_eval(ll& dp, char &bp, ll dv, char bv){
    if(dp < dv){
        dp = dv;
        bp = bv;
    }
}

int main(){
    fio;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i][0] >> a[i][1] >> a[i][2];
    }
    d[1][0] = a[1][1];
    d[1][1] = a[1][0];
    d[1][2] = -LLONG_MAX;
    d[1][3] = -LLONG_MAX;
    for(int i = 2; i <= n; i++){
        for(int k = 0; k < 8; k++){
            int from = (k >> 1) & 3, to = k & 3;
            dp_eval(d[i][to], b[i][to], d[i-1][from] + a[i][to/2 + !(to&1)], from);
        }
    }
    int now;
    if(d[n][1] > d[n][3]){
        cout << d[n][1] << '\n';
        now = 1;
    }else{
        cout << d[n][3] << '\n';
        now = 3;
    }
    queue<int> q;
    for(int i = n; i >= 1; i--){
        if(now & 1){
            if(i + 1 <= n){
                G[i].pp(i+1);
                ++ideg[i+1];
            }
        }
        if(now < 2){
            if(i - 1){
                G[i].pp(i-1);
                ++ideg[i-1];
            }
        }
        if(now == 1){
            q.push(i);
        }
        now = b[i][now];
    }
    while(q.size()){
        int f = q.front(); q.pop();
        cout << f << ' ';
        for(int u : G[f]){
            --ideg[u];
            if(!ideg[u]) q.push(u);
        }
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
23.0 / 23.0

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

Subtask #4
26.0 / 26.0

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

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 5 ms 5120 KB Output is correct
5 Correct 5 ms 5120 KB Output is correct
6 Correct 5 ms 4992 KB Output is correct
7 Correct 6 ms 5120 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 5 ms 4992 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 5 ms 4992 KB Output is correct
12 Correct 5 ms 5092 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 6 ms 5120 KB Output is correct
15 Correct 6 ms 5120 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 6 ms 4992 KB Output is correct
18 Correct 6 ms 5092 KB Output is correct
19 Correct 5 ms 5120 KB Output is correct
20 Correct 6 ms 5092 KB Output is correct
21 Correct 6 ms 5120 KB Output is correct
22 Correct 7 ms 5128 KB Output is correct
23 Correct 6 ms 4992 KB Output is correct
24 Correct 6 ms 4992 KB Output is correct
25 Correct 7 ms 5120 KB Output is correct
26 Correct 7 ms 4992 KB Output is correct
27 Correct 6 ms 4992 KB Output is correct
28 Correct 5 ms 5120 KB Output is correct
29 Correct 6 ms 4992 KB Output is correct
30 Correct 5 ms 4992 KB Output is correct
31 Correct 6 ms 5120 KB Output is correct
32 Correct 6 ms 4992 KB Output is correct
33 Correct 9 ms 5120 KB Output is correct
34 Correct 7 ms 5120 KB Output is correct
35 Correct 6 ms 5120 KB Output is correct
36 Correct 6 ms 5120 KB Output is correct
37 Correct 6 ms 4992 KB Output is correct
38 Correct 5 ms 4992 KB Output is correct
39 Correct 7 ms 5120 KB Output is correct
40 Correct 6 ms 5120 KB Output is correct
41 Correct 6 ms 5120 KB Output is correct
42 Correct 6 ms 5120 KB Output is correct
43 Correct 6 ms 5120 KB Output is correct
44 Correct 6 ms 5120 KB Output is correct
45 Correct 6 ms 5120 KB Output is correct
46 Correct 6 ms 5120 KB Output is correct
47 Correct 15 ms 5120 KB Output is correct
48 Correct 6 ms 5120 KB Output is correct
49 Correct 7 ms 5120 KB Output is correct
50 Correct 6 ms 5120 KB Output is correct
51 Correct 6 ms 5248 KB Output is correct
52 Correct 6 ms 5120 KB Output is correct
53 Correct 6 ms 5120 KB Output is correct
54 Correct 6 ms 5120 KB Output is correct
55 Correct 13 ms 6144 KB Output is correct
56 Correct 12 ms 6144 KB Output is correct
57 Correct 12 ms 6144 KB Output is correct
58 Correct 11 ms 6144 KB Output is correct
59 Correct 11 ms 6144 KB Output is correct
60 Correct 13 ms 6144 KB Output is correct
61 Correct 13 ms 6272 KB Output is correct
62 Correct 11 ms 5888 KB Output is correct
63 Correct 7 ms 5276 KB Output is correct
64 Correct 12 ms 6144 KB Output is correct
65 Correct 10 ms 6016 KB Output is correct
66 Correct 12 ms 6144 KB Output is correct
67 Correct 9 ms 5616 KB Output is correct
68 Correct 8 ms 5376 KB Output is correct
69 Correct 11 ms 6144 KB Output is correct
70 Correct 12 ms 6144 KB Output is correct
71 Correct 120 ms 26488 KB Output is correct
72 Correct 112 ms 28664 KB Output is correct
73 Correct 121 ms 26488 KB Output is correct
74 Correct 86 ms 24952 KB Output is correct
75 Correct 122 ms 26488 KB Output is correct
76 Correct 127 ms 26460 KB Output is correct
77 Correct 52 ms 13944 KB Output is correct
78 Correct 123 ms 26412 KB Output is correct
79 Correct 123 ms 26488 KB Output is correct
80 Correct 106 ms 27900 KB Output is correct
81 Correct 27 ms 9316 KB Output is correct
82 Correct 82 ms 19448 KB Output is correct
83 Correct 118 ms 26488 KB Output is correct
84 Correct 120 ms 26488 KB Output is correct
85 Correct 125 ms 26576 KB Output is correct
86 Correct 122 ms 26488 KB Output is correct
87 Correct 113 ms 25216 KB Output is correct
88 Correct 23 ms 8444 KB Output is correct
89 Correct 79 ms 17208 KB Output is correct
90 Correct 52 ms 14968 KB Output is correct
91 Correct 10 ms 6016 KB Output is correct
92 Correct 50 ms 14968 KB Output is correct