oj.uz

Submission #922120

# Submission time Handle Problem Language Result Execution time Memory
922120 2024-02-05T05:57:02 Z 406 Food Court (JOI21_foodcourt) C++17
100 / 100
 422 ms 56476 KB 
    #include <bits/stdc++.h>
    using namespace std;
    //#define int long long
    using ll = long long;
    #define FOR(i, a, b) for (int i = (a); i < (b); i++) 
    const int64_t INF = 1ll << 60;
    const int N = 2.6e5;
    const int LG = 17;
    long long B[N], mn[N << 2], delta[N << 2];
    vector<array<int, 2>> ad[N], del[N];
    vector<array<ll, 2>> GET[N];
    short t[N];
    int L[N], R[N], C[N], A[N], n, m, q, ans[N], K[N];
     
    struct fenw {
            long long bit[N];
            void add(int r, int d) {
                    r++;
                    for (; r < N; r += r & -r)
                            bit[r] += d;
            }
            long long get(int r) {
                    r++;
                    long long re = 0;
                    for (; r; r &= (r - 1)) 
                            re += bit[r];
                    return re;
            }
            int find(long long x) {
                    int pos = 0;
                    for (int i = LG; i >= 0; i--) {
                            if ((pos | (1 << i)) < N && bit[pos | (1 << i)] < x) {
                                    pos |= 1 << i;
                                    x -= bit[pos];
                            }
                    }
                    return pos;
            }
    } pos, all;
     
    void add(int v, int l, int r, int L, int R, int d) {
            if (L <= l && r <= R) {
                    mn[v] += d;
                    delta[v] += d;
                    return;
            }
            int m = l + r >> 1;
            if (R <= m)
                    add(v << 1, l, m, L, R, d);
            else if (L >= m)
                    add(v << 1 | 1, m, r, L, R, d);
            else {
                    add(v << 1, l, m, L, R, d);
                    add(v << 1 | 1, m, r, L, R, d);
            }
            mn[v] = min(mn[v << 1], mn[v << 1 | 1]) + delta[v];
    }
    ll get(int v, int l, int r, int L, int R) {
            if (L <= l && r <= R) return mn[v];
            int m = l + r >> 1;
            if (R <= m)
                    return get(v << 1, l, m, L, R) + delta[v];
            else if (L >= m)
                    return get(v << 1 | 1, m, r, L, R) + delta[v];
            else 
                    return min(get(v << 1, l, m, L, R), get(v << 1 | 1, m, r, L, R)) + delta[v];
    }
     
    signed main() {
            ios::sync_with_stdio(0), cin.tie(0);
            cin >> n >> m >> q;
            FOR(i, 0, q) {
                    cin >> t[i];
                    if (t[i] == 1) {
                            cin >> L[i] >> R[i] >> C[i] >> K[i];
                            --L[i];
                            --R[i];
                            ad[L[i]].push_back({i, K[i]});
                            ad[R[i] + 1].push_back({i, -K[i]});
                    }
                    else if (t[i] == 2) {
                            cin >> L[i] >> R[i] >> K[i];
                            --L[i];
                            --R[i];
                            del[L[i]].push_back({i, K[i]});
                            del[R[i] + 1].push_back({i, -K[i]});
                    }
                    else {
                            cin >> A[i] >> B[i];
                            A[i]--;
                            GET[A[i]].push_back({B[i], i});
                    }
            }
            FOR(i, 0, n) {
                    for (auto [i, K]: del[i]) {
                            all.add(i, -K);
                            add(1, 0, q, i, q, -K);
                    }
                    for (auto [i, K]: ad[i]) {
                            pos.add(i, K);
                            all.add(i, K);
                            add(1, 0, q, i, q, K);
                    }
                    for (auto P: GET[i]) {
                            ll b = P[0];
                            int i = P[1];
                            ll all_pos = pos.get(i), mn = get(1, 0, q, 0, i + 1), sz = all.get(i) - (mn < 0 ? mn : 0);
                            b += all_pos - sz;
                            ans[i] = (b <= all_pos ? pos.find(b) : N);
                    }
            }
            FOR(i, 0, q) if (t[i] == 3)
                   cout << (ans[i] == N ? 0 : C[ans[i]]) << '\n'; 
    }
    //06:22:05

