oj.uz

Submission #561345

# Submission time Handle Problem Language Result Execution time Memory
561345 2022-05-12T16:36:47 Z InternetPerson10 Rainforest Jumps (APIO21_jumps) C++17
37 / 100
 4000 ms 593428 KB 
#include "jumps.h"
#include <bits/stdc++.h>

using namespace std;

int subtask = 1;

int n;
vector<int> nums, l, r;
vector<vector<int>> liftBig, liftRight, liftLeft;

bool invalid(int k) {
    if(k == -1 || k == n) return true;
    return false;
}

int bigger(int a, int b) {
    if(invalid(a) && invalid(b)) return -1;
    if(invalid(a)) return b;
    if(invalid(b)) return a;
    if(nums[a] > nums[b]) return a;
    return b;
}

void init(int N, std::vector<int> H) {
    bool subtask1 = true;
    for(int i = 0; i < N; i++) {
        if(H[i] != i+1) subtask1 = false;
        H[i]--;
    }
    if(subtask1) subtask = 1;
    else if(N <= 200) subtask = 2;
    else subtask = 3;
    n = N;
    nums = H;
    l.resize(n, -1);
    r.resize(n, n);
    liftBig.resize(n, vector<int>(20));
    liftRight.resize(n, vector<int>(20));
    liftLeft.resize(n, vector<int>(20));
    vector<int> v;
    v.push_back(0);
    for(int i = 1; i < n; i++) {
        while(v.size()) {
            if(nums[v.back()] < nums[i]) {
                r[v.back()] = i;
                v.pop_back();
            }
            else break;
        }
        v.push_back(i);
    }
    v.clear();
    v.push_back(n-1);
    for(int i = n-2; i >= 0; i--) {
        while(v.size()) {
            if(nums[v.back()] < nums[i]) {
                l[v.back()] = i;
                v.pop_back();
            }
            else break;
        }
        v.push_back(i);
    }
    for(int j = 0; j < N; j++) {
        liftBig[j][0] = bigger(l[j], r[j]);
        liftLeft[j][0] = l[j];
        if(r[j] == n) liftRight[j][0] = -1;
        else liftRight[j][0] = r[j];
    }
    for(int i = 1; i < 20; i++) {
        for(int j = 0; j < N; j++) {
            if(liftBig[j][i-1] == -1) liftBig[j][i] = -1;
            else liftBig[j][i] = liftBig[liftBig[j][i-1]][i-1];
            if(liftRight[j][i-1] == -1) liftRight[j][i] = -1;
            else liftRight[j][i] = liftRight[liftRight[j][i-1]][i-1];
            if(liftLeft[j][i-1] == -1) liftLeft[j][i] = -1;
            else liftLeft[j][i] = liftLeft[liftLeft[j][i-1]][i-1];
        }
    }
}

int BIG = 1e9 + 7;

int reachable(int x, int C, int D) { // With a series of right jumps
    if(C <= x && x <= D) return 0;
    if(x > D) return -1;
    int ans2 = BIG, tot = 0;
    for(int i = 19; i >= 0; i--) {
        if(liftRight[x][i] == -1) continue;
        if(liftRight[x][i] > D) continue;
        if(liftRight[x][i] >= C) ans2 = min(ans2, tot + (1 << i));
        else {
            x = liftRight[x][i];
            tot += (1 << i);
        }
    }
    if(ans2 == BIG) return -1;
    return ans2;
}

int single_min_jumps(int x, int C, int D) {
    int r = reachable(x, C, D);
    if(r == -1) return BIG;
    int ans = r;
    int tot = 0;
    if(subtask == 2) {
        while(liftBig[x][0] != -1) {
            x = liftBig[x][0];
            tot++;
            r = reachable(x, C, D);
            if(r != -1) ans = min(ans, r + tot);
        }
        return ans;
    }
    for(int i = 19; i >= 0; i--) {
        if(liftBig[x][i] == -1) continue;
        int r = reachable(liftBig[x][i], C, D);
        if(r == -1) continue;
        ans = min(ans, tot + (1 << i) + r);
        if(r != 0) {
            x = liftBig[x][i];
            tot += (1 << i);
        }
    }
    return ans;
}

map<pair<int, pair<int, int>>, int> dp;

int single_min_jumps_brute(int x, int C, int D) {
    if(invalid(x)) return BIG;
    pair<int, pair<int, int>> p = {x, {C, D}};
    if(dp.count(p)) return dp[p];
    if(C <= x && x <= D) return dp[p] = 0;
    return dp[p] = min(single_min_jumps_brute(l[x], C, D),
            single_min_jumps_brute(r[x], C, D)) + 1;
}

