oj.uz

답안 #180275

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
180275 2020-01-08T14:25:27 Z srvlt Segments (IZhO18_segments) C++14
100 / 100
 3887 ms 5528 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree <pair <int, int>, null_type, less <pair <int, int> >, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;

#define ll long long
#define db double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define size(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define K 1500

#define endl "\n"
//#define int long long

using namespace std;

void dout() {
    cerr << endl;
}
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
    cerr << H << ' ';
    dout(T...);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;

const int N = 200003;
int n, t, modify, m, cnt;
pii seg[N];
vector <int> tmp;

bool cur[N];
int arr[N];

bool cmp(const int & a, const int & b) {
    return seg[a].fi < seg[b].fi;
}

vector <int> vec1[N / K + 1], vec2[N / K + 1];

void rebuild() {
    for (auto i : tmp) {
        if (i < 0) {
            cur[-i] = false;
        }   else {
            cur[i] = true;
        }
    }
    tmp = {};
    for (int i = 0; i < cnt; i++) {
        arr[i] = 0;
    }
    cnt = 0;
    for (int i = 1; i <= m; i++) {
        if (cur[i]) {
            arr[cnt] = i;
            cnt++;
        }
    }
    sort(arr, arr + cnt, cmp);
    int b = (cnt - 1) / K + 1;
    for (int i = 0; i < b; i++) {
        vec1[i] = {};
        vec2[i] = {};
    }
    for (int i = 0; i < cnt; i++) {
        vec1[i / K].pb(seg[arr[i]].se);
        vec2[i / K].pb(seg[arr[i]].se - seg[arr[i]].fi);
    }
    for (int i = 0; i < b; i++) {
        sort(all(vec1[i]));
        sort(all(vec2[i]));
    }
}

int query(int l, int r, int k) {
    if (r - l < k) {
        return 0;
    }
    int i = 0, res = 0;
    while (i < cnt) {
        if (seg[arr[i]].fi > r - k) {
            break;
        }
        if (i % K == 0 && seg[arr[min(cnt - 1, i + K - 1)]].fi < l) {
            i += K;
            continue;
        }
        if (seg[arr[i]].fi < l) {
            i++;
            continue;
        }
        if (i % K == 0 && seg[arr[min(cnt - 1, i + K - 1)]].fi <= r - k) {
            int num = i / K;
            res += size(vec2[num]) - (lower_bound(all(vec2[num]), k) - vec2[num].begin());
            i += K;
        }   else {
            res += (seg[arr[i]].se - seg[arr[i]].fi >= k);
            i++;
        }
    }
    i = 0;
    while (i < cnt) {
        if (seg[arr[i]].fi >= l) {
            break;
        }
        if (i % K == 0 && seg[arr[min(cnt - 1, i + K - 1)]].fi < l) {
            int num = i / K;
            res += size(vec1[num]) - (lower_bound(all(vec1[num]), l + k) - vec1[num].begin());
            i += K;
        }   else {
            res += (seg[arr[i]].se >= l + k);
            i++;
        }
    }
    int L, R;
    for (auto i : tmp) {
        if (i < 0) {
            L = seg[-i].fi, R = seg[-i].se;
            res -= (L >= l && L <= r - k && R - L >= k) + (L < l && R >= l + k);
        }   else {
            L = seg[i].fi, R = seg[i].se;
            res += (L >= l && L <= r - k && R - L >= k) + (L < l && R >= l + k);
        }
    }
    return res;
}