Compilation message

foodcourt.cpp: In function 'void add(int, int, int, int, int, int)':
foodcourt.cpp:47:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 |             int m = l + r >> 1;
      |                     ~~^~~
foodcourt.cpp: In function 'll get(int, int, int, int, int)':
foodcourt.cpp:60:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |             int m = l + r >> 1;
      |                     ~~^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19032 KB Output is correct
2 Correct 13 ms 19036 KB Output is correct
3 Correct 11 ms 19056 KB Output is correct
4 Correct 11 ms 19036 KB Output is correct
5 Correct 11 ms 19036 KB Output is correct
6 Correct 11 ms 19100 KB Output is correct
7 Correct 11 ms 19160 KB Output is correct
8 Correct 11 ms 19032 KB Output is correct
9 Correct 11 ms 19036 KB Output is correct
10 Correct 11 ms 19036 KB Output is correct
11 Correct 12 ms 19176 KB Output is correct
12 Correct 11 ms 19032 KB Output is correct
13 Correct 11 ms 19036 KB Output is correct
14 Correct 12 ms 18952 KB Output is correct
15 Correct 10 ms 19036 KB Output is correct
16 Correct 11 ms 19036 KB Output is correct
17 Correct 11 ms 19036 KB Output is correct
18 Correct 12 ms 19036 KB Output is correct
19 Correct 11 ms 19036 KB Output is correct
20 Correct 11 ms 19036 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19032 KB Output is correct
2 Correct 13 ms 19036 KB Output is correct
3 Correct 11 ms 19056 KB Output is correct
4 Correct 11 ms 19036 KB Output is correct
5 Correct 11 ms 19036 KB Output is correct
6 Correct 11 ms 19100 KB Output is correct
7 Correct 11 ms 19160 KB Output is correct
8 Correct 11 ms 19032 KB Output is correct
9 Correct 11 ms 19036 KB Output is correct
10 Correct 11 ms 19036 KB Output is correct
11 Correct 12 ms 19176 KB Output is correct
12 Correct 11 ms 19032 KB Output is correct
13 Correct 11 ms 19036 KB Output is correct
14 Correct 12 ms 18952 KB Output is correct
15 Correct 10 ms 19036 KB Output is correct
16 Correct 11 ms 19036 KB Output is correct
17 Correct 11 ms 19036 KB Output is correct
18 Correct 12 ms 19036 KB Output is correct
19 Correct 11 ms 19036 KB Output is correct
20 Correct 11 ms 19036 KB Output is correct
21 Correct 10 ms 19036 KB Output is correct
22 Correct 11 ms 19036 KB Output is correct
23 Correct 12 ms 19036 KB Output is correct
24 Correct 12 ms 19036 KB Output is correct
25 Correct 11 ms 19036 KB Output is correct
26 Correct 10 ms 19032 KB Output is correct
27 Correct 11 ms 19036 KB Output is correct
28 Correct 12 ms 19184 KB Output is correct
29 Correct 11 ms 19036 KB Output is correct
30 Correct 11 ms 19200 KB Output is correct
31 Correct 11 ms 19036 KB Output is correct
32 Correct 11 ms 19184 KB Output is correct
33 Correct 11 ms 19036 KB Output is correct
34 Correct 11 ms 19032 KB Output is correct
35 Correct 11 ms 19036 KB Output is correct
36 Correct 11 ms 19032 KB Output is correct
37 Correct 11 ms 18880 KB Output is correct
38 Correct 11 ms 19036 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 27988 KB Output is correct
2 Correct 62 ms 28004 KB Output is correct
3 Correct 62 ms 27984 KB Output is correct
4 Correct 58 ms 27948 KB Output is correct
5 Correct 63 ms 27984 KB Output is correct
6 Correct 60 ms 27984 KB Output is correct
7 Correct 34 ms 25924 KB Output is correct
8 Correct 36 ms 25980 KB Output is correct
9 Correct 62 ms 27732 KB Output is correct
10 Correct 58 ms 27992 KB Output is correct
11 Correct 60 ms 27984 KB Output is correct
12 Correct 60 ms 28024 KB Output is correct
13 Correct 50 ms 26896 KB Output is correct
14 Correct 58 ms 27728 KB Output is correct
15 Correct 57 ms 27228 KB Output is correct
16 Correct 62 ms 27592 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 53060 KB Output is correct
2 Correct 255 ms 47944 KB Output is correct
3 Correct 331 ms 55632 KB Output is correct
4 Correct 247 ms 48292 KB Output is correct
5 Correct 230 ms 48220 KB Output is correct
6 Correct 339 ms 55564 KB Output is correct
7 Correct 112 ms 48804 KB Output is correct
8 Correct 119 ms 47808 KB Output is correct
9 Correct 324 ms 54288 KB Output is correct
10 Correct 302 ms 54400 KB Output is correct
11 Correct 321 ms 54356 KB Output is correct
12 Correct 334 ms 55636 KB Output is correct
13 Correct 319 ms 54352 KB Output is correct
14 Correct 326 ms 55580 KB Output is correct
15 Correct 342 ms 55624 KB Output is correct
16 Correct 330 ms 55420 KB Output is correct
17 Correct 331 ms 55804 KB Output is correct
18 Correct 317 ms 54884 KB Output is correct
19 Correct 344 ms 55620 KB Output is correct
20 Correct 327 ms 55124 KB Output is correct
21 Correct 349 ms 55580 KB Output is correct
22 Correct 328 ms 55668 KB Output is correct
23 Correct 356 ms 55556 KB Output is correct
24 Correct 330 ms 55632 KB Output is correct
25 Correct 233 ms 51536 KB Output is correct
26 Correct 246 ms 51952 KB Output is correct
27 Correct 254 ms 52300 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19032 KB Output is correct
2 Correct 13 ms 19036 KB Output is correct
3 Correct 11 ms 19056 KB Output is correct
4 Correct 11 ms 19036 KB Output is correct
5 Correct 11 ms 19036 KB Output is correct
6 Correct 11 ms 19100 KB Output is correct
7 Correct 11 ms 19160 KB Output is correct
8 Correct 11 ms 19032 KB Output is correct
9 Correct 11 ms 19036 KB Output is correct
10 Correct 11 ms 19036 KB Output is correct
11 Correct 12 ms 19176 KB Output is correct
12 Correct 11 ms 19032 KB Output is correct
13 Correct 11 ms 19036 KB Output is correct
14 Correct 12 ms 18952 KB Output is correct
15 Correct 10 ms 19036 KB Output is correct
16 Correct 11 ms 19036 KB Output is correct
17 Correct 11 ms 19036 KB Output is correct
18 Correct 12 ms 19036 KB Output is correct
19 Correct 11 ms 19036 KB Output is correct
20 Correct 11 ms 19036 KB Output is correct
21 Correct 64 ms 27988 KB Output is correct
22 Correct 62 ms 28004 KB Output is correct
23 Correct 62 ms 27984 KB Output is correct
24 Correct 58 ms 27948 KB Output is correct
25 Correct 63 ms 27984 KB Output is correct
26 Correct 60 ms 27984 KB Output is correct
27 Correct 34 ms 25924 KB Output is correct
28 Correct 36 ms 25980 KB Output is correct
29 Correct 62 ms 27732 KB Output is correct
30 Correct 58 ms 27992 KB Output is correct
31 Correct 60 ms 27984 KB Output is correct
32 Correct 60 ms 28024 KB Output is correct
33 Correct 50 ms 26896 KB Output is correct
34 Correct 58 ms 27728 KB Output is correct
35 Correct 57 ms 27228 KB Output is correct
36 Correct 62 ms 27592 KB Output is correct
37 Correct 52 ms 26960 KB Output is correct
38 Correct 50 ms 26756 KB Output is correct
39 Correct 30 ms 25000 KB Output is correct
40 Correct 35 ms 25492 KB Output is correct
41 Correct 60 ms 27472 KB Output is correct
42 Correct 62 ms 27840 KB Output is correct
43 Correct 59 ms 27732 KB Output is correct
44 Correct 60 ms 27740 KB Output is correct
45 Correct 62 ms 27836 KB Output is correct
46 Correct 63 ms 27816 KB Output is correct
47 Correct 39 ms 26308 KB Output is correct
48 Correct 51 ms 26960 KB Output is correct
49 Correct 52 ms 25816 KB Output is correct
50 Correct 53 ms 26716 KB Output is correct
51 Correct 84 ms 27988 KB Output is correct
52 Correct 72 ms 27864 KB Output is correct
53 Correct 55 ms 26248 KB Output is correct
54 Correct 63 ms 27632 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 27216 KB Output is correct
2 Correct 66 ms 27836 KB Output is correct
3 Correct 68 ms 28104 KB Output is correct
4 Correct 47 ms 25936 KB Output is correct
5 Correct 56 ms 26964 KB Output is correct
6 Correct 65 ms 28120 KB Output is correct
7 Correct 37 ms 26084 KB Output is correct
8 Correct 40 ms 25800 KB Output is correct
9 Correct 53 ms 27132 KB Output is correct
10 Correct 45 ms 25432 KB Output is correct
11 Correct 63 ms 27368 KB Output is correct
12 Correct 57 ms 27336 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19032 KB Output is correct
2 Correct 13 ms 19036 KB Output is correct
3 Correct 11 ms 19056 KB Output is correct
4 Correct 11 ms 19036 KB Output is correct
5 Correct 11 ms 19036 KB Output is correct
6 Correct 11 ms 19100 KB Output is correct
7 Correct 11 ms 19160 KB Output is correct
8 Correct 11 ms 19032 KB Output is correct
9 Correct 11 ms 19036 KB Output is correct
10 Correct 11 ms 19036 KB Output is correct
11 Correct 12 ms 19176 KB Output is correct
12 Correct 11 ms 19032 KB Output is correct
13 Correct 11 ms 19036 KB Output is correct
14 Correct 12 ms 18952 KB Output is correct
15 Correct 10 ms 19036 KB Output is correct
16 Correct 11 ms 19036 KB Output is correct
17 Correct 11 ms 19036 KB Output is correct
18 Correct 12 ms 19036 KB Output is correct
19 Correct 11 ms 19036 KB Output is correct
20 Correct 11 ms 19036 KB Output is correct
21 Correct 10 ms 19036 KB Output is correct
22 Correct 11 ms 19036 KB Output is correct
23 Correct 12 ms 19036 KB Output is correct
24 Correct 12 ms 19036 KB Output is correct
25 Correct 11 ms 19036 KB Output is correct
26 Correct 10 ms 19032 KB Output is correct
27 Correct 11 ms 19036 KB Output is correct
28 Correct 12 ms 19184 KB Output is correct
29 Correct 11 ms 19036 KB Output is correct
30 Correct 11 ms 19200 KB Output is correct
31 Correct 11 ms 19036 KB Output is correct
32 Correct 11 ms 19184 KB Output is correct
33 Correct 11 ms 19036 KB Output is correct
34 Correct 11 ms 19032 KB Output is correct
35 Correct 11 ms 19036 KB Output is correct
36 Correct 11 ms 19032 KB Output is correct
37 Correct 11 ms 18880 KB Output is correct
38 Correct 11 ms 19036 KB Output is correct
39 Correct 64 ms 27988 KB Output is correct
40 Correct 62 ms 28004 KB Output is correct
41 Correct 62 ms 27984 KB Output is correct
42 Correct 58 ms 27948 KB Output is correct
43 Correct 63 ms 27984 KB Output is correct
44 Correct 60 ms 27984 KB Output is correct
45 Correct 34 ms 25924 KB Output is correct
46 Correct 36 ms 25980 KB Output is correct
47 Correct 62 ms 27732 KB Output is correct
48 Correct 58 ms 27992 KB Output is correct
49 Correct 60 ms 27984 KB Output is correct
50 Correct 60 ms 28024 KB Output is correct
51 Correct 50 ms 26896 KB Output is correct
52 Correct 58 ms 27728 KB Output is correct
53 Correct 57 ms 27228 KB Output is correct
54 Correct 62 ms 27592 KB Output is correct
55 Correct 52 ms 26960 KB Output is correct
56 Correct 50 ms 26756 KB Output is correct
57 Correct 30 ms 25000 KB Output is correct
58 Correct 35 ms 25492 KB Output is correct
59 Correct 60 ms 27472 KB Output is correct
60 Correct 62 ms 27840 KB Output is correct
61 Correct 59 ms 27732 KB Output is correct
62 Correct 60 ms 27740 KB Output is correct
63 Correct 62 ms 27836 KB Output is correct
64 Correct 63 ms 27816 KB Output is correct
65 Correct 39 ms 26308 KB Output is correct
66 Correct 51 ms 26960 KB Output is correct
67 Correct 52 ms 25816 KB Output is correct
68 Correct 53 ms 26716 KB Output is correct
69 Correct 84 ms 27988 KB Output is correct
70 Correct 72 ms 27864 KB Output is correct
71 Correct 55 ms 26248 KB Output is correct
72 Correct 63 ms 27632 KB Output is correct
73 Correct 57 ms 27216 KB Output is correct
74 Correct 66 ms 27836 KB Output is correct
75 Correct 68 ms 28104 KB Output is correct
76 Correct 47 ms 25936 KB Output is correct
77 Correct 56 ms 26964 KB Output is correct
78 Correct 65 ms 28120 KB Output is correct
79 Correct 37 ms 26084 KB Output is correct
80 Correct 40 ms 25800 KB Output is correct
81 Correct 53 ms 27132 KB Output is correct
82 Correct 45 ms 25432 KB Output is correct
83 Correct 63 ms 27368 KB Output is correct
84 Correct 57 ms 27336 KB Output is correct
85 Correct 60 ms 27580 KB Output is correct
86 Correct 65 ms 28320 KB Output is correct
87 Correct 62 ms 27472 KB Output is correct
88 Correct 69 ms 28408 KB Output is correct
89 Correct 47 ms 25684 KB Output is correct
90 Correct 67 ms 28192 KB Output is correct
91 Correct 55 ms 26968 KB Output is correct
92 Correct 58 ms 26704 KB Output is correct
93 Correct 69 ms 28336 KB Output is correct
94 Correct 66 ms 28032 KB Output is correct
95 Correct 68 ms 28148 KB Output is correct
96 Correct 71 ms 28340 KB Output is correct
97 Correct 68 ms 28240 KB Output is correct
98 Correct 56 ms 27184 KB Output is correct
99 Correct 46 ms 27336 KB Output is correct
100 Correct 50 ms 26196 KB Output is correct
101 Correct 56 ms 27472 KB Output is correct
102 Correct 62 ms 27472 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19032 KB Output is correct
2 Correct 13 ms 19036 KB Output is correct
3 Correct 11 ms 19056 KB Output is correct
4 Correct 11 ms 19036 KB Output is correct
5 Correct 11 ms 19036 KB Output is correct
6 Correct 11 ms 19100 KB Output is correct
7 Correct 11 ms 19160 KB Output is correct
8 Correct 11 ms 19032 KB Output is correct
9 Correct 11 ms 19036 KB Output is correct
10 Correct 11 ms 19036 KB Output is correct
11 Correct 12 ms 19176 KB Output is correct
12 Correct 11 ms 19032 KB Output is correct
13 Correct 11 ms 19036 KB Output is correct
14 Correct 12 ms 18952 KB Output is correct
15 Correct 10 ms 19036 KB Output is correct
16 Correct 11 ms 19036 KB Output is correct
17 Correct 11 ms 19036 KB Output is correct
18 Correct 12 ms 19036 KB Output is correct
19 Correct 11 ms 19036 KB Output is correct
20 Correct 11 ms 19036 KB Output is correct
21 Correct 10 ms 19036 KB Output is correct
22 Correct 11 ms 19036 KB Output is correct
23 Correct 12 ms 19036 KB Output is correct
24 Correct 12 ms 19036 KB Output is correct
25 Correct 11 ms 19036 KB Output is correct
26 Correct 10 ms 19032 KB Output is correct
27 Correct 11 ms 19036 KB Output is correct
28 Correct 12 ms 19184 KB Output is correct
29 Correct 11 ms 19036 KB Output is correct
30 Correct 11 ms 19200 KB Output is correct
31 Correct 11 ms 19036 KB Output is correct
32 Correct 11 ms 19184 KB Output is correct
33 Correct 11 ms 19036 KB Output is correct
34 Correct 11 ms 19032 KB Output is correct
35 Correct 11 ms 19036 KB Output is correct
36 Correct 11 ms 19032 KB Output is correct
37 Correct 11 ms 18880 KB Output is correct
38 Correct 11 ms 19036 KB Output is correct
39 Correct 64 ms 27988 KB Output is correct
40 Correct 62 ms 28004 KB Output is correct
41 Correct 62 ms 27984 KB Output is correct
42 Correct 58 ms 27948 KB Output is correct
43 Correct 63 ms 27984 KB Output is correct
44 Correct 60 ms 27984 KB Output is correct
45 Correct 34 ms 25924 KB Output is correct
46 Correct 36 ms 25980 KB Output is correct
47 Correct 62 ms 27732 KB Output is correct
48 Correct 58 ms 27992 KB Output is correct
49 Correct 60 ms 27984 KB Output is correct
50 Correct 60 ms 28024 KB Output is correct
51 Correct 50 ms 26896 KB Output is correct
52 Correct 58 ms 27728 KB Output is correct
53 Correct 57 ms 27228 KB Output is correct
54 Correct 62 ms 27592 KB Output is correct
55 Correct 294 ms 53060 KB Output is correct
56 Correct 255 ms 47944 KB Output is correct
57 Correct 331 ms 55632 KB Output is correct
58 Correct 247 ms 48292 KB Output is correct
59 Correct 230 ms 48220 KB Output is correct
60 Correct 339 ms 55564 KB Output is correct
61 Correct 112 ms 48804 KB Output is correct
62 Correct 119 ms 47808 KB Output is correct
63 Correct 324 ms 54288 KB Output is correct
64 Correct 302 ms 54400 KB Output is correct
65 Correct 321 ms 54356 KB Output is correct
66 Correct 334 ms 55636 KB Output is correct
67 Correct 319 ms 54352 KB Output is correct
68 Correct 326 ms 55580 KB Output is correct
69 Correct 342 ms 55624 KB Output is correct
70 Correct 330 ms 55420 KB Output is correct
71 Correct 331 ms 55804 KB Output is correct
72 Correct 317 ms 54884 KB Output is correct
73 Correct 344 ms 55620 KB Output is correct
74 Correct 327 ms 55124 KB Output is correct
75 Correct 349 ms 55580 KB Output is correct
76 Correct 328 ms 55668 KB Output is correct
77 Correct 356 ms 55556 KB Output is correct
78 Correct 330 ms 55632 KB Output is correct
79 Correct 233 ms 51536 KB Output is correct
80 Correct 246 ms 51952 KB Output is correct
81 Correct 254 ms 52300 KB Output is correct
82 Correct 52 ms 26960 KB Output is correct
83 Correct 50 ms 26756 KB Output is correct
84 Correct 30 ms 25000 KB Output is correct
85 Correct 35 ms 25492 KB Output is correct
86 Correct 60 ms 27472 KB Output is correct
87 Correct 62 ms 27840 KB Output is correct
88 Correct 59 ms 27732 KB Output is correct
89 Correct 60 ms 27740 KB Output is correct
90 Correct 62 ms 27836 KB Output is correct
91 Correct 63 ms 27816 KB Output is correct
92 Correct 39 ms 26308 KB Output is correct
93 Correct 51 ms 26960 KB Output is correct
94 Correct 52 ms 25816 KB Output is correct
95 Correct 53 ms 26716 KB Output is correct
96 Correct 84 ms 27988 KB Output is correct
97 Correct 72 ms 27864 KB Output is correct
98 Correct 55 ms 26248 KB Output is correct
99 Correct 63 ms 27632 KB Output is correct
100 Correct 57 ms 27216 KB Output is correct
101 Correct 66 ms 27836 KB Output is correct
102 Correct 68 ms 28104 KB Output is correct
103 Correct 47 ms 25936 KB Output is correct
104 Correct 56 ms 26964 KB Output is correct
105 Correct 65 ms 28120 KB Output is correct
106 Correct 37 ms 26084 KB Output is correct
107 Correct 40 ms 25800 KB Output is correct
108 Correct 53 ms 27132 KB Output is correct
109 Correct 45 ms 25432 KB Output is correct
110 Correct 63 ms 27368 KB Output is correct
111 Correct 57 ms 27336 KB Output is correct
112 Correct 60 ms 27580 KB Output is correct
113 Correct 65 ms 28320 KB Output is correct
114 Correct 62 ms 27472 KB Output is correct
115 Correct 69 ms 28408 KB Output is correct
116 Correct 47 ms 25684 KB Output is correct
117 Correct 67 ms 28192 KB Output is correct
118 Correct 55 ms 26968 KB Output is correct
119 Correct 58 ms 26704 KB Output is correct
120 Correct 69 ms 28336 KB Output is correct
121 Correct 66 ms 28032 KB Output is correct
122 Correct 68 ms 28148 KB Output is correct
123 Correct 71 ms 28340 KB Output is correct
124 Correct 68 ms 28240 KB Output is correct
125 Correct 56 ms 27184 KB Output is correct
126 Correct 46 ms 27336 KB Output is correct
127 Correct 50 ms 26196 KB Output is correct
128 Correct 56 ms 27472 KB Output is correct
129 Correct 62 ms 27472 KB Output is correct
130 Correct 422 ms 56060 KB Output is correct
131 Correct 241 ms 48268 KB Output is correct
132 Correct 335 ms 56148 KB Output is correct
133 Correct 325 ms 55124 KB Output is correct
134 Correct 318 ms 52320 KB Output is correct
135 Correct 366 ms 56476 KB Output is correct
136 Correct 361 ms 55352 KB Output is correct
137 Correct 358 ms 55360 KB Output is correct
138 Correct 358 ms 54968 KB Output is correct
139 Correct 349 ms 56148 KB Output is correct
140 Correct 377 ms 55308 KB Output is correct
141 Correct 370 ms 56144 KB Output is correct
142 Correct 372 ms 56328 KB Output is correct
143 Correct 348 ms 56120 KB Output is correct
144 Correct 334 ms 55552 KB Output is correct
145 Correct 346 ms 56244 KB Output is correct
146 Correct 330 ms 55888 KB Output is correct
147 Correct 350 ms 56400 KB Output is correct
148 Correct 348 ms 56256 KB Output is correct
149 Correct 338 ms 56144 KB Output is correct
150 Correct 158 ms 50220 KB Output is correct
151 Correct 246 ms 52512 KB Output is correct
152 Correct 252 ms 52536 KB Output is correct
153 Correct 245 ms 53072 KB Output is correct