oj.uz

답안 #794936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
794936 2023-07-27T04:13:41 Z RushB 푸드 코트 (JOI21_foodcourt) C++17
100 / 100
 381 ms 56328 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:19: 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:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |         int m = l + r >> 1;
      |                 ~~^~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 18900 KB Output is correct
2 Correct 11 ms 18900 KB Output is correct
3 Correct 10 ms 18900 KB Output is correct
4 Correct 11 ms 18956 KB Output is correct
5 Correct 10 ms 19000 KB Output is correct
6 Correct 10 ms 18900 KB Output is correct
7 Correct 11 ms 18900 KB Output is correct
8 Correct 11 ms 18900 KB Output is correct
9 Correct 11 ms 19020 KB Output is correct
10 Correct 11 ms 18924 KB Output is correct
11 Correct 11 ms 18900 KB Output is correct
12 Correct 12 ms 18900 KB Output is correct
13 Correct 12 ms 18992 KB Output is correct
14 Correct 10 ms 18900 KB Output is correct
15 Correct 10 ms 18928 KB Output is correct
16 Correct 11 ms 18900 KB Output is correct
17 Correct 10 ms 18900 KB Output is correct
18 Correct 10 ms 19020 KB Output is correct
19 Correct 12 ms 18992 KB Output is correct
20 Correct 11 ms 18944 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 18900 KB Output is correct
2 Correct 11 ms 18900 KB Output is correct
3 Correct 10 ms 18900 KB Output is correct
4 Correct 11 ms 18956 KB Output is correct
5 Correct 10 ms 19000 KB Output is correct
6 Correct 10 ms 18900 KB Output is correct
7 Correct 11 ms 18900 KB Output is correct
8 Correct 11 ms 18900 KB Output is correct
9 Correct 11 ms 19020 KB Output is correct
10 Correct 11 ms 18924 KB Output is correct
11 Correct 11 ms 18900 KB Output is correct
12 Correct 12 ms 18900 KB Output is correct
13 Correct 12 ms 18992 KB Output is correct
14 Correct 10 ms 18900 KB Output is correct
15 Correct 10 ms 18928 KB Output is correct
16 Correct 11 ms 18900 KB Output is correct
17 Correct 10 ms 18900 KB Output is correct
18 Correct 10 ms 19020 KB Output is correct
19 Correct 12 ms 18992 KB Output is correct
20 Correct 11 ms 18944 KB Output is correct
21 Correct 10 ms 18900 KB Output is correct
22 Correct 10 ms 18900 KB Output is correct
23 Correct 13 ms 19004 KB Output is correct
24 Correct 12 ms 18900 KB Output is correct
25 Correct 10 ms 18964 KB Output is correct
26 Correct 14 ms 18900 KB Output is correct
27 Correct 10 ms 19000 KB Output is correct
28 Correct 11 ms 18900 KB Output is correct
29 Correct 11 ms 18920 KB Output is correct
30 Correct 10 ms 18900 KB Output is correct
31 Correct 12 ms 18920 KB Output is correct
32 Correct 10 ms 18952 KB Output is correct
33 Correct 10 ms 18900 KB Output is correct
34 Correct 10 ms 18964 KB Output is correct
35 Correct 10 ms 18988 KB Output is correct
36 Correct 10 ms 18952 KB Output is correct
37 Correct 10 ms 18900 KB Output is correct
38 Correct 10 ms 18952 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 26592 KB Output is correct
2 Correct 65 ms 26648 KB Output is correct
3 Correct 70 ms 26604 KB Output is correct
4 Correct 58 ms 26668 KB Output is correct
5 Correct 59 ms 26568 KB Output is correct
6 Correct 58 ms 26616 KB Output is correct
7 Correct 33 ms 25088 KB Output is correct
8 Correct 34 ms 25104 KB Output is correct
9 Correct 59 ms 26396 KB Output is correct
10 Correct 69 ms 26776 KB Output is correct
11 Correct 69 ms 26568 KB Output is correct
12 Correct 64 ms 26584 KB Output is correct
13 Correct 50 ms 25836 KB Output is correct
14 Correct 57 ms 26516 KB Output is correct
15 Correct 57 ms 25932 KB Output is correct
16 Correct 58 ms 26232 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 47612 KB Output is correct
2 Correct 244 ms 47868 KB Output is correct
3 Correct 359 ms 55496 KB Output is correct
4 Correct 273 ms 48060 KB Output is correct
5 Correct 224 ms 48028 KB Output is correct
6 Correct 345 ms 55732 KB Output is correct
7 Correct 113 ms 48784 KB Output is correct
8 Correct 123 ms 47652 KB Output is correct
9 Correct 323 ms 54364 KB Output is correct
10 Correct 295 ms 54280 KB Output is correct
11 Correct 314 ms 54192 KB Output is correct
12 Correct 324 ms 55536 KB Output is correct
13 Correct 321 ms 54280 KB Output is correct
14 Correct 342 ms 55536 KB Output is correct
15 Correct 353 ms 55520 KB Output is correct
16 Correct 346 ms 55520 KB Output is correct
17 Correct 332 ms 55428 KB Output is correct
18 Correct 313 ms 54868 KB Output is correct
19 Correct 347 ms 55580 KB Output is correct
20 Correct 345 ms 55052 KB Output is correct
21 Correct 360 ms 55532 KB Output is correct
22 Correct 345 ms 55744 KB Output is correct
23 Correct 337 ms 55532 KB Output is correct
24 Correct 351 ms 55604 KB Output is correct
25 Correct 225 ms 51392 KB Output is correct
26 Correct 235 ms 51856 KB Output is correct
27 Correct 265 ms 52148 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 18900 KB Output is correct
2 Correct 11 ms 18900 KB Output is correct
3 Correct 10 ms 18900 KB Output is correct
4 Correct 11 ms 18956 KB Output is correct
5 Correct 10 ms 19000 KB Output is correct
6 Correct 10 ms 18900 KB Output is correct
7 Correct 11 ms 18900 KB Output is correct
8 Correct 11 ms 18900 KB Output is correct
9 Correct 11 ms 19020 KB Output is correct
10 Correct 11 ms 18924 KB Output is correct
11 Correct 11 ms 18900 KB Output is correct
12 Correct 12 ms 18900 KB Output is correct
13 Correct 12 ms 18992 KB Output is correct
14 Correct 10 ms 18900 KB Output is correct
15 Correct 10 ms 18928 KB Output is correct
16 Correct 11 ms 18900 KB Output is correct
17 Correct 10 ms 18900 KB Output is correct
18 Correct 10 ms 19020 KB Output is correct
19 Correct 12 ms 18992 KB Output is correct
20 Correct 11 ms 18944 KB Output is correct
21 Correct 62 ms 26592 KB Output is correct
22 Correct 65 ms 26648 KB Output is correct
23 Correct 70 ms 26604 KB Output is correct
24 Correct 58 ms 26668 KB Output is correct
25 Correct 59 ms 26568 KB Output is correct
26 Correct 58 ms 26616 KB Output is correct
27 Correct 33 ms 25088 KB Output is correct
28 Correct 34 ms 25104 KB Output is correct
29 Correct 59 ms 26396 KB Output is correct
30 Correct 69 ms 26776 KB Output is correct
31 Correct 69 ms 26568 KB Output is correct
32 Correct 64 ms 26584 KB Output is correct
33 Correct 50 ms 25836 KB Output is correct
34 Correct 57 ms 26516 KB Output is correct
35 Correct 57 ms 25932 KB Output is correct
36 Correct 58 ms 26232 KB Output is correct
37 Correct 55 ms 26128 KB Output is correct
38 Correct 55 ms 25452 KB Output is correct
39 Correct 30 ms 24348 KB Output is correct
40 Correct 36 ms 24912 KB Output is correct
41 Correct 60 ms 26308 KB Output is correct
42 Correct 60 ms 26624 KB Output is correct
43 Correct 64 ms 26676 KB Output is correct
44 Correct 60 ms 26448 KB Output is correct
45 Correct 63 ms 26624 KB Output is correct
46 Correct 64 ms 26620 KB Output is correct
47 Correct 40 ms 25284 KB Output is correct
48 Correct 52 ms 25768 KB Output is correct
49 Correct 44 ms 24892 KB Output is correct
50 Correct 61 ms 26032 KB Output is correct
51 Correct 64 ms 26648 KB Output is correct
52 Correct 72 ms 26652 KB Output is correct
53 Correct 53 ms 25116 KB Output is correct
54 Correct 70 ms 26232 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 25860 KB Output is correct
2 Correct 63 ms 26240 KB Output is correct
3 Correct 78 ms 26384 KB Output is correct
4 Correct 45 ms 24716 KB Output is correct
5 Correct 54 ms 25604 KB Output is correct
6 Correct 60 ms 26264 KB Output is correct
7 Correct 35 ms 24936 KB Output is correct
8 Correct 36 ms 24668 KB Output is correct
9 Correct 46 ms 25556 KB Output is correct
10 Correct 50 ms 24236 KB Output is correct
11 Correct 55 ms 25624 KB Output is correct
12 Correct 63 ms 25744 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 18900 KB Output is correct
2 Correct 11 ms 18900 KB Output is correct
3 Correct 10 ms 18900 KB Output is correct
4 Correct 11 ms 18956 KB Output is correct
5 Correct 10 ms 19000 KB Output is correct
6 Correct 10 ms 18900 KB Output is correct
7 Correct 11 ms 18900 KB Output is correct
8 Correct 11 ms 18900 KB Output is correct
9 Correct 11 ms 19020 KB Output is correct
10 Correct 11 ms 18924 KB Output is correct
11 Correct 11 ms 18900 KB Output is correct
12 Correct 12 ms 18900 KB Output is correct
13 Correct 12 ms 18992 KB Output is correct
14 Correct 10 ms 18900 KB Output is correct
15 Correct 10 ms 18928 KB Output is correct
16 Correct 11 ms 18900 KB Output is correct
17 Correct 10 ms 18900 KB Output is correct
18 Correct 10 ms 19020 KB Output is correct
19 Correct 12 ms 18992 KB Output is correct
20 Correct 11 ms 18944 KB Output is correct
21 Correct 10 ms 18900 KB Output is correct
22 Correct 10 ms 18900 KB Output is correct
23 Correct 13 ms 19004 KB Output is correct
24 Correct 12 ms 18900 KB Output is correct
25 Correct 10 ms 18964 KB Output is correct
26 Correct 14 ms 18900 KB Output is correct
27 Correct 10 ms 19000 KB Output is correct
28 Correct 11 ms 18900 KB Output is correct
29 Correct 11 ms 18920 KB Output is correct
30 Correct 10 ms 18900 KB Output is correct
31 Correct 12 ms 18920 KB Output is correct
32 Correct 10 ms 18952 KB Output is correct
33 Correct 10 ms 18900 KB Output is correct
34 Correct 10 ms 18964 KB Output is correct
35 Correct 10 ms 18988 KB Output is correct
36 Correct 10 ms 18952 KB Output is correct
37 Correct 10 ms 18900 KB Output is correct
38 Correct 10 ms 18952 KB Output is correct
39 Correct 62 ms 26592 KB Output is correct
40 Correct 65 ms 26648 KB Output is correct
41 Correct 70 ms 26604 KB Output is correct
42 Correct 58 ms 26668 KB Output is correct
43 Correct 59 ms 26568 KB Output is correct
44 Correct 58 ms 26616 KB Output is correct
45 Correct 33 ms 25088 KB Output is correct
46 Correct 34 ms 25104 KB Output is correct
47 Correct 59 ms 26396 KB Output is correct
48 Correct 69 ms 26776 KB Output is correct
49 Correct 69 ms 26568 KB Output is correct
50 Correct 64 ms 26584 KB Output is correct
51 Correct 50 ms 25836 KB Output is correct
52 Correct 57 ms 26516 KB Output is correct
53 Correct 57 ms 25932 KB Output is correct
54 Correct 58 ms 26232 KB Output is correct
55 Correct 55 ms 26128 KB Output is correct
56 Correct 55 ms 25452 KB Output is correct
57 Correct 30 ms 24348 KB Output is correct
58 Correct 36 ms 24912 KB Output is correct
59 Correct 60 ms 26308 KB Output is correct
60 Correct 60 ms 26624 KB Output is correct
61 Correct 64 ms 26676 KB Output is correct
62 Correct 60 ms 26448 KB Output is correct
63 Correct 63 ms 26624 KB Output is correct
64 Correct 64 ms 26620 KB Output is correct
65 Correct 40 ms 25284 KB Output is correct
66 Correct 52 ms 25768 KB Output is correct
67 Correct 44 ms 24892 KB Output is correct
68 Correct 61 ms 26032 KB Output is correct
69 Correct 64 ms 26648 KB Output is correct
70 Correct 72 ms 26652 KB Output is correct
71 Correct 53 ms 25116 KB Output is correct
72 Correct 70 ms 26232 KB Output is correct
73 Correct 58 ms 25860 KB Output is correct
74 Correct 63 ms 26240 KB Output is correct
75 Correct 78 ms 26384 KB Output is correct
76 Correct 45 ms 24716 KB Output is correct
77 Correct 54 ms 25604 KB Output is correct
78 Correct 60 ms 26264 KB Output is correct
79 Correct 35 ms 24936 KB Output is correct
80 Correct 36 ms 24668 KB Output is correct
81 Correct 46 ms 25556 KB Output is correct
82 Correct 50 ms 24236 KB Output is correct
83 Correct 55 ms 25624 KB Output is correct
84 Correct 63 ms 25744 KB Output is correct
85 Correct 57 ms 26044 KB Output is correct
86 Correct 71 ms 26700 KB Output is correct
87 Correct 57 ms 25908 KB Output is correct
88 Correct 63 ms 26596 KB Output is correct
89 Correct 52 ms 24652 KB Output is correct
90 Correct 65 ms 26580 KB Output is correct
91 Correct 51 ms 25548 KB Output is correct
92 Correct 49 ms 25356 KB Output is correct
93 Correct 62 ms 26612 KB Output is correct
94 Correct 82 ms 26432 KB Output is correct
95 Correct 72 ms 26444 KB Output is correct
96 Correct 66 ms 26636 KB Output is correct
97 Correct 68 ms 26660 KB Output is correct
98 Correct 56 ms 25772 KB Output is correct
99 Correct 42 ms 25272 KB Output is correct
100 Correct 54 ms 24924 KB Output is correct
101 Correct 54 ms 25804 KB Output is correct
102 Correct 57 ms 25852 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 18900 KB Output is correct
2 Correct 11 ms 18900 KB Output is correct
3 Correct 10 ms 18900 KB Output is correct
4 Correct 11 ms 18956 KB Output is correct
5 Correct 10 ms 19000 KB Output is correct
6 Correct 10 ms 18900 KB Output is correct
7 Correct 11 ms 18900 KB Output is correct
8 Correct 11 ms 18900 KB Output is correct
9 Correct 11 ms 19020 KB Output is correct
10 Correct 11 ms 18924 KB Output is correct
11 Correct 11 ms 18900 KB Output is correct
12 Correct 12 ms 18900 KB Output is correct
13 Correct 12 ms 18992 KB Output is correct
14 Correct 10 ms 18900 KB Output is correct
15 Correct 10 ms 18928 KB Output is correct
16 Correct 11 ms 18900 KB Output is correct
17 Correct 10 ms 18900 KB Output is correct
18 Correct 10 ms 19020 KB Output is correct
19 Correct 12 ms 18992 KB Output is correct
20 Correct 11 ms 18944 KB Output is correct
21 Correct 10 ms 18900 KB Output is correct
22 Correct 10 ms 18900 KB Output is correct
23 Correct 13 ms 19004 KB Output is correct
24 Correct 12 ms 18900 KB Output is correct
25 Correct 10 ms 18964 KB Output is correct
26 Correct 14 ms 18900 KB Output is correct
27 Correct 10 ms 19000 KB Output is correct
28 Correct 11 ms 18900 KB Output is correct
29 Correct 11 ms 18920 KB Output is correct
30 Correct 10 ms 18900 KB Output is correct
31 Correct 12 ms 18920 KB Output is correct
32 Correct 10 ms 18952 KB Output is correct
33 Correct 10 ms 18900 KB Output is correct
34 Correct 10 ms 18964 KB Output is correct
35 Correct 10 ms 18988 KB Output is correct
36 Correct 10 ms 18952 KB Output is correct
37 Correct 10 ms 18900 KB Output is correct
38 Correct 10 ms 18952 KB Output is correct
39 Correct 62 ms 26592 KB Output is correct
40 Correct 65 ms 26648 KB Output is correct
41 Correct 70 ms 26604 KB Output is correct
42 Correct 58 ms 26668 KB Output is correct
43 Correct 59 ms 26568 KB Output is correct
44 Correct 58 ms 26616 KB Output is correct
45 Correct 33 ms 25088 KB Output is correct
46 Correct 34 ms 25104 KB Output is correct
47 Correct 59 ms 26396 KB Output is correct
48 Correct 69 ms 26776 KB Output is correct
49 Correct 69 ms 26568 KB Output is correct
50 Correct 64 ms 26584 KB Output is correct
51 Correct 50 ms 25836 KB Output is correct
52 Correct 57 ms 26516 KB Output is correct
53 Correct 57 ms 25932 KB Output is correct
54 Correct 58 ms 26232 KB Output is correct
55 Correct 323 ms 47612 KB Output is correct
56 Correct 244 ms 47868 KB Output is correct
57 Correct 359 ms 55496 KB Output is correct
58 Correct 273 ms 48060 KB Output is correct
59 Correct 224 ms 48028 KB Output is correct
60 Correct 345 ms 55732 KB Output is correct
61 Correct 113 ms 48784 KB Output is correct
62 Correct 123 ms 47652 KB Output is correct
63 Correct 323 ms 54364 KB Output is correct
64 Correct 295 ms 54280 KB Output is correct
65 Correct 314 ms 54192 KB Output is correct
66 Correct 324 ms 55536 KB Output is correct
67 Correct 321 ms 54280 KB Output is correct
68 Correct 342 ms 55536 KB Output is correct
69 Correct 353 ms 55520 KB Output is correct
70 Correct 346 ms 55520 KB Output is correct
71 Correct 332 ms 55428 KB Output is correct
72 Correct 313 ms 54868 KB Output is correct
73 Correct 347 ms 55580 KB Output is correct
74 Correct 345 ms 55052 KB Output is correct
75 Correct 360 ms 55532 KB Output is correct
76 Correct 345 ms 55744 KB Output is correct
77 Correct 337 ms 55532 KB Output is correct
78 Correct 351 ms 55604 KB Output is correct
79 Correct 225 ms 51392 KB Output is correct
80 Correct 235 ms 51856 KB Output is correct
81 Correct 265 ms 52148 KB Output is correct
82 Correct 55 ms 26128 KB Output is correct
83 Correct 55 ms 25452 KB Output is correct
84 Correct 30 ms 24348 KB Output is correct
85 Correct 36 ms 24912 KB Output is correct
86 Correct 60 ms 26308 KB Output is correct
87 Correct 60 ms 26624 KB Output is correct
88 Correct 64 ms 26676 KB Output is correct
89 Correct 60 ms 26448 KB Output is correct
90 Correct 63 ms 26624 KB Output is correct
91 Correct 64 ms 26620 KB Output is correct
92 Correct 40 ms 25284 KB Output is correct
93 Correct 52 ms 25768 KB Output is correct
94 Correct 44 ms 24892 KB Output is correct
95 Correct 61 ms 26032 KB Output is correct
96 Correct 64 ms 26648 KB Output is correct
97 Correct 72 ms 26652 KB Output is correct
98 Correct 53 ms 25116 KB Output is correct
99 Correct 70 ms 26232 KB Output is correct
100 Correct 58 ms 25860 KB Output is correct
101 Correct 63 ms 26240 KB Output is correct
102 Correct 78 ms 26384 KB Output is correct
103 Correct 45 ms 24716 KB Output is correct
104 Correct 54 ms 25604 KB Output is correct
105 Correct 60 ms 26264 KB Output is correct
106 Correct 35 ms 24936 KB Output is correct
107 Correct 36 ms 24668 KB Output is correct
108 Correct 46 ms 25556 KB Output is correct
109 Correct 50 ms 24236 KB Output is correct
110 Correct 55 ms 25624 KB Output is correct
111 Correct 63 ms 25744 KB Output is correct
112 Correct 57 ms 26044 KB Output is correct
113 Correct 71 ms 26700 KB Output is correct
114 Correct 57 ms 25908 KB Output is correct
115 Correct 63 ms 26596 KB Output is correct
116 Correct 52 ms 24652 KB Output is correct
117 Correct 65 ms 26580 KB Output is correct
118 Correct 51 ms 25548 KB Output is correct
119 Correct 49 ms 25356 KB Output is correct
120 Correct 62 ms 26612 KB Output is correct
121 Correct 82 ms 26432 KB Output is correct
122 Correct 72 ms 26444 KB Output is correct
123 Correct 66 ms 26636 KB Output is correct
124 Correct 68 ms 26660 KB Output is correct
125 Correct 56 ms 25772 KB Output is correct
126 Correct 42 ms 25272 KB Output is correct
127 Correct 54 ms 24924 KB Output is correct
128 Correct 54 ms 25804 KB Output is correct
129 Correct 57 ms 25852 KB Output is correct
130 Correct 381 ms 56064 KB Output is correct
131 Correct 220 ms 48072 KB Output is correct
132 Correct 357 ms 56116 KB Output is correct
133 Correct 342 ms 55008 KB Output is correct
134 Correct 290 ms 52100 KB Output is correct
135 Correct 344 ms 56328 KB Output is correct
136 Correct 319 ms 55200 KB Output is correct
137 Correct 319 ms 55200 KB Output is correct
138 Correct 307 ms 54744 KB Output is correct
139 Correct 325 ms 56236 KB Output is correct
140 Correct 318 ms 55168 KB Output is correct
141 Correct 350 ms 56184 KB Output is correct
142 Correct 339 ms 56088 KB Output is correct
143 Correct 346 ms 56084 KB Output is correct
144 Correct 324 ms 55400 KB Output is correct
145 Correct 342 ms 56132 KB Output is correct
146 Correct 320 ms 55784 KB Output is correct
147 Correct 343 ms 56080 KB Output is correct
148 Correct 352 ms 56076 KB Output is correct
149 Correct 356 ms 56076 KB Output is correct
150 Correct 169 ms 50196 KB Output is correct
151 Correct 248 ms 52492 KB Output is correct
152 Correct 277 ms 52584 KB Output is correct
153 Correct 250 ms 52908 KB Output is correct