oj.uz

Submission #999717

# Submission time Handle Problem Language Result Execution time Memory
999717 2024-06-16T05:49:07 Z underwaterkillerwhale Painting Walls (APIO20_paint) C++17
51 / 100
 204 ms 318540 KB 
#include "paint.h"

#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N  = 2e5 + 7;
const int Mod = 998244353;
const int szBL = 916;
const int INF = 1e9;
const int BASE = 137;
int n, m, K;

vector<int> A, C;
vector<vector<int>> B;

namespace sub4 {
    const int N2 = 20000 + 2;
    const int M2 = 2000 + 2;
    int dp[N2][M2 * 2], f[N];
    bool ok[N2];

    vector<int> posC[N];

    struct Segment_Tree {
        int Range;
        int st[N << 2];

        void init (int n) {
            Range = n;
            rep (i, 1, n << 2) {
                st[i] = INF;
            }
        }

        void update (int id, int l, int r, int pos, int val) {
            if (l > pos || r < pos) return;
            if (l == r) {
                st[id] = val;
                return;
            }
            int mid = l + r >> 1;
            update (id << 1, l, mid, pos, val);
            update (id << 1 | 1, mid + 1, r, pos, val);
            st[id] = min(st[id << 1], st[id << 1 | 1]);
        }
        int get (int id, int l, int r, int u, int v) {
            if (l > v || r < u) return INF;
            if (l >= u && r <= v) return st[id];
            int mid = l + r >> 1;
            return min (get (id << 1, l, mid, u, v), get (id << 1 | 1, mid + 1, r, u, v));
        }

        void update (int pos, int val ) {
            update (1, 1, Range, pos, val);
        }
        int get (int u, int v) {
            return get (1, 1, Range, u, v);
        }
    }ST;

    int solution() {
        A.resize (2 * m);
        B.resize (2 * m);
        rep (i, m, 2 * m - 1) {
            A[i] = A[i - m];
            B[i] = B[i - m];
        }
        rep (i, 0, n - 1) posC[C[i]].push_back(i);
        rep (j, 0, 2 * m - 1) {
            iter (&col, B[j])
                iter (&pos, posC[col]) {
                dp[pos][j] = 1;
            }
        }
        reb (i, n - 1, 0) {
            reb (j, 2 * m - 1, 0) {
                if (dp[i][j] != 0) dp[i][j] = dp[i + 1][j + 1] + 1;
                if (dp[i][j] >= m) ok[i + 1] = 1;
            }
        }
        rep (i, 1, n) f[i] = INF;
        ST.init(n);
        f[m] = ok[1] ? 1 : INF;
        ST.update (m, f[m]);
        rep (i, 2, n - m + 1) {
            if (ok[i]) {
                f[i + m - 1] = ST.get (i - 1, i + m - 1) + 1;
                ST.update (i + m - 1, f[i + m - 1]);
            }
        }
        if (f[n] < INF) return f[n];
        else return -1;
    }
}


int minimumInstructions (int _n, int _m, int _K, vector<int> _C, vector<int> _A, vector<vector<int>> _B) {
//void solution() {
//    cin >> n >> m >> K;
    n = _n;
    m = _m;
    K = _K;
    C = _C;
    A = _A;
    B = _B;
//    C.resize(n);
//    rep (i, 0, n - 1) {
//        cin >> C[i];
//
//    }
//    A.resize (m);
//    B.resize (m);
//    rep (i, 0, m - 1) {
//        cin >> A[i];
//        B[i].resize (A[i]);
//        rep (j, 0, A[i] - 1) {
//            cin >> B[i][j];
//        }
//    }
//    if (n <= 20000 && m <= 2000)
    return sub4 :: solution();
//        cout << sub4 :: solution() <<"\n";
//    else sub5 :: solution();
}

