oj.uz

Submission #1031778

# Submission time Handle Problem Language Result Execution time Memory
1031778 2024-07-23T07:04:40 Z GrindMachine Segments (IZhO18_segments) C++17
100 / 100
 1155 ms 38216 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
other solutions
https://codeforces.com/blog/entry/124766 (log decomposition technique)

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

template<typename T>
struct fenwick {
    int n;
    vector<vector<int>> tr;
    int LOG = 0;

    fenwick() {

    }

    fenwick(int n_) {
        n = n_;
        tr = vector<vector<int>>(n + 1);
        while((1<<LOG) <= n) LOG++;
    }

    int lsb(int x) {
        return x & -x;
    }

    void pupd(int i, int v) {
        i++;
        for(; i <= n; i += lsb(i)){
            tr[i].pb(v);
        }
    }

    void build(){
        rep1(i,n){
            sort(all(tr[i]));
        }
    }

    void clear(){
        tr.clear();
        tr.shrink_to_fit();
    }

    int get(int i, int x, int y) {
        i++;
        int res = 0;
        for(; i; i ^= lsb(i)){
            auto &a = tr[i];
            if(y == 2*inf1) res += sz(a);
            else res += upper_bound(all(a),y)-a.begin();
            if(x) res -= lower_bound(all(a),x)-a.begin();
        }
        return res;
    }

    int query(int l, int r, int x, int y) {
        if (l > r) return 0;
        int res = get(r,x,y) - get(l-1,x,y);
        return res;
    }
};

struct S{
    vector<pii> a;
    fenwick<int> fenw1,fenw2;
    bool empty(){
        return a.empty();
    }
    void clear(){
        a.clear();
        a.shrink_to_fit();
        fenw1.clear(), fenw2.clear();
    }
    void build(){        
        fenw1 = fenwick<int>(sz(a));
        fenw2 = fenwick<int>(sz(a));
        rep(i,sz(a)){
            fenw1.pupd(i,a[i].ff);
            fenw2.pupd(i,a[i].ss);
        }
        fenw1.build();
        fenw2.build();
    }
    int query(int i, int l1, int r1, int k){
        int n = sz(a);
        return fenw1.query(i,n-1,r1-k+1,2*inf1)+fenw2.query(i,n-1,0,l1+k-1);
    }
};

struct DS{
    S a[20];
    void insert(int l, int r){
        S curr;
        curr.a.pb({l,r});

        rep(i,20){
            if(!a[i].empty()){
                S nxt;
                int ptr1 = 0, ptr2 = 0;
                while(ptr1 < sz(curr.a) and ptr2 < sz(a[i].a)){
                    int len1 = curr.a[ptr1].ss-curr.a[ptr1].ff;
                    int len2 = a[i].a[ptr2].ss-a[i].a[ptr2].ff;
                    if(len1 < len2){
                        nxt.a.pb(curr.a[ptr1++]);
                    }
                    else{
                        nxt.a.pb(a[i].a[ptr2++]);
                    }
                }                
                while(ptr1 < sz(curr.a)) nxt.a.pb(curr.a[ptr1++]);
                while(ptr2 < sz(a[i].a)) nxt.a.pb(a[i].a[ptr2++]);

                curr = nxt;
                nxt.clear();
                a[i].clear();                
            }
            else{
                a[i] = curr;
                a[i].build();
                break;
            }
        }
    }

    int query(int l1, int r1, int k){
        if(r1-l1 < k) return 0;
        int ans = 0;
        rep(i,20){
            if(a[i].empty()) conts;
            auto &b = a[i].a;
            int lo = 0, hi = sz(b)-1;
            int pos = -1;

            while(lo <= hi){
                int mid = (lo+hi) >> 1;
                if(b[mid].ss-b[mid].ff >= k){
                    pos = mid;
                    hi = mid-1;
                }
                else{
                    lo = mid+1;
                }
            }

            if(pos == -1) conts;

            int bad = a[i].query(pos,l1,r1,k);
            int add = sz(b)-pos-bad;
            ans += add;
        }

        return ans;
    }
};