void debug(int A, int B, int C, int D, int ans) {
    int ans2 = BIG;
    for(int i = A; i <= B; i++) {
        ans2 = min(ans2, single_min_jumps_brute(i, C, D));
    }
    if(ans2 == BIG) ans2 = -1;
    if(ans != ans2) {
        cerr << "NUMBERS:\n";
        for(int i = 0; i < n; i++) cerr << i << ' ' << nums[i] << '\n';
        cerr << '\n';
        cerr << "CASE: " << A << ' ' << B << ' ' << C << ' ' << D << '\n';
        cerr << "ANS: " << ans << '\n';
        cerr << "BRUTE: " << ans2 << '\n';
        assert(false);
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    if(subtask == 1) {
        return C - B;
    }
    int ans = BIG;
    for(int i = A; i <= B; i++) {
        ans = min(ans, single_min_jumps_brute(i, C, D));
    }
    /*
    for(int i = 19; i >= 0; i--) {
        if(liftLeft[B][i] == -1) continue;
        if(liftLeft[B][i] < A) continue;
        if(reachable(liftLeft[B][i], C, D) == -1) continue;
        B = liftLeft[B][i];
    }
    */
    if(ans == BIG) ans = -1;
    return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 268 ms 60568 KB Output is correct
4 Correct 1098 ms 75788 KB Output is correct
5 Correct 777 ms 38300 KB Output is correct
6 Correct 1047 ms 75720 KB Output is correct
7 Correct 829 ms 52208 KB Output is correct
8 Correct 934 ms 75720 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 4 ms 208 KB Output is correct
6 Correct 13 ms 1028 KB Output is correct
7 Correct 9 ms 720 KB Output is correct
8 Correct 12 ms 928 KB Output is correct
9 Correct 2 ms 464 KB Output is correct
10 Correct 9 ms 848 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 11 ms 1360 KB Output is correct
13 Correct 10 ms 1212 KB Output is correct
14 Correct 9 ms 996 KB Output is correct
15 Correct 20 ms 1804 KB Output is correct
16 Correct 11 ms 1388 KB Output is correct
17 Correct 5 ms 720 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 9 ms 748 KB Output is correct
21 Correct 10 ms 992 KB Output is correct
22 Correct 9 ms 748 KB Output is correct
23 Correct 14 ms 1216 KB Output is correct
24 Correct 4 ms 348 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 3 ms 464 KB Output is correct
29 Correct 5 ms 720 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 10 ms 1092 KB Output is correct
32 Correct 4 ms 336 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 2 ms 336 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 4 ms 208 KB Output is correct
6 Correct 13 ms 1028 KB Output is correct
7 Correct 9 ms 720 KB Output is correct
8 Correct 12 ms 928 KB Output is correct
9 Correct 2 ms 464 KB Output is correct
10 Correct 9 ms 848 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 11 ms 1360 KB Output is correct
13 Correct 10 ms 1212 KB Output is correct
14 Correct 9 ms 996 KB Output is correct
15 Correct 20 ms 1804 KB Output is correct
16 Correct 11 ms 1388 KB Output is correct
17 Correct 5 ms 720 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 9 ms 748 KB Output is correct
21 Correct 10 ms 992 KB Output is correct
22 Correct 9 ms 748 KB Output is correct
23 Correct 14 ms 1216 KB Output is correct
24 Correct 4 ms 348 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 3 ms 464 KB Output is correct
29 Correct 5 ms 720 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 10 ms 1092 KB Output is correct
32 Correct 4 ms 336 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 2 ms 336 KB Output is correct
40 Correct 0 ms 256 KB Output is correct
41 Correct 1 ms 256 KB Output is correct
42 Correct 0 ms 208 KB Output is correct
43 Correct 0 ms 208 KB Output is correct
44 Correct 2 ms 256 KB Output is correct
45 Correct 8 ms 976 KB Output is correct
46 Correct 5 ms 720 KB Output is correct
47 Correct 9 ms 944 KB Output is correct
48 Correct 3 ms 464 KB Output is correct
49 Correct 14 ms 976 KB Output is correct
50 Correct 2 ms 336 KB Output is correct
51 Correct 9 ms 1328 KB Output is correct
52 Correct 20 ms 1228 KB Output is correct
53 Correct 12 ms 968 KB Output is correct
54 Correct 19 ms 1760 KB Output is correct
55 Correct 13 ms 1348 KB Output is correct
56 Correct 7 ms 720 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 578 ms 40412 KB Output is correct
59 Correct 980 ms 63600 KB Output is correct
60 Correct 102 ms 7284 KB Output is correct
61 Correct 996 ms 64596 KB Output is correct
62 Correct 81 ms 4232 KB Output is correct
63 Correct 883 ms 62160 KB Output is correct
64 Correct 26 ms 976 KB Output is correct
65 Correct 937 ms 120452 KB Output is correct
66 Correct 1046 ms 124916 KB Output is correct
67 Correct 935 ms 63392 KB Output is correct
68 Correct 2116 ms 161300 KB Output is correct
69 Correct 1326 ms 117680 KB Output is correct
70 Correct 1070 ms 99248 KB Output is correct
71 Correct 1 ms 208 KB Output is correct
72 Correct 1 ms 208 KB Output is correct
73 Correct 7 ms 780 KB Output is correct
74 Correct 11 ms 956 KB Output is correct
75 Correct 9 ms 788 KB Output is correct
76 Correct 11 ms 1180 KB Output is correct
77 Correct 3 ms 336 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 3 ms 208 KB Output is correct
81 Correct 2 ms 336 KB Output is correct
82 Correct 8 ms 856 KB Output is correct
83 Correct 3 ms 512 KB Output is correct
84 Correct 8 ms 1104 KB Output is correct
85 Correct 3 ms 372 KB Output is correct
86 Correct 1 ms 208 KB Output is correct
87 Correct 1 ms 336 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Correct 1 ms 336 KB Output is correct
90 Correct 1 ms 384 KB Output is correct
91 Correct 1 ms 336 KB Output is correct
92 Correct 1 ms 384 KB Output is correct
93 Correct 1 ms 372 KB Output is correct
94 Correct 19 ms 1124 KB Output is correct
95 Correct 724 ms 42104 KB Output is correct
96 Correct 618 ms 67244 KB Output is correct
97 Correct 644 ms 43132 KB Output is correct
98 Correct 1069 ms 95140 KB Output is correct
99 Correct 130 ms 1104 KB Output is correct
100 Correct 1 ms 336 KB Output is correct
101 Correct 2 ms 592 KB Output is correct
102 Correct 44 ms 2496 KB Output is correct
103 Correct 255 ms 43892 KB Output is correct
104 Correct 36 ms 2584 KB Output is correct
105 Correct 724 ms 77416 KB Output is correct
106 Correct 19 ms 1104 KB Output is correct
107 Correct 1 ms 384 KB Output is correct
108 Correct 2 ms 628 KB Output is correct
109 Correct 3 ms 1104 KB Output is correct
110 Correct 3 ms 1360 KB Output is correct
111 Correct 3 ms 1164 KB Output is correct
112 Correct 5 ms 1664 KB Output is correct
113 Correct 3 ms 1232 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 197 ms 64408 KB Output is correct
6 Correct 361 ms 85180 KB Output is correct
7 Correct 89 ms 38352 KB Output is correct
8 Correct 312 ms 87844 KB Output is correct
9 Correct 52 ms 13344 KB Output is correct
10 Correct 228 ms 78744 KB Output is correct
11 Correct 192 ms 75768 KB Output is correct
12 Correct 522 ms 113928 KB Output is correct
13 Correct 373 ms 108952 KB Output is correct
14 Correct 267 ms 82040 KB Output is correct
15 Correct 634 ms 127136 KB Output is correct
16 Correct 457 ms 102520 KB Output is correct
17 Correct 555 ms 117092 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 376 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 372 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 4 ms 1104 KB Output is correct
28 Correct 4 ms 1312 KB Output is correct
29 Correct 4 ms 1104 KB Output is correct
30 Correct 5 ms 1616 KB Output is correct
31 Correct 3 ms 1228 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 204 ms 74412 KB Output is correct
34 Correct 260 ms 80772 KB Output is correct
35 Correct 399 ms 112804 KB Output is correct
36 Correct 246 ms 78476 KB Output is correct
37 Correct 491 ms 110872 KB Output is correct
38 Correct 349 ms 86300 KB Output is correct
39 Correct 0 ms 208 KB Output is correct
40 Correct 131 ms 43344 KB Output is correct
41 Correct 281 ms 74668 KB Output is correct
42 Correct 278 ms 100988 KB Output is correct
43 Correct 244 ms 74664 KB Output is correct
44 Correct 583 ms 124960 KB Output is correct
45 Correct 249 ms 90388 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 829 ms 63528 KB Output is correct
5 Correct 3984 ms 207292 KB Output is correct
6 Correct 1986 ms 81420 KB Output is correct
7 Correct 3891 ms 208464 KB Output is correct
8 Correct 1893 ms 97244 KB Output is correct
9 Correct 3784 ms 207060 KB Output is correct
10 Correct 987 ms 75812 KB Output is correct
11 Execution timed out 4120 ms 593428 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 829 ms 63528 KB Output is correct
5 Correct 3984 ms 207292 KB Output is correct
6 Correct 1986 ms 81420 KB Output is correct
7 Correct 3891 ms 208464 KB Output is correct
8 Correct 1893 ms 97244 KB Output is correct
9 Correct 3784 ms 207060 KB Output is correct
10 Correct 987 ms 75812 KB Output is correct
11 Execution timed out 4120 ms 593428 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 268 ms 60568 KB Output is correct
4 Correct 1098 ms 75788 KB Output is correct
5 Correct 777 ms 38300 KB Output is correct
6 Correct 1047 ms 75720 KB Output is correct
7 Correct 829 ms 52208 KB Output is correct
8 Correct 934 ms 75720 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 13 ms 1028 KB Output is correct
15 Correct 9 ms 720 KB Output is correct
16 Correct 12 ms 928 KB Output is correct
17 Correct 2 ms 464 KB Output is correct
18 Correct 9 ms 848 KB Output is correct
19 Correct 2 ms 336 KB Output is correct
20 Correct 11 ms 1360 KB Output is correct
21 Correct 10 ms 1212 KB Output is correct
22 Correct 9 ms 996 KB Output is correct
23 Correct 20 ms 1804 KB Output is correct
24 Correct 11 ms 1388 KB Output is correct
25 Correct 5 ms 720 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 9 ms 748 KB Output is correct
29 Correct 10 ms 992 KB Output is correct
30 Correct 9 ms 748 KB Output is correct
31 Correct 14 ms 1216 KB Output is correct
32 Correct 4 ms 348 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 2 ms 208 KB Output is correct
36 Correct 3 ms 464 KB Output is correct
37 Correct 5 ms 720 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 10 ms 1092 KB Output is correct
40 Correct 4 ms 336 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 2 ms 336 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 1 ms 256 KB Output is correct
50 Correct 0 ms 208 KB Output is correct
51 Correct 0 ms 208 KB Output is correct
52 Correct 2 ms 256 KB Output is correct
53 Correct 8 ms 976 KB Output is correct
54 Correct 5 ms 720 KB Output is correct
55 Correct 9 ms 944 KB Output is correct
56 Correct 3 ms 464 KB Output is correct
57 Correct 14 ms 976 KB Output is correct
58 Correct 2 ms 336 KB Output is correct
59 Correct 9 ms 1328 KB Output is correct
60 Correct 20 ms 1228 KB Output is correct
61 Correct 12 ms 968 KB Output is correct
62 Correct 19 ms 1760 KB Output is correct
63 Correct 13 ms 1348 KB Output is correct
64 Correct 7 ms 720 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 578 ms 40412 KB Output is correct
67 Correct 980 ms 63600 KB Output is correct
68 Correct 102 ms 7284 KB Output is correct
69 Correct 996 ms 64596 KB Output is correct
70 Correct 81 ms 4232 KB Output is correct
71 Correct 883 ms 62160 KB Output is correct
72 Correct 26 ms 976 KB Output is correct
73 Correct 937 ms 120452 KB Output is correct
74 Correct 1046 ms 124916 KB Output is correct
75 Correct 935 ms 63392 KB Output is correct
76 Correct 2116 ms 161300 KB Output is correct
77 Correct 1326 ms 117680 KB Output is correct
78 Correct 1070 ms 99248 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 7 ms 780 KB Output is correct
82 Correct 11 ms 956 KB Output is correct
83 Correct 9 ms 788 KB Output is correct
84 Correct 11 ms 1180 KB Output is correct
85 Correct 3 ms 336 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 3 ms 208 KB Output is correct
89 Correct 2 ms 336 KB Output is correct
90 Correct 8 ms 856 KB Output is correct
91 Correct 3 ms 512 KB Output is correct
92 Correct 8 ms 1104 KB Output is correct
93 Correct 3 ms 372 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 336 KB Output is correct
96 Correct 1 ms 336 KB Output is correct
97 Correct 1 ms 336 KB Output is correct
98 Correct 1 ms 384 KB Output is correct
99 Correct 1 ms 336 KB Output is correct
100 Correct 1 ms 384 KB Output is correct
101 Correct 1 ms 372 KB Output is correct
102 Correct 19 ms 1124 KB Output is correct
103 Correct 724 ms 42104 KB Output is correct
104 Correct 618 ms 67244 KB Output is correct
105 Correct 644 ms 43132 KB Output is correct
106 Correct 1069 ms 95140 KB Output is correct
107 Correct 130 ms 1104 KB Output is correct
108 Correct 1 ms 336 KB Output is correct
109 Correct 2 ms 592 KB Output is correct
110 Correct 44 ms 2496 KB Output is correct
111 Correct 255 ms 43892 KB Output is correct
112 Correct 36 ms 2584 KB Output is correct
113 Correct 724 ms 77416 KB Output is correct
114 Correct 19 ms 1104 KB Output is correct
115 Correct 1 ms 384 KB Output is correct
116 Correct 2 ms 628 KB Output is correct
117 Correct 3 ms 1104 KB Output is correct
118 Correct 3 ms 1360 KB Output is correct
119 Correct 3 ms 1164 KB Output is correct
120 Correct 5 ms 1664 KB Output is correct
121 Correct 3 ms 1232 KB Output is correct
122 Correct 1 ms 208 KB Output is correct
123 Correct 1 ms 208 KB Output is correct
124 Correct 0 ms 208 KB Output is correct
125 Correct 0 ms 208 KB Output is correct
126 Correct 197 ms 64408 KB Output is correct
127 Correct 361 ms 85180 KB Output is correct
128 Correct 89 ms 38352 KB Output is correct
129 Correct 312 ms 87844 KB Output is correct
130 Correct 52 ms 13344 KB Output is correct
131 Correct 228 ms 78744 KB Output is correct
132 Correct 192 ms 75768 KB Output is correct
133 Correct 522 ms 113928 KB Output is correct
134 Correct 373 ms 108952 KB Output is correct
135 Correct 267 ms 82040 KB Output is correct
136 Correct 634 ms 127136 KB Output is correct
137 Correct 457 ms 102520 KB Output is correct
138 Correct 555 ms 117092 KB Output is correct
139 Correct 0 ms 208 KB Output is correct
140 Correct 1 ms 336 KB Output is correct
141 Correct 1 ms 376 KB Output is correct
142 Correct 1 ms 336 KB Output is correct
143 Correct 1 ms 372 KB Output is correct
144 Correct 2 ms 336 KB Output is correct
145 Correct 1 ms 336 KB Output is correct
146 Correct 1 ms 336 KB Output is correct
147 Correct 2 ms 592 KB Output is correct
148 Correct 4 ms 1104 KB Output is correct
149 Correct 4 ms 1312 KB Output is correct
150 Correct 4 ms 1104 KB Output is correct
151 Correct 5 ms 1616 KB Output is correct
152 Correct 3 ms 1228 KB Output is correct
153 Correct 0 ms 208 KB Output is correct
154 Correct 204 ms 74412 KB Output is correct
155 Correct 260 ms 80772 KB Output is correct
156 Correct 399 ms 112804 KB Output is correct
157 Correct 246 ms 78476 KB Output is correct
158 Correct 491 ms 110872 KB Output is correct
159 Correct 349 ms 86300 KB Output is correct
160 Correct 0 ms 208 KB Output is correct
161 Correct 131 ms 43344 KB Output is correct
162 Correct 281 ms 74668 KB Output is correct
163 Correct 278 ms 100988 KB Output is correct
164 Correct 244 ms 74664 KB Output is correct
165 Correct 583 ms 124960 KB Output is correct
166 Correct 249 ms 90388 KB Output is correct
167 Correct 0 ms 208 KB Output is correct
168 Correct 1 ms 208 KB Output is correct
169 Correct 1 ms 208 KB Output is correct
170 Correct 829 ms 63528 KB Output is correct
171 Correct 3984 ms 207292 KB Output is correct
172 Correct 1986 ms 81420 KB Output is correct
173 Correct 3891 ms 208464 KB Output is correct
174 Correct 1893 ms 97244 KB Output is correct
175 Correct 3784 ms 207060 KB Output is correct
176 Correct 987 ms 75812 KB Output is correct
177 Execution timed out 4120 ms 593428 KB Time limit exceeded
178 Halted 0 ms 0 KB -