//#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);
//int main () {
//    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
////    file ("c");
//    int num_Test = 1;
////    cin >> num_Test;
//    while (num_Test--)
//        solution();
//}
/*
8 3 5
3 3 1 3 4 4 2 2
3 0 1 2
2 2 3
2 3 4

5 4 4
1 0 1 2 2
2 0 1
1 1
1 2
1 3

*/

Compilation message

paint.cpp: In member function 'void sub4::Segment_Tree::update(int, int, int, int, int)':
paint.cpp:58:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |             int mid = l + r >> 1;
      |                       ~~^~~
paint.cpp: In member function 'int sub4::Segment_Tree::get(int, int, int, int, int)':
paint.cpp:66:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |             int mid = l + r >> 1;
      |                       ~~^~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8536 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 2 ms 11612 KB Output is correct
8 Correct 2 ms 13148 KB Output is correct
9 Correct 2 ms 11612 KB Output is correct
10 Correct 1 ms 13148 KB Output is correct
11 Correct 2 ms 13148 KB Output is correct
12 Correct 2 ms 13144 KB Output is correct
13 Correct 3 ms 13404 KB Output is correct
14 Correct 2 ms 13336 KB Output is correct
15 Correct 2 ms 11868 KB Output is correct
16 Correct 2 ms 13148 KB Output is correct
17 Correct 3 ms 13144 KB Output is correct
18 Correct 4 ms 13304 KB Output is correct
19 Correct 2 ms 10588 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 12632 KB Output is correct
22 Correct 9 ms 13404 KB Output is correct
23 Correct 9 ms 14684 KB Output is correct
24 Correct 11 ms 13404 KB Output is correct
25 Correct 32 ms 90988 KB Output is correct
26 Correct 34 ms 92508 KB Output is correct
27 Correct 31 ms 92376 KB Output is correct
28 Correct 31 ms 90960 KB Output is correct
29 Correct 30 ms 92756 KB Output is correct
30 Correct 31 ms 91216 KB Output is correct
31 Correct 184 ms 171784 KB Output is correct
32 Correct 162 ms 170836 KB Output is correct
33 Correct 159 ms 171856 KB Output is correct
34 Correct 159 ms 171888 KB Output is correct
35 Correct 164 ms 171860 KB Output is correct
36 Correct 167 ms 170832 KB Output is correct
37 Correct 176 ms 169704 KB Output is correct
38 Correct 173 ms 170216 KB Output is correct
39 Correct 162 ms 170320 KB Output is correct
40 Runtime error 191 ms 186200 KB Execution killed with signal 11
41 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8536 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 2 ms 11612 KB Output is correct
8 Correct 2 ms 13148 KB Output is correct
9 Correct 2 ms 11612 KB Output is correct
10 Correct 1 ms 13148 KB Output is correct
11 Correct 2 ms 13148 KB Output is correct
12 Correct 2 ms 13144 KB Output is correct
13 Correct 3 ms 13404 KB Output is correct
14 Correct 2 ms 13336 KB Output is correct
15 Correct 2 ms 11868 KB Output is correct
16 Correct 2 ms 13148 KB Output is correct
17 Correct 3 ms 13144 KB Output is correct
18 Correct 4 ms 13304 KB Output is correct
19 Correct 2 ms 10588 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 12632 KB Output is correct
22 Correct 1 ms 8552 KB Output is correct
23 Correct 1 ms 8552 KB Output is correct
24 Correct 1 ms 8552 KB Output is correct
25 Correct 1 ms 8552 KB Output is correct
26 Correct 1 ms 8552 KB Output is correct
27 Correct 2 ms 12648 KB Output is correct
28 Correct 2 ms 10856 KB Output is correct
29 Correct 2 ms 12648 KB Output is correct
30 Correct 2 ms 11112 KB Output is correct
31 Correct 2 ms 12904 KB Output is correct
32 Correct 2 ms 11112 KB Output is correct
33 Correct 2 ms 12904 KB Output is correct
34 Correct 2 ms 12904 KB Output is correct
35 Correct 2 ms 12648 KB Output is correct
36 Correct 2 ms 12648 KB Output is correct
37 Correct 2 ms 12648 KB Output is correct
38 Correct 2 ms 8552 KB Output is correct
39 Correct 1 ms 12648 KB Output is correct
40 Correct 2 ms 10600 KB Output is correct
41 Correct 2 ms 12648 KB Output is correct
42 Correct 2 ms 10600 KB Output is correct
43 Correct 2 ms 12648 KB Output is correct
44 Correct 2 ms 14696 KB Output is correct
45 Correct 2 ms 14796 KB Output is correct
46 Correct 2 ms 14696 KB Output is correct
47 Correct 2 ms 14696 KB Output is correct
48 Correct 2 ms 14696 KB Output is correct
49 Correct 2 ms 14696 KB Output is correct
50 Correct 3 ms 14696 KB Output is correct
51 Correct 2 ms 14696 KB Output is correct
52 Correct 2 ms 14696 KB Output is correct
53 Correct 2 ms 14696 KB Output is correct
54 Correct 2 ms 14696 KB Output is correct
55 Correct 2 ms 14692 KB Output is correct
56 Correct 2 ms 12648 KB Output is correct
57 Correct 2 ms 14696 KB Output is correct
58 Correct 2 ms 12648 KB Output is correct
59 Correct 2 ms 14696 KB Output is correct
60 Correct 2 ms 10600 KB Output is correct
61 Correct 2 ms 14696 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8552 KB Output is correct
2 Correct 1 ms 8552 KB Output is correct
3 Correct 1 ms 8536 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 2 ms 11612 KB Output is correct
10 Correct 2 ms 13148 KB Output is correct
11 Correct 2 ms 11612 KB Output is correct
12 Correct 1 ms 13148 KB Output is correct
13 Correct 2 ms 13148 KB Output is correct
14 Correct 2 ms 13144 KB Output is correct
15 Correct 3 ms 13404 KB Output is correct
16 Correct 2 ms 13336 KB Output is correct
17 Correct 2 ms 11868 KB Output is correct
18 Correct 2 ms 13148 KB Output is correct
19 Correct 3 ms 13144 KB Output is correct
20 Correct 4 ms 13304 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 12632 KB Output is correct
24 Correct 9 ms 13404 KB Output is correct
25 Correct 9 ms 14684 KB Output is correct
26 Correct 11 ms 13404 KB Output is correct
27 Correct 1 ms 8552 KB Output is correct
28 Correct 1 ms 8552 KB Output is correct
29 Correct 1 ms 8552 KB Output is correct
30 Correct 2 ms 12648 KB Output is correct
31 Correct 2 ms 10856 KB Output is correct
32 Correct 2 ms 12648 KB Output is correct
33 Correct 2 ms 11112 KB Output is correct
34 Correct 2 ms 12904 KB Output is correct
35 Correct 2 ms 11112 KB Output is correct
36 Correct 2 ms 12904 KB Output is correct
37 Correct 2 ms 12904 KB Output is correct
38 Correct 2 ms 12648 KB Output is correct
39 Correct 2 ms 12648 KB Output is correct
40 Correct 2 ms 12648 KB Output is correct
41 Correct 2 ms 8552 KB Output is correct
42 Correct 1 ms 12648 KB Output is correct
43 Correct 2 ms 10600 KB Output is correct
44 Correct 2 ms 12648 KB Output is correct
45 Correct 2 ms 10600 KB Output is correct
46 Correct 2 ms 12648 KB Output is correct
47 Correct 2 ms 14696 KB Output is correct
48 Correct 2 ms 14796 KB Output is correct
49 Correct 2 ms 14696 KB Output is correct
50 Correct 2 ms 14696 KB Output is correct
51 Correct 2 ms 14696 KB Output is correct
52 Correct 2 ms 14696 KB Output is correct
53 Correct 3 ms 14696 KB Output is correct
54 Correct 2 ms 14696 KB Output is correct
55 Correct 2 ms 14696 KB Output is correct
56 Correct 2 ms 14696 KB Output is correct
57 Correct 2 ms 14696 KB Output is correct
58 Correct 2 ms 14692 KB Output is correct
59 Correct 2 ms 12648 KB Output is correct
60 Correct 2 ms 14696 KB Output is correct
61 Correct 2 ms 12648 KB Output is correct
62 Correct 2 ms 14696 KB Output is correct
63 Correct 2 ms 10600 KB Output is correct
64 Correct 2 ms 14696 KB Output is correct
65 Correct 2 ms 12648 KB Output is correct
66 Correct 2 ms 14832 KB Output is correct
67 Correct 2 ms 14696 KB Output is correct
68 Correct 2 ms 14696 KB Output is correct
69 Correct 2 ms 14696 KB Output is correct
70 Correct 3 ms 14952 KB Output is correct
71 Correct 3 ms 14952 KB Output is correct
72 Correct 2 ms 14952 KB Output is correct
73 Correct 2 ms 14920 KB Output is correct
74 Correct 2 ms 12904 KB Output is correct
75 Correct 2 ms 12904 KB Output is correct
76 Correct 9 ms 14500 KB Output is correct
77 Correct 10 ms 14744 KB Output is correct
78 Correct 12 ms 14952 KB Output is correct
79 Correct 2 ms 14696 KB Output is correct
80 Correct 2 ms 14696 KB Output is correct
81 Correct 2 ms 14696 KB Output is correct
82 Correct 3 ms 14696 KB Output is correct
83 Correct 2 ms 14696 KB Output is correct
84 Correct 3 ms 14952 KB Output is correct
85 Correct 3 ms 14952 KB Output is correct
86 Correct 3 ms 14952 KB Output is correct
87 Correct 3 ms 14952 KB Output is correct
88 Correct 3 ms 14952 KB Output is correct
89 Correct 3 ms 14952 KB Output is correct
90 Correct 12 ms 17256 KB Output is correct
91 Correct 13 ms 17076 KB Output is correct
92 Correct 19 ms 17256 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8552 KB Output is correct
2 Correct 1 ms 8552 KB Output is correct
3 Correct 1 ms 8536 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 2 ms 11612 KB Output is correct
10 Correct 2 ms 13148 KB Output is correct
11 Correct 2 ms 11612 KB Output is correct
12 Correct 1 ms 13148 KB Output is correct
13 Correct 2 ms 13148 KB Output is correct
14 Correct 2 ms 13144 KB Output is correct
15 Correct 3 ms 13404 KB Output is correct
16 Correct 2 ms 13336 KB Output is correct
17 Correct 2 ms 11868 KB Output is correct
18 Correct 2 ms 13148 KB Output is correct
19 Correct 3 ms 13144 KB Output is correct
20 Correct 4 ms 13304 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 12632 KB Output is correct
24 Correct 9 ms 13404 KB Output is correct
25 Correct 9 ms 14684 KB Output is correct
26 Correct 11 ms 13404 KB Output is correct
27 Correct 32 ms 90988 KB Output is correct
28 Correct 34 ms 92508 KB Output is correct
29 Correct 31 ms 92376 KB Output is correct
30 Correct 31 ms 90960 KB Output is correct
31 Correct 30 ms 92756 KB Output is correct
32 Correct 31 ms 91216 KB Output is correct
33 Correct 184 ms 171784 KB Output is correct
34 Correct 162 ms 170836 KB Output is correct
35 Correct 159 ms 171856 KB Output is correct
36 Correct 159 ms 171888 KB Output is correct
37 Correct 164 ms 171860 KB Output is correct
38 Correct 167 ms 170832 KB Output is correct
39 Correct 176 ms 169704 KB Output is correct
40 Correct 173 ms 170216 KB Output is correct
41 Correct 162 ms 170320 KB Output is correct
42 Correct 1 ms 8552 KB Output is correct
43 Correct 1 ms 8552 KB Output is correct
44 Correct 1 ms 8552 KB Output is correct
45 Correct 2 ms 12648 KB Output is correct
46 Correct 2 ms 10856 KB Output is correct
47 Correct 2 ms 12648 KB Output is correct
48 Correct 2 ms 11112 KB Output is correct
49 Correct 2 ms 12904 KB Output is correct
50 Correct 2 ms 11112 KB Output is correct
51 Correct 2 ms 12904 KB Output is correct
52 Correct 2 ms 12904 KB Output is correct
53 Correct 2 ms 12648 KB Output is correct
54 Correct 2 ms 12648 KB Output is correct
55 Correct 2 ms 12648 KB Output is correct
56 Correct 2 ms 8552 KB Output is correct
57 Correct 1 ms 12648 KB Output is correct
58 Correct 2 ms 10600 KB Output is correct
59 Correct 2 ms 12648 KB Output is correct
60 Correct 2 ms 10600 KB Output is correct
61 Correct 2 ms 12648 KB Output is correct
62 Correct 2 ms 14696 KB Output is correct
63 Correct 2 ms 14796 KB Output is correct
64 Correct 2 ms 14696 KB Output is correct
65 Correct 2 ms 14696 KB Output is correct
66 Correct 2 ms 14696 KB Output is correct
67 Correct 2 ms 14696 KB Output is correct
68 Correct 3 ms 14696 KB Output is correct
69 Correct 2 ms 14696 KB Output is correct
70 Correct 2 ms 14696 KB Output is correct
71 Correct 2 ms 14696 KB Output is correct
72 Correct 2 ms 14696 KB Output is correct
73 Correct 2 ms 14692 KB Output is correct
74 Correct 2 ms 12648 KB Output is correct
75 Correct 2 ms 14696 KB Output is correct
76 Correct 2 ms 12648 KB Output is correct
77 Correct 2 ms 14696 KB Output is correct
78 Correct 2 ms 10600 KB Output is correct
79 Correct 2 ms 14696 KB Output is correct
80 Correct 2 ms 12648 KB Output is correct
81 Correct 2 ms 14832 KB Output is correct
82 Correct 2 ms 14696 KB Output is correct
83 Correct 2 ms 14696 KB Output is correct
84 Correct 2 ms 14696 KB Output is correct
85 Correct 3 ms 14952 KB Output is correct
86 Correct 3 ms 14952 KB Output is correct
87 Correct 2 ms 14952 KB Output is correct
88 Correct 2 ms 14920 KB Output is correct
89 Correct 2 ms 12904 KB Output is correct
90 Correct 2 ms 12904 KB Output is correct
91 Correct 9 ms 14500 KB Output is correct
92 Correct 10 ms 14744 KB Output is correct
93 Correct 12 ms 14952 KB Output is correct
94 Correct 2 ms 14696 KB Output is correct
95 Correct 2 ms 14696 KB Output is correct
96 Correct 2 ms 14696 KB Output is correct
97 Correct 3 ms 14696 KB Output is correct
98 Correct 2 ms 14696 KB Output is correct
99 Correct 3 ms 14952 KB Output is correct
100 Correct 3 ms 14952 KB Output is correct
101 Correct 3 ms 14952 KB Output is correct
102 Correct 3 ms 14952 KB Output is correct
103 Correct 3 ms 14952 KB Output is correct
104 Correct 3 ms 14952 KB Output is correct
105 Correct 12 ms 17256 KB Output is correct
106 Correct 13 ms 17076 KB Output is correct
107 Correct 19 ms 17256 KB Output is correct
108 Correct 32 ms 96612 KB Output is correct
109 Correct 126 ms 141048 KB Output is correct
110 Correct 98 ms 123488 KB Output is correct
111 Correct 93 ms 119136 KB Output is correct
112 Correct 140 ms 161460 KB Output is correct
113 Correct 91 ms 133708 KB Output is correct
114 Correct 78 ms 128596 KB Output is correct
115 Correct 28 ms 62296 KB Output is correct
116 Correct 108 ms 172276 KB Output is correct
117 Correct 61 ms 106900 KB Output is correct
118 Correct 36 ms 75612 KB Output is correct
119 Correct 120 ms 191824 KB Output is correct
120 Correct 99 ms 110780 KB Output is correct
121 Correct 104 ms 142168 KB Output is correct
122 Correct 54 ms 86668 KB Output is correct
123 Correct 50 ms 92244 KB Output is correct
124 Correct 55 ms 90776 KB Output is correct
125 Correct 52 ms 106320 KB Output is correct
126 Correct 32 ms 80720 KB Output is correct
127 Correct 93 ms 136016 KB Output is correct
128 Correct 35 ms 80468 KB Output is correct
129 Correct 40 ms 85328 KB Output is correct
130 Correct 33 ms 98648 KB Output is correct
131 Correct 185 ms 191804 KB Output is correct
132 Correct 188 ms 217424 KB Output is correct
133 Correct 197 ms 233556 KB Output is correct
134 Correct 191 ms 245260 KB Output is correct
135 Correct 201 ms 256848 KB Output is correct
136 Correct 204 ms 318540 KB Output is correct
137 Correct 198 ms 299760 KB Output is correct
138 Correct 199 ms 307792 KB Output is correct
139 Correct 198 ms 300160 KB Output is correct
140 Correct 195 ms 306512 KB Output is correct
141 Correct 198 ms 314448 KB Output is correct
142 Correct 195 ms 192084 KB Output is correct
143 Correct 190 ms 233040 KB Output is correct
144 Correct 182 ms 188732 KB Output is correct
145 Correct 187 ms 233916 KB Output is correct
146 Correct 185 ms 189264 KB Output is correct
147 Correct 180 ms 232792 KB Output is correct
148 Correct 181 ms 201296 KB Output is correct
149 Correct 143 ms 187112 KB Output is correct
150 Correct 98 ms 154676 KB Output is correct
151 Correct 78 ms 140112 KB Output is correct

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8552 KB Output is correct
2 Correct 1 ms 8552 KB Output is correct
3 Correct 1 ms 8536 KB Output is correct
4 Correct 1 ms 8536 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 2 ms 11612 KB Output is correct
10 Correct 2 ms 13148 KB Output is correct
11 Correct 2 ms 11612 KB Output is correct
12 Correct 1 ms 13148 KB Output is correct
13 Correct 2 ms 13148 KB Output is correct
14 Correct 2 ms 13144 KB Output is correct
15 Correct 3 ms 13404 KB Output is correct
16 Correct 2 ms 13336 KB Output is correct
17 Correct 2 ms 11868 KB Output is correct
18 Correct 2 ms 13148 KB Output is correct
19 Correct 3 ms 13144 KB Output is correct
20 Correct 4 ms 13304 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 12632 KB Output is correct
24 Correct 9 ms 13404 KB Output is correct
25 Correct 9 ms 14684 KB Output is correct
26 Correct 11 ms 13404 KB Output is correct
27 Correct 32 ms 90988 KB Output is correct
28 Correct 34 ms 92508 KB Output is correct
29 Correct 31 ms 92376 KB Output is correct
30 Correct 31 ms 90960 KB Output is correct
31 Correct 30 ms 92756 KB Output is correct
32 Correct 31 ms 91216 KB Output is correct
33 Correct 184 ms 171784 KB Output is correct
34 Correct 162 ms 170836 KB Output is correct
35 Correct 159 ms 171856 KB Output is correct
36 Correct 159 ms 171888 KB Output is correct
37 Correct 164 ms 171860 KB Output is correct
38 Correct 167 ms 170832 KB Output is correct
39 Correct 176 ms 169704 KB Output is correct
40 Correct 173 ms 170216 KB Output is correct
41 Correct 162 ms 170320 KB Output is correct
42 Runtime error 191 ms 186200 KB Execution killed with signal 11
43 Halted 0 ms 0 KB -