void solve(int test_case)
{
    int q,c; cin >> q >> c;
    
    DS ds1,ds2;
    vector<pii> a;
    a.pb({0,0});

    int last_ans = 0;

    while(q--){
        int t; cin >> t;
        if(t == 1){
            int l,r; cin >> l >> r;
            l ^= c*last_ans, r ^= c*last_ans;
            if(l > r) swap(l,r);
            ds1.insert(l,r);
            a.pb({l,r});
        }
        else if(t == 2){
            int id; cin >> id;
            auto [l,r] = a[id];
            ds2.insert(l,r);
        }
        else{
            int l,r,k; cin >> l >> r >> k;
            l ^= c*last_ans, r ^= c*last_ans;
            if(l > r) swap(l,r);
            k--;
            int ans = ds1.query(l,r,k)-ds2.query(l,r,k);
            cout << ans << endl;
            last_ans = ans;
        }
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 10 ms 992 KB Output is correct
4 Correct 10 ms 972 KB Output is correct
5 Correct 11 ms 1372 KB Output is correct
6 Correct 11 ms 976 KB Output is correct
7 Correct 12 ms 1116 KB Output is correct
8 Correct 11 ms 1120 KB Output is correct
9 Correct 10 ms 1116 KB Output is correct
10 Correct 11 ms 1372 KB Output is correct
11 Correct 10 ms 860 KB Output is correct
12 Correct 9 ms 852 KB Output is correct
13 Correct 18 ms 1204 KB Output is correct
14 Correct 11 ms 1116 KB Output is correct
15 Correct 10 ms 860 KB Output is correct
16 Correct 10 ms 928 KB Output is correct
17 Correct 12 ms 1132 KB Output is correct
18 Correct 12 ms 1372 KB Output is correct
19 Correct 10 ms 1124 KB Output is correct
20 Correct 10 ms 1152 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 351 ms 11768 KB Output is correct
2 Correct 355 ms 11768 KB Output is correct
3 Correct 365 ms 11688 KB Output is correct
4 Correct 388 ms 12364 KB Output is correct
5 Correct 355 ms 19028 KB Output is correct
6 Correct 372 ms 19748 KB Output is correct
7 Correct 348 ms 11768 KB Output is correct
8 Correct 358 ms 11764 KB Output is correct
9 Correct 351 ms 11764 KB Output is correct
10 Correct 329 ms 6660 KB Output is correct
11 Correct 352 ms 7924 KB Output is correct
12 Correct 368 ms 15336 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 309 ms 15348 KB Output is correct
2 Correct 304 ms 14696 KB Output is correct
3 Correct 318 ms 15020 KB Output is correct
4 Correct 297 ms 14556 KB Output is correct
5 Correct 294 ms 15340 KB Output is correct
6 Correct 238 ms 13048 KB Output is correct
7 Correct 271 ms 14832 KB Output is correct
8 Correct 330 ms 19432 KB Output is correct
9 Correct 357 ms 19332 KB Output is correct
10 Correct 330 ms 17640 KB Output is correct
11 Correct 270 ms 13800 KB Output is correct
12 Correct 306 ms 17900 KB Output is correct
13 Correct 319 ms 17320 KB Output is correct
14 Correct 270 ms 15316 KB Output is correct
15 Correct 305 ms 16100 KB Output is correct
16 Correct 286 ms 14504 KB Output is correct
17 Correct 220 ms 11508 KB Output is correct
18 Correct 216 ms 11452 KB Output is correct
19 Correct 217 ms 11560 KB Output is correct
20 Correct 208 ms 11396 KB Output is correct
21 Correct 283 ms 14004 KB Output is correct
22 Correct 283 ms 15584 KB Output is correct
23 Correct 340 ms 17900 KB Output is correct
24 Correct 278 ms 15876 KB Output is correct
25 Correct 297 ms 14680 KB Output is correct
26 Correct 315 ms 14728 KB Output is correct
27 Correct 314 ms 14912 KB Output is correct
28 Correct 313 ms 14768 KB Output is correct
29 Correct 332 ms 16956 KB Output is correct
30 Correct 345 ms 17104 KB Output is correct
31 Correct 338 ms 19452 KB Output is correct
32 Correct 334 ms 17804 KB Output is correct
33 Correct 313 ms 17288 KB Output is correct
34 Correct 278 ms 14944 KB Output is correct
35 Correct 275 ms 16880 KB Output is correct
36 Correct 317 ms 17768 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 439 ms 14820 KB Output is correct
2 Correct 457 ms 15284 KB Output is correct
3 Correct 470 ms 15464 KB Output is correct
4 Correct 505 ms 15356 KB Output is correct
5 Correct 409 ms 16568 KB Output is correct
6 Correct 359 ms 5660 KB Output is correct
7 Correct 398 ms 17636 KB Output is correct
8 Correct 293 ms 6924 KB Output is correct
9 Correct 423 ms 15824 KB Output is correct
10 Correct 401 ms 18152 KB Output is correct
11 Correct 440 ms 14792 KB Output is correct
12 Correct 357 ms 19688 KB Output is correct
13 Correct 413 ms 17448 KB Output is correct
14 Correct 398 ms 15864 KB Output is correct
15 Correct 390 ms 19436 KB Output is correct
16 Correct 409 ms 17908 KB Output is correct
17 Correct 411 ms 11632 KB Output is correct
18 Correct 382 ms 11764 KB Output is correct
19 Correct 390 ms 11632 KB Output is correct
20 Correct 351 ms 11764 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 10 ms 992 KB Output is correct
4 Correct 10 ms 972 KB Output is correct
5 Correct 11 ms 1372 KB Output is correct
6 Correct 11 ms 976 KB Output is correct
7 Correct 12 ms 1116 KB Output is correct
8 Correct 11 ms 1120 KB Output is correct
9 Correct 10 ms 1116 KB Output is correct
10 Correct 11 ms 1372 KB Output is correct
11 Correct 10 ms 860 KB Output is correct
12 Correct 9 ms 852 KB Output is correct
13 Correct 18 ms 1204 KB Output is correct
14 Correct 11 ms 1116 KB Output is correct
15 Correct 10 ms 860 KB Output is correct
16 Correct 10 ms 928 KB Output is correct
17 Correct 12 ms 1132 KB Output is correct
18 Correct 12 ms 1372 KB Output is correct
19 Correct 10 ms 1124 KB Output is correct
20 Correct 10 ms 1152 KB Output is correct
21 Correct 351 ms 11768 KB Output is correct
22 Correct 355 ms 11768 KB Output is correct
23 Correct 365 ms 11688 KB Output is correct
24 Correct 388 ms 12364 KB Output is correct
25 Correct 355 ms 19028 KB Output is correct
26 Correct 372 ms 19748 KB Output is correct
27 Correct 348 ms 11768 KB Output is correct
28 Correct 358 ms 11764 KB Output is correct
29 Correct 351 ms 11764 KB Output is correct
30 Correct 329 ms 6660 KB Output is correct
31 Correct 352 ms 7924 KB Output is correct
32 Correct 368 ms 15336 KB Output is correct
33 Correct 439 ms 14820 KB Output is correct
34 Correct 457 ms 15284 KB Output is correct
35 Correct 470 ms 15464 KB Output is correct
36 Correct 505 ms 15356 KB Output is correct
37 Correct 409 ms 16568 KB Output is correct
38 Correct 359 ms 5660 KB Output is correct
39 Correct 398 ms 17636 KB Output is correct
40 Correct 293 ms 6924 KB Output is correct
41 Correct 423 ms 15824 KB Output is correct
42 Correct 401 ms 18152 KB Output is correct
43 Correct 440 ms 14792 KB Output is correct
44 Correct 357 ms 19688 KB Output is correct
45 Correct 413 ms 17448 KB Output is correct
46 Correct 398 ms 15864 KB Output is correct
47 Correct 390 ms 19436 KB Output is correct
48 Correct 409 ms 17908 KB Output is correct
49 Correct 411 ms 11632 KB Output is correct
50 Correct 382 ms 11764 KB Output is correct
51 Correct 390 ms 11632 KB Output is correct
52 Correct 351 ms 11764 KB Output is correct
53 Correct 466 ms 15136 KB Output is correct
54 Correct 472 ms 15460 KB Output is correct
55 Correct 473 ms 15380 KB Output is correct
56 Correct 462 ms 15336 KB Output is correct
57 Correct 434 ms 8716 KB Output is correct
58 Correct 223 ms 5000 KB Output is correct
59 Correct 462 ms 13556 KB Output is correct
60 Correct 265 ms 3880 KB Output is correct
61 Correct 447 ms 16884 KB Output is correct
62 Correct 376 ms 18828 KB Output is correct
63 Correct 359 ms 18788 KB Output is correct
64 Correct 369 ms 18672 KB Output is correct
65 Correct 387 ms 14328 KB Output is correct
66 Correct 390 ms 13796 KB Output is correct
67 Correct 377 ms 17392 KB Output is correct
68 Correct 387 ms 16372 KB Output is correct
69 Correct 361 ms 11016 KB Output is correct
70 Correct 345 ms 11016 KB Output is correct
71 Correct 380 ms 10892 KB Output is correct
72 Correct 358 ms 10820 KB Output is correct
73 Correct 422 ms 14520 KB Output is correct
74 Correct 396 ms 16064 KB Output is correct
75 Correct 368 ms 19404 KB Output is correct
76 Correct 367 ms 18880 KB Output is correct
77 Correct 461 ms 14664 KB Output is correct
78 Correct 475 ms 14664 KB Output is correct
79 Correct 463 ms 13096 KB Output is correct
80 Correct 449 ms 13444 KB Output is correct
81 Correct 427 ms 14360 KB Output is correct
82 Correct 441 ms 13164 KB Output is correct
83 Correct 435 ms 12752 KB Output is correct
84 Correct 434 ms 14840 KB Output is correct
85 Correct 379 ms 15848 KB Output is correct
86 Correct 366 ms 16068 KB Output is correct
87 Correct 409 ms 13952 KB Output is correct
88 Correct 406 ms 13028 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 10 ms 992 KB Output is correct
4 Correct 10 ms 972 KB Output is correct
5 Correct 11 ms 1372 KB Output is correct
6 Correct 11 ms 976 KB Output is correct
7 Correct 12 ms 1116 KB Output is correct
8 Correct 11 ms 1120 KB Output is correct
9 Correct 10 ms 1116 KB Output is correct
10 Correct 11 ms 1372 KB Output is correct
11 Correct 10 ms 860 KB Output is correct
12 Correct 9 ms 852 KB Output is correct
13 Correct 18 ms 1204 KB Output is correct
14 Correct 11 ms 1116 KB Output is correct
15 Correct 10 ms 860 KB Output is correct
16 Correct 10 ms 928 KB Output is correct
17 Correct 12 ms 1132 KB Output is correct
18 Correct 12 ms 1372 KB Output is correct
19 Correct 10 ms 1124 KB Output is correct
20 Correct 10 ms 1152 KB Output is correct
21 Correct 351 ms 11768 KB Output is correct
22 Correct 355 ms 11768 KB Output is correct
23 Correct 365 ms 11688 KB Output is correct
24 Correct 388 ms 12364 KB Output is correct
25 Correct 355 ms 19028 KB Output is correct
26 Correct 372 ms 19748 KB Output is correct
27 Correct 348 ms 11768 KB Output is correct
28 Correct 358 ms 11764 KB Output is correct
29 Correct 351 ms 11764 KB Output is correct
30 Correct 329 ms 6660 KB Output is correct
31 Correct 352 ms 7924 KB Output is correct
32 Correct 368 ms 15336 KB Output is correct
33 Correct 309 ms 15348 KB Output is correct
34 Correct 304 ms 14696 KB Output is correct
35 Correct 318 ms 15020 KB Output is correct
36 Correct 297 ms 14556 KB Output is correct
37 Correct 294 ms 15340 KB Output is correct
38 Correct 238 ms 13048 KB Output is correct
39 Correct 271 ms 14832 KB Output is correct
40 Correct 330 ms 19432 KB Output is correct
41 Correct 357 ms 19332 KB Output is correct
42 Correct 330 ms 17640 KB Output is correct
43 Correct 270 ms 13800 KB Output is correct
44 Correct 306 ms 17900 KB Output is correct
45 Correct 319 ms 17320 KB Output is correct
46 Correct 270 ms 15316 KB Output is correct
47 Correct 305 ms 16100 KB Output is correct
48 Correct 286 ms 14504 KB Output is correct
49 Correct 220 ms 11508 KB Output is correct
50 Correct 216 ms 11452 KB Output is correct
51 Correct 217 ms 11560 KB Output is correct
52 Correct 208 ms 11396 KB Output is correct
53 Correct 283 ms 14004 KB Output is correct
54 Correct 283 ms 15584 KB Output is correct
55 Correct 340 ms 17900 KB Output is correct
56 Correct 278 ms 15876 KB Output is correct
57 Correct 297 ms 14680 KB Output is correct
58 Correct 315 ms 14728 KB Output is correct
59 Correct 314 ms 14912 KB Output is correct
60 Correct 313 ms 14768 KB Output is correct
61 Correct 332 ms 16956 KB Output is correct
62 Correct 345 ms 17104 KB Output is correct
63 Correct 338 ms 19452 KB Output is correct
64 Correct 334 ms 17804 KB Output is correct
65 Correct 313 ms 17288 KB Output is correct
66 Correct 278 ms 14944 KB Output is correct
67 Correct 275 ms 16880 KB Output is correct
68 Correct 317 ms 17768 KB Output is correct
69 Correct 439 ms 14820 KB Output is correct
70 Correct 457 ms 15284 KB Output is correct
71 Correct 470 ms 15464 KB Output is correct
72 Correct 505 ms 15356 KB Output is correct
73 Correct 409 ms 16568 KB Output is correct
74 Correct 359 ms 5660 KB Output is correct
75 Correct 398 ms 17636 KB Output is correct
76 Correct 293 ms 6924 KB Output is correct
77 Correct 423 ms 15824 KB Output is correct
78 Correct 401 ms 18152 KB Output is correct
79 Correct 440 ms 14792 KB Output is correct
80 Correct 357 ms 19688 KB Output is correct
81 Correct 413 ms 17448 KB Output is correct
82 Correct 398 ms 15864 KB Output is correct
83 Correct 390 ms 19436 KB Output is correct
84 Correct 409 ms 17908 KB Output is correct
85 Correct 411 ms 11632 KB Output is correct
86 Correct 382 ms 11764 KB Output is correct
87 Correct 390 ms 11632 KB Output is correct
88 Correct 351 ms 11764 KB Output is correct
89 Correct 466 ms 15136 KB Output is correct
90 Correct 472 ms 15460 KB Output is correct
91 Correct 473 ms 15380 KB Output is correct
92 Correct 462 ms 15336 KB Output is correct
93 Correct 434 ms 8716 KB Output is correct
94 Correct 223 ms 5000 KB Output is correct
95 Correct 462 ms 13556 KB Output is correct
96 Correct 265 ms 3880 KB Output is correct
97 Correct 447 ms 16884 KB Output is correct
98 Correct 376 ms 18828 KB Output is correct
99 Correct 359 ms 18788 KB Output is correct
100 Correct 369 ms 18672 KB Output is correct
101 Correct 387 ms 14328 KB Output is correct
102 Correct 390 ms 13796 KB Output is correct
103 Correct 377 ms 17392 KB Output is correct
104 Correct 387 ms 16372 KB Output is correct
105 Correct 361 ms 11016 KB Output is correct
106 Correct 345 ms 11016 KB Output is correct
107 Correct 380 ms 10892 KB Output is correct
108 Correct 358 ms 10820 KB Output is correct
109 Correct 422 ms 14520 KB Output is correct
110 Correct 396 ms 16064 KB Output is correct
111 Correct 368 ms 19404 KB Output is correct
112 Correct 367 ms 18880 KB Output is correct
113 Correct 461 ms 14664 KB Output is correct
114 Correct 475 ms 14664 KB Output is correct
115 Correct 463 ms 13096 KB Output is correct
116 Correct 449 ms 13444 KB Output is correct
117 Correct 427 ms 14360 KB Output is correct
118 Correct 441 ms 13164 KB Output is correct
119 Correct 435 ms 12752 KB Output is correct
120 Correct 434 ms 14840 KB Output is correct
121 Correct 379 ms 15848 KB Output is correct
122 Correct 366 ms 16068 KB Output is correct
123 Correct 409 ms 13952 KB Output is correct
124 Correct 406 ms 13028 KB Output is correct
125 Correct 1108 ms 27248 KB Output is correct
126 Correct 1088 ms 26740 KB Output is correct
127 Correct 1093 ms 27012 KB Output is correct
128 Correct 1126 ms 26940 KB Output is correct
129 Correct 1108 ms 27000 KB Output is correct
130 Correct 1115 ms 26420 KB Output is correct
131 Correct 690 ms 4604 KB Output is correct
132 Correct 954 ms 16556 KB Output is correct
133 Correct 1064 ms 23788 KB Output is correct
134 Correct 1038 ms 8308 KB Output is correct
135 Correct 838 ms 29040 KB Output is correct
136 Correct 454 ms 4948 KB Output is correct
137 Correct 839 ms 37540 KB Output is correct
138 Correct 1058 ms 33192 KB Output is correct
139 Correct 919 ms 35484 KB Output is correct
140 Correct 872 ms 36856 KB Output is correct
141 Correct 970 ms 34680 KB Output is correct
142 Correct 1065 ms 26724 KB Output is correct
143 Correct 916 ms 28500 KB Output is correct
144 Correct 1000 ms 26692 KB Output is correct
145 Correct 849 ms 36724 KB Output is correct
146 Correct 923 ms 30188 KB Output is correct
147 Correct 894 ms 28732 KB Output is correct
148 Correct 968 ms 28132 KB Output is correct
149 Correct 905 ms 21480 KB Output is correct
150 Correct 862 ms 21492 KB Output is correct
151 Correct 930 ms 21608 KB Output is correct
152 Correct 899 ms 21476 KB Output is correct
153 Correct 857 ms 21480 KB Output is correct
154 Correct 869 ms 21620 KB Output is correct
155 Correct 1091 ms 27316 KB Output is correct
156 Correct 1028 ms 28652 KB Output is correct
157 Correct 870 ms 37168 KB Output is correct
158 Correct 862 ms 37648 KB Output is correct
159 Correct 975 ms 33444 KB Output is correct
160 Correct 1010 ms 30444 KB Output is correct
161 Correct 1108 ms 28772 KB Output is correct
162 Correct 1122 ms 28688 KB Output is correct
163 Correct 1059 ms 29144 KB Output is correct
164 Correct 1155 ms 29192 KB Output is correct
165 Correct 1096 ms 29356 KB Output is correct
166 Correct 1138 ms 29176 KB Output is correct
167 Correct 777 ms 38120 KB Output is correct
168 Correct 834 ms 38216 KB Output is correct
169 Correct 836 ms 36792 KB Output is correct
170 Correct 889 ms 36576 KB Output is correct
171 Correct 953 ms 34880 KB Output is correct
172 Correct 1039 ms 29728 KB Output is correct
173 Correct 778 ms 37220 KB Output is correct
174 Correct 865 ms 30436 KB Output is correct
175 Correct 873 ms 34756 KB Output is correct
176 Correct 932 ms 28228 KB Output is correct
177 Correct 939 ms 33604 KB Output is correct
178 Correct 944 ms 33664 KB Output is correct