void solve(int tc) {
    // check for (int i = 0; i < n; j++)
    cin >> n >> t;
    int tp, id, a, b, k, last = -1;
    for (int i = 0; i < n; i++) {
        cin >> tp;
        if (tp == 1) {
            cin >> a >> b;
            if (last != -1 && t == 1) {
                a ^= last;
                b ^= last;
            }
            if (a > b) {
                swap(a, b);
            }
            b++;
            m++;
            seg[m] = {a, b};
            tmp.pb(m);

            modify++;
        }   else if (tp == 2) {
            cin >> id;
            tmp.pb(-id);

            modify++;
        }   else {
            cin >> a >> b >> k;
            if (last != -1 && t == 1) {
                a ^= last;
                b ^= last;
            }
            if (a > b) {
                swap(a, b);
            }
            b++;
            last = query(a, b, k);
            cout << last << endl;
        }
        if (modify == K) {
            rebuild();
            modify = 0;
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tc = 1;
//    cin >> tc;
    for (int i = 0; i < tc; i++) {
        solve(i);
//        cleanup();
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 14 ms 504 KB Output is correct
4 Correct 16 ms 504 KB Output is correct
5 Correct 15 ms 632 KB Output is correct
6 Correct 17 ms 632 KB Output is correct
7 Correct 15 ms 632 KB Output is correct
8 Correct 13 ms 632 KB Output is correct
9 Correct 12 ms 508 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 28 ms 504 KB Output is correct
12 Correct 34 ms 760 KB Output is correct
13 Correct 9 ms 632 KB Output is correct
14 Correct 14 ms 504 KB Output is correct
15 Correct 13 ms 632 KB Output is correct
16 Correct 14 ms 504 KB Output is correct
17 Correct 16 ms 504 KB Output is correct
18 Correct 11 ms 632 KB Output is correct
19 Correct 17 ms 476 KB Output is correct
20 Correct 16 ms 504 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1124 ms 2408 KB Output is correct
2 Correct 1124 ms 2664 KB Output is correct
3 Correct 1118 ms 2552 KB Output is correct
4 Correct 1214 ms 2636 KB Output is correct
5 Correct 980 ms 3320 KB Output is correct
6 Correct 958 ms 3448 KB Output is correct
7 Correct 1125 ms 2732 KB Output is correct
8 Correct 1088 ms 2552 KB Output is correct
9 Correct 1074 ms 2680 KB Output is correct
10 Correct 1461 ms 2108 KB Output is correct
11 Correct 888 ms 2168 KB Output is correct
12 Correct 1202 ms 3064 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 293 ms 1192 KB Output is correct
2 Correct 282 ms 1200 KB Output is correct
3 Correct 319 ms 1144 KB Output is correct
4 Correct 290 ms 1156 KB Output is correct
5 Correct 1174 ms 2936 KB Output is correct
6 Correct 1113 ms 2864 KB Output is correct
7 Correct 1203 ms 2852 KB Output is correct
8 Correct 956 ms 3484 KB Output is correct
9 Correct 965 ms 3420 KB Output is correct
10 Correct 971 ms 2900 KB Output is correct
11 Correct 507 ms 1656 KB Output is correct
12 Correct 981 ms 2872 KB Output is correct
13 Correct 906 ms 2680 KB Output is correct
14 Correct 774 ms 2188 KB Output is correct
15 Correct 725 ms 2136 KB Output is correct
16 Correct 626 ms 2048 KB Output is correct
17 Correct 1169 ms 2676 KB Output is correct
18 Correct 1161 ms 2680 KB Output is correct
19 Correct 1163 ms 2696 KB Output is correct
20 Correct 1141 ms 2648 KB Output is correct
21 Correct 543 ms 1912 KB Output is correct
22 Correct 857 ms 2296 KB Output is correct
23 Correct 935 ms 2520 KB Output is correct
24 Correct 884 ms 2464 KB Output is correct
25 Correct 297 ms 1380 KB Output is correct
26 Correct 284 ms 1400 KB Output is correct
27 Correct 296 ms 1436 KB Output is correct
28 Correct 289 ms 1400 KB Output is correct
29 Correct 945 ms 2680 KB Output is correct
30 Correct 979 ms 2680 KB Output is correct
31 Correct 965 ms 3288 KB Output is correct
32 Correct 1018 ms 2832 KB Output is correct
33 Correct 949 ms 2840 KB Output is correct
34 Correct 692 ms 1996 KB Output is correct
35 Correct 867 ms 2552 KB Output is correct
36 Correct 936 ms 2992 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 1256 KB Output is correct
2 Correct 269 ms 1272 KB Output is correct
3 Correct 276 ms 1332 KB Output is correct
4 Correct 280 ms 1080 KB Output is correct
5 Correct 1018 ms 2996 KB Output is correct
6 Correct 830 ms 1892 KB Output is correct
7 Correct 1006 ms 3096 KB Output is correct
8 Correct 1354 ms 2172 KB Output is correct
9 Correct 836 ms 2296 KB Output is correct
10 Correct 991 ms 3064 KB Output is correct
11 Correct 626 ms 1956 KB Output is correct
12 Correct 945 ms 3496 KB Output is correct
13 Correct 957 ms 2712 KB Output is correct
14 Correct 744 ms 2248 KB Output is correct
15 Correct 974 ms 3192 KB Output is correct
16 Correct 935 ms 2720 KB Output is correct
17 Correct 1118 ms 2552 KB Output is correct
18 Correct 1100 ms 2688 KB Output is correct
19 Correct 1102 ms 2728 KB Output is correct
20 Correct 1102 ms 2732 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 14 ms 504 KB Output is correct
4 Correct 16 ms 504 KB Output is correct
5 Correct 15 ms 632 KB Output is correct
6 Correct 17 ms 632 KB Output is correct
7 Correct 15 ms 632 KB Output is correct
8 Correct 13 ms 632 KB Output is correct
9 Correct 12 ms 508 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 28 ms 504 KB Output is correct
12 Correct 34 ms 760 KB Output is correct
13 Correct 9 ms 632 KB Output is correct
14 Correct 14 ms 504 KB Output is correct
15 Correct 13 ms 632 KB Output is correct
16 Correct 14 ms 504 KB Output is correct
17 Correct 16 ms 504 KB Output is correct
18 Correct 11 ms 632 KB Output is correct
19 Correct 17 ms 476 KB Output is correct
20 Correct 16 ms 504 KB Output is correct
21 Correct 1124 ms 2408 KB Output is correct
22 Correct 1124 ms 2664 KB Output is correct
23 Correct 1118 ms 2552 KB Output is correct
24 Correct 1214 ms 2636 KB Output is correct
25 Correct 980 ms 3320 KB Output is correct
26 Correct 958 ms 3448 KB Output is correct
27 Correct 1125 ms 2732 KB Output is correct
28 Correct 1088 ms 2552 KB Output is correct
29 Correct 1074 ms 2680 KB Output is correct
30 Correct 1461 ms 2108 KB Output is correct
31 Correct 888 ms 2168 KB Output is correct
32 Correct 1202 ms 3064 KB Output is correct
33 Correct 269 ms 1256 KB Output is correct
34 Correct 269 ms 1272 KB Output is correct
35 Correct 276 ms 1332 KB Output is correct
36 Correct 280 ms 1080 KB Output is correct
37 Correct 1018 ms 2996 KB Output is correct
38 Correct 830 ms 1892 KB Output is correct
39 Correct 1006 ms 3096 KB Output is correct
40 Correct 1354 ms 2172 KB Output is correct
41 Correct 836 ms 2296 KB Output is correct
42 Correct 991 ms 3064 KB Output is correct
43 Correct 626 ms 1956 KB Output is correct
44 Correct 945 ms 3496 KB Output is correct
45 Correct 957 ms 2712 KB Output is correct
46 Correct 744 ms 2248 KB Output is correct
47 Correct 974 ms 3192 KB Output is correct
48 Correct 935 ms 2720 KB Output is correct
49 Correct 1118 ms 2552 KB Output is correct
50 Correct 1100 ms 2688 KB Output is correct
51 Correct 1102 ms 2728 KB Output is correct
52 Correct 1102 ms 2732 KB Output is correct
53 Correct 276 ms 1400 KB Output is correct
54 Correct 280 ms 1400 KB Output is correct
55 Correct 272 ms 1400 KB Output is correct
56 Correct 276 ms 1636 KB Output is correct
57 Correct 1071 ms 2168 KB Output is correct
58 Correct 633 ms 1800 KB Output is correct
59 Correct 1257 ms 2824 KB Output is correct
60 Correct 1412 ms 1696 KB Output is correct
61 Correct 943 ms 2748 KB Output is correct
62 Correct 973 ms 3200 KB Output is correct
63 Correct 992 ms 3364 KB Output is correct
64 Correct 963 ms 3276 KB Output is correct
65 Correct 626 ms 1928 KB Output is correct
66 Correct 588 ms 1932 KB Output is correct
67 Correct 934 ms 2864 KB Output is correct
68 Correct 888 ms 2564 KB Output is correct
69 Correct 1112 ms 2764 KB Output is correct
70 Correct 1159 ms 2568 KB Output is correct
71 Correct 1157 ms 2732 KB Output is correct
72 Correct 1114 ms 2732 KB Output is correct
73 Correct 734 ms 2040 KB Output is correct
74 Correct 902 ms 2556 KB Output is correct
75 Correct 955 ms 3304 KB Output is correct
76 Correct 967 ms 3492 KB Output is correct
77 Correct 276 ms 1464 KB Output is correct
78 Correct 276 ms 1420 KB Output is correct
79 Correct 282 ms 1560 KB Output is correct
80 Correct 276 ms 1428 KB Output is correct
81 Correct 948 ms 2528 KB Output is correct
82 Correct 753 ms 1932 KB Output is correct
83 Correct 616 ms 1880 KB Output is correct
84 Correct 898 ms 2552 KB Output is correct
85 Correct 930 ms 2836 KB Output is correct
86 Correct 938 ms 2936 KB Output is correct
87 Correct 791 ms 2344 KB Output is correct
88 Correct 553 ms 1784 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 14 ms 504 KB Output is correct
4 Correct 16 ms 504 KB Output is correct
5 Correct 15 ms 632 KB Output is correct
6 Correct 17 ms 632 KB Output is correct
7 Correct 15 ms 632 KB Output is correct
8 Correct 13 ms 632 KB Output is correct
9 Correct 12 ms 508 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 28 ms 504 KB Output is correct
12 Correct 34 ms 760 KB Output is correct
13 Correct 9 ms 632 KB Output is correct
14 Correct 14 ms 504 KB Output is correct
15 Correct 13 ms 632 KB Output is correct
16 Correct 14 ms 504 KB Output is correct
17 Correct 16 ms 504 KB Output is correct
18 Correct 11 ms 632 KB Output is correct
19 Correct 17 ms 476 KB Output is correct
20 Correct 16 ms 504 KB Output is correct
21 Correct 1124 ms 2408 KB Output is correct
22 Correct 1124 ms 2664 KB Output is correct
23 Correct 1118 ms 2552 KB Output is correct
24 Correct 1214 ms 2636 KB Output is correct
25 Correct 980 ms 3320 KB Output is correct
26 Correct 958 ms 3448 KB Output is correct
27 Correct 1125 ms 2732 KB Output is correct
28 Correct 1088 ms 2552 KB Output is correct
29 Correct 1074 ms 2680 KB Output is correct
30 Correct 1461 ms 2108 KB Output is correct
31 Correct 888 ms 2168 KB Output is correct
32 Correct 1202 ms 3064 KB Output is correct
33 Correct 293 ms 1192 KB Output is correct
34 Correct 282 ms 1200 KB Output is correct
35 Correct 319 ms 1144 KB Output is correct
36 Correct 290 ms 1156 KB Output is correct
37 Correct 1174 ms 2936 KB Output is correct
38 Correct 1113 ms 2864 KB Output is correct
39 Correct 1203 ms 2852 KB Output is correct
40 Correct 956 ms 3484 KB Output is correct
41 Correct 965 ms 3420 KB Output is correct
42 Correct 971 ms 2900 KB Output is correct
43 Correct 507 ms 1656 KB Output is correct
44 Correct 981 ms 2872 KB Output is correct
45 Correct 906 ms 2680 KB Output is correct
46 Correct 774 ms 2188 KB Output is correct
47 Correct 725 ms 2136 KB Output is correct
48 Correct 626 ms 2048 KB Output is correct
49 Correct 1169 ms 2676 KB Output is correct
50 Correct 1161 ms 2680 KB Output is correct
51 Correct 1163 ms 2696 KB Output is correct
52 Correct 1141 ms 2648 KB Output is correct
53 Correct 543 ms 1912 KB Output is correct
54 Correct 857 ms 2296 KB Output is correct
55 Correct 935 ms 2520 KB Output is correct
56 Correct 884 ms 2464 KB Output is correct
57 Correct 297 ms 1380 KB Output is correct
58 Correct 284 ms 1400 KB Output is correct
59 Correct 296 ms 1436 KB Output is correct
60 Correct 289 ms 1400 KB Output is correct
61 Correct 945 ms 2680 KB Output is correct
62 Correct 979 ms 2680 KB Output is correct
63 Correct 965 ms 3288 KB Output is correct
64 Correct 1018 ms 2832 KB Output is correct
65 Correct 949 ms 2840 KB Output is correct
66 Correct 692 ms 1996 KB Output is correct
67 Correct 867 ms 2552 KB Output is correct
68 Correct 936 ms 2992 KB Output is correct
69 Correct 269 ms 1256 KB Output is correct
70 Correct 269 ms 1272 KB Output is correct
71 Correct 276 ms 1332 KB Output is correct
72 Correct 280 ms 1080 KB Output is correct
73 Correct 1018 ms 2996 KB Output is correct
74 Correct 830 ms 1892 KB Output is correct
75 Correct 1006 ms 3096 KB Output is correct
76 Correct 1354 ms 2172 KB Output is correct
77 Correct 836 ms 2296 KB Output is correct
78 Correct 991 ms 3064 KB Output is correct
79 Correct 626 ms 1956 KB Output is correct
80 Correct 945 ms 3496 KB Output is correct
81 Correct 957 ms 2712 KB Output is correct
82 Correct 744 ms 2248 KB Output is correct
83 Correct 974 ms 3192 KB Output is correct
84 Correct 935 ms 2720 KB Output is correct
85 Correct 1118 ms 2552 KB Output is correct
86 Correct 1100 ms 2688 KB Output is correct
87 Correct 1102 ms 2728 KB Output is correct
88 Correct 1102 ms 2732 KB Output is correct
89 Correct 276 ms 1400 KB Output is correct
90 Correct 280 ms 1400 KB Output is correct
91 Correct 272 ms 1400 KB Output is correct
92 Correct 276 ms 1636 KB Output is correct
93 Correct 1071 ms 2168 KB Output is correct
94 Correct 633 ms 1800 KB Output is correct
95 Correct 1257 ms 2824 KB Output is correct
96 Correct 1412 ms 1696 KB Output is correct
97 Correct 943 ms 2748 KB Output is correct
98 Correct 973 ms 3200 KB Output is correct
99 Correct 992 ms 3364 KB Output is correct
100 Correct 963 ms 3276 KB Output is correct
101 Correct 626 ms 1928 KB Output is correct
102 Correct 588 ms 1932 KB Output is correct
103 Correct 934 ms 2864 KB Output is correct
104 Correct 888 ms 2564 KB Output is correct
105 Correct 1112 ms 2764 KB Output is correct
106 Correct 1159 ms 2568 KB Output is correct
107 Correct 1157 ms 2732 KB Output is correct
108 Correct 1114 ms 2732 KB Output is correct
109 Correct 734 ms 2040 KB Output is correct
110 Correct 902 ms 2556 KB Output is correct
111 Correct 955 ms 3304 KB Output is correct
112 Correct 967 ms 3492 KB Output is correct
113 Correct 276 ms 1464 KB Output is correct
114 Correct 276 ms 1420 KB Output is correct
115 Correct 282 ms 1560 KB Output is correct
116 Correct 276 ms 1428 KB Output is correct
117 Correct 948 ms 2528 KB Output is correct
118 Correct 753 ms 1932 KB Output is correct
119 Correct 616 ms 1880 KB Output is correct
120 Correct 898 ms 2552 KB Output is correct
121 Correct 930 ms 2836 KB Output is correct
122 Correct 938 ms 2936 KB Output is correct
123 Correct 791 ms 2344 KB Output is correct
124 Correct 553 ms 1784 KB Output is correct
125 Correct 556 ms 1800 KB Output is correct
126 Correct 565 ms 1840 KB Output is correct
127 Correct 593 ms 1884 KB Output is correct
128 Correct 567 ms 1968 KB Output is correct
129 Correct 553 ms 1784 KB Output is correct
130 Correct 579 ms 1912 KB Output is correct
131 Correct 2207 ms 2584 KB Output is correct
132 Correct 3271 ms 3884 KB Output is correct
133 Correct 3595 ms 4592 KB Output is correct
134 Correct 3282 ms 2816 KB Output is correct
135 Correct 3350 ms 4840 KB Output is correct
136 Correct 1496 ms 2096 KB Output is correct
137 Correct 3846 ms 5528 KB Output is correct
138 Correct 3273 ms 3884 KB Output is correct
139 Correct 3665 ms 4456 KB Output is correct
140 Correct 3764 ms 5096 KB Output is correct
141 Correct 3481 ms 4268 KB Output is correct
142 Correct 1297 ms 2048 KB Output is correct
143 Correct 1903 ms 2480 KB Output is correct
144 Correct 968 ms 1784 KB Output is correct
145 Correct 3773 ms 5060 KB Output is correct
146 Correct 2587 ms 3112 KB Output is correct
147 Correct 1975 ms 2640 KB Output is correct
148 Correct 1877 ms 2452 KB Output is correct
149 Correct 3489 ms 3896 KB Output is correct
150 Correct 3482 ms 3880 KB Output is correct
151 Correct 3506 ms 3844 KB Output is correct
152 Correct 3481 ms 3860 KB Output is correct
153 Correct 3484 ms 3840 KB Output is correct
154 Correct 3507 ms 3752 KB Output is correct
155 Correct 1645 ms 2260 KB Output is correct
156 Correct 2162 ms 2688 KB Output is correct
157 Correct 3821 ms 5120 KB Output is correct
158 Correct 3817 ms 5080 KB Output is correct
159 Correct 3338 ms 3980 KB Output is correct
160 Correct 2706 ms 3192 KB Output is correct
161 Correct 591 ms 1656 KB Output is correct
162 Correct 573 ms 1520 KB Output is correct
163 Correct 580 ms 1656 KB Output is correct
164 Correct 695 ms 1756 KB Output is correct
165 Correct 596 ms 1656 KB Output is correct
166 Correct 571 ms 1568 KB Output is correct
167 Correct 3859 ms 5208 KB Output is correct
168 Correct 3839 ms 5348 KB Output is correct
169 Correct 3887 ms 5108 KB Output is correct
170 Correct 3819 ms 4888 KB Output is correct
171 Correct 3474 ms 4252 KB Output is correct
172 Correct 2493 ms 2928 KB Output is correct
173 Correct 3771 ms 5136 KB Output is correct
174 Correct 2484 ms 2900 KB Output is correct
175 Correct 3560 ms 4304 KB Output is correct
176 Correct 1842 ms 2528 KB Output is correct
177 Correct 3288 ms 3868 KB Output is correct
178 Correct 3149 ms 3656 KB Output is correct