oj.uz

Submission #1031784

# Submission time Handle Problem Language Result Execution time Memory
1031784 2024-07-23T07:10:04 Z GrindMachine Segments (IZhO18_segments) C++17
100 / 100
 1098 ms 35848 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")

#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(){
        rep(i,sz(tr)){
            tr[i].clear();
            tr[i].shrink_to_fit();
        }
        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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 11 ms 860 KB Output is correct
4 Correct 11 ms 860 KB Output is correct
5 Correct 11 ms 1292 KB Output is correct
6 Correct 11 ms 860 KB Output is correct
7 Correct 12 ms 1104 KB Output is correct
8 Correct 11 ms 960 KB Output is correct
9 Correct 13 ms 1116 KB Output is correct
10 Correct 12 ms 1116 KB Output is correct
11 Correct 12 ms 864 KB Output is correct
12 Correct 9 ms 856 KB Output is correct
13 Correct 12 ms 1240 KB Output is correct
14 Correct 12 ms 860 KB Output is correct
15 Correct 11 ms 860 KB Output is correct
16 Correct 10 ms 988 KB Output is correct
17 Correct 11 ms 1056 KB Output is correct
18 Correct 12 ms 1116 KB Output is correct
19 Correct 16 ms 860 KB Output is correct
20 Correct 16 ms 856 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 363 ms 9464 KB Output is correct
2 Correct 377 ms 9336 KB Output is correct
3 Correct 361 ms 9352 KB Output is correct
4 Correct 395 ms 10224 KB Output is correct
5 Correct 399 ms 17244 KB Output is correct
6 Correct 364 ms 17380 KB Output is correct
7 Correct 360 ms 9460 KB Output is correct
8 Correct 354 ms 9480 KB Output is correct
9 Correct 384 ms 9336 KB Output is correct
10 Correct 336 ms 4104 KB Output is correct
11 Correct 376 ms 5384 KB Output is correct
12 Correct 369 ms 13160 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 13816 KB Output is correct
2 Correct 310 ms 13136 KB Output is correct
3 Correct 317 ms 13224 KB Output is correct
4 Correct 315 ms 13020 KB Output is correct
5 Correct 330 ms 13480 KB Output is correct
6 Correct 249 ms 11012 KB Output is correct
7 Correct 284 ms 13040 KB Output is correct
8 Correct 346 ms 17116 KB Output is correct
9 Correct 355 ms 17384 KB Output is correct
10 Correct 339 ms 15884 KB Output is correct
11 Correct 309 ms 12244 KB Output is correct
12 Correct 366 ms 15948 KB Output is correct
13 Correct 345 ms 15604 KB Output is correct
14 Correct 306 ms 13560 KB Output is correct
15 Correct 329 ms 14324 KB Output is correct
16 Correct 288 ms 12904 KB Output is correct
17 Correct 223 ms 9456 KB Output is correct
18 Correct 225 ms 9452 KB Output is correct
19 Correct 260 ms 9556 KB Output is correct
20 Correct 215 ms 9464 KB Output is correct
21 Correct 296 ms 12404 KB Output is correct
22 Correct 304 ms 13840 KB Output is correct
23 Correct 352 ms 16112 KB Output is correct
24 Correct 308 ms 14060 KB Output is correct
25 Correct 314 ms 13152 KB Output is correct
26 Correct 341 ms 13192 KB Output is correct
27 Correct 301 ms 13388 KB Output is correct
28 Correct 323 ms 13268 KB Output is correct
29 Correct 333 ms 15172 KB Output is correct
30 Correct 364 ms 15308 KB Output is correct
31 Correct 321 ms 17488 KB Output is correct
32 Correct 322 ms 15808 KB Output is correct
33 Correct 317 ms 15556 KB Output is correct
34 Correct 284 ms 13224 KB Output is correct
35 Correct 330 ms 14956 KB Output is correct
36 Correct 369 ms 15988 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 504 ms 13016 KB Output is correct
2 Correct 517 ms 13208 KB Output is correct
3 Correct 506 ms 13420 KB Output is correct
4 Correct 536 ms 13264 KB Output is correct
5 Correct 409 ms 14316 KB Output is correct
6 Correct 337 ms 3148 KB Output is correct
7 Correct 403 ms 15344 KB Output is correct
8 Correct 291 ms 4360 KB Output is correct
9 Correct 448 ms 13748 KB Output is correct
10 Correct 413 ms 16108 KB Output is correct
11 Correct 466 ms 12728 KB Output is correct
12 Correct 369 ms 17672 KB Output is correct
13 Correct 415 ms 15412 KB Output is correct
14 Correct 398 ms 13840 KB Output is correct
15 Correct 351 ms 17388 KB Output is correct
16 Correct 386 ms 15944 KB Output is correct
17 Correct 346 ms 9232 KB Output is correct
18 Correct 346 ms 9288 KB Output is correct
19 Correct 338 ms 9460 KB Output is correct
20 Correct 324 ms 9464 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 11 ms 860 KB Output is correct
4 Correct 11 ms 860 KB Output is correct
5 Correct 11 ms 1292 KB Output is correct
6 Correct 11 ms 860 KB Output is correct
7 Correct 12 ms 1104 KB Output is correct
8 Correct 11 ms 960 KB Output is correct
9 Correct 13 ms 1116 KB Output is correct
10 Correct 12 ms 1116 KB Output is correct
11 Correct 12 ms 864 KB Output is correct
12 Correct 9 ms 856 KB Output is correct
13 Correct 12 ms 1240 KB Output is correct
14 Correct 12 ms 860 KB Output is correct
15 Correct 11 ms 860 KB Output is correct
16 Correct 10 ms 988 KB Output is correct
17 Correct 11 ms 1056 KB Output is correct
18 Correct 12 ms 1116 KB Output is correct
19 Correct 16 ms 860 KB Output is correct
20 Correct 16 ms 856 KB Output is correct
21 Correct 363 ms 9464 KB Output is correct
22 Correct 377 ms 9336 KB Output is correct
23 Correct 361 ms 9352 KB Output is correct
24 Correct 395 ms 10224 KB Output is correct
25 Correct 399 ms 17244 KB Output is correct
26 Correct 364 ms 17380 KB Output is correct
27 Correct 360 ms 9460 KB Output is correct
28 Correct 354 ms 9480 KB Output is correct
29 Correct 384 ms 9336 KB Output is correct
30 Correct 336 ms 4104 KB Output is correct
31 Correct 376 ms 5384 KB Output is correct
32 Correct 369 ms 13160 KB Output is correct
33 Correct 504 ms 13016 KB Output is correct
34 Correct 517 ms 13208 KB Output is correct
35 Correct 506 ms 13420 KB Output is correct
36 Correct 536 ms 13264 KB Output is correct
37 Correct 409 ms 14316 KB Output is correct
38 Correct 337 ms 3148 KB Output is correct
39 Correct 403 ms 15344 KB Output is correct
40 Correct 291 ms 4360 KB Output is correct
41 Correct 448 ms 13748 KB Output is correct
42 Correct 413 ms 16108 KB Output is correct
43 Correct 466 ms 12728 KB Output is correct
44 Correct 369 ms 17672 KB Output is correct
45 Correct 415 ms 15412 KB Output is correct
46 Correct 398 ms 13840 KB Output is correct
47 Correct 351 ms 17388 KB Output is correct
48 Correct 386 ms 15944 KB Output is correct
49 Correct 346 ms 9232 KB Output is correct
50 Correct 346 ms 9288 KB Output is correct
51 Correct 338 ms 9460 KB Output is correct
52 Correct 324 ms 9464 KB Output is correct
53 Correct 462 ms 13112 KB Output is correct
54 Correct 470 ms 13300 KB Output is correct
55 Correct 457 ms 13472 KB Output is correct
56 Correct 496 ms 13408 KB Output is correct
57 Correct 389 ms 6156 KB Output is correct
58 Correct 216 ms 2256 KB Output is correct
59 Correct 401 ms 11080 KB Output is correct
60 Correct 260 ms 2132 KB Output is correct
61 Correct 410 ms 15588 KB Output is correct
62 Correct 378 ms 17384 KB Output is correct
63 Correct 346 ms 17640 KB Output is correct
64 Correct 358 ms 17152 KB Output is correct
65 Correct 374 ms 13044 KB Output is correct
66 Correct 374 ms 12524 KB Output is correct
67 Correct 354 ms 16100 KB Output is correct
68 Correct 373 ms 15024 KB Output is correct
69 Correct 342 ms 9460 KB Output is correct
70 Correct 343 ms 9460 KB Output is correct
71 Correct 345 ms 9460 KB Output is correct
72 Correct 348 ms 9460 KB Output is correct
73 Correct 438 ms 13180 KB Output is correct
74 Correct 413 ms 14728 KB Output is correct
75 Correct 358 ms 18148 KB Output is correct
76 Correct 365 ms 17688 KB Output is correct
77 Correct 424 ms 13212 KB Output is correct
78 Correct 457 ms 13472 KB Output is correct
79 Correct 468 ms 13000 KB Output is correct
80 Correct 460 ms 13452 KB Output is correct
81 Correct 416 ms 14328 KB Output is correct
82 Correct 414 ms 13376 KB Output is correct
83 Correct 471 ms 12664 KB Output is correct
84 Correct 407 ms 14836 KB Output is correct
85 Correct 359 ms 15848 KB Output is correct
86 Correct 372 ms 15844 KB Output is correct
87 Correct 350 ms 13808 KB Output is correct
88 Correct 403 ms 13032 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 11 ms 860 KB Output is correct
4 Correct 11 ms 860 KB Output is correct
5 Correct 11 ms 1292 KB Output is correct
6 Correct 11 ms 860 KB Output is correct
7 Correct 12 ms 1104 KB Output is correct
8 Correct 11 ms 960 KB Output is correct
9 Correct 13 ms 1116 KB Output is correct
10 Correct 12 ms 1116 KB Output is correct
11 Correct 12 ms 864 KB Output is correct
12 Correct 9 ms 856 KB Output is correct
13 Correct 12 ms 1240 KB Output is correct
14 Correct 12 ms 860 KB Output is correct
15 Correct 11 ms 860 KB Output is correct
16 Correct 10 ms 988 KB Output is correct
17 Correct 11 ms 1056 KB Output is correct
18 Correct 12 ms 1116 KB Output is correct
19 Correct 16 ms 860 KB Output is correct
20 Correct 16 ms 856 KB Output is correct
21 Correct 363 ms 9464 KB Output is correct
22 Correct 377 ms 9336 KB Output is correct
23 Correct 361 ms 9352 KB Output is correct
24 Correct 395 ms 10224 KB Output is correct
25 Correct 399 ms 17244 KB Output is correct
26 Correct 364 ms 17380 KB Output is correct
27 Correct 360 ms 9460 KB Output is correct
28 Correct 354 ms 9480 KB Output is correct
29 Correct 384 ms 9336 KB Output is correct
30 Correct 336 ms 4104 KB Output is correct
31 Correct 376 ms 5384 KB Output is correct
32 Correct 369 ms 13160 KB Output is correct
33 Correct 316 ms 13816 KB Output is correct
34 Correct 310 ms 13136 KB Output is correct
35 Correct 317 ms 13224 KB Output is correct
36 Correct 315 ms 13020 KB Output is correct
37 Correct 330 ms 13480 KB Output is correct
38 Correct 249 ms 11012 KB Output is correct
39 Correct 284 ms 13040 KB Output is correct
40 Correct 346 ms 17116 KB Output is correct
41 Correct 355 ms 17384 KB Output is correct
42 Correct 339 ms 15884 KB Output is correct
43 Correct 309 ms 12244 KB Output is correct
44 Correct 366 ms 15948 KB Output is correct
45 Correct 345 ms 15604 KB Output is correct
46 Correct 306 ms 13560 KB Output is correct
47 Correct 329 ms 14324 KB Output is correct
48 Correct 288 ms 12904 KB Output is correct
49 Correct 223 ms 9456 KB Output is correct
50 Correct 225 ms 9452 KB Output is correct
51 Correct 260 ms 9556 KB Output is correct
52 Correct 215 ms 9464 KB Output is correct
53 Correct 296 ms 12404 KB Output is correct
54 Correct 304 ms 13840 KB Output is correct
55 Correct 352 ms 16112 KB Output is correct
56 Correct 308 ms 14060 KB Output is correct
57 Correct 314 ms 13152 KB Output is correct
58 Correct 341 ms 13192 KB Output is correct
59 Correct 301 ms 13388 KB Output is correct
60 Correct 323 ms 13268 KB Output is correct
61 Correct 333 ms 15172 KB Output is correct
62 Correct 364 ms 15308 KB Output is correct
63 Correct 321 ms 17488 KB Output is correct
64 Correct 322 ms 15808 KB Output is correct
65 Correct 317 ms 15556 KB Output is correct
66 Correct 284 ms 13224 KB Output is correct
67 Correct 330 ms 14956 KB Output is correct
68 Correct 369 ms 15988 KB Output is correct
69 Correct 504 ms 13016 KB Output is correct
70 Correct 517 ms 13208 KB Output is correct
71 Correct 506 ms 13420 KB Output is correct
72 Correct 536 ms 13264 KB Output is correct
73 Correct 409 ms 14316 KB Output is correct
74 Correct 337 ms 3148 KB Output is correct
75 Correct 403 ms 15344 KB Output is correct
76 Correct 291 ms 4360 KB Output is correct
77 Correct 448 ms 13748 KB Output is correct
78 Correct 413 ms 16108 KB Output is correct
79 Correct 466 ms 12728 KB Output is correct
80 Correct 369 ms 17672 KB Output is correct
81 Correct 415 ms 15412 KB Output is correct
82 Correct 398 ms 13840 KB Output is correct
83 Correct 351 ms 17388 KB Output is correct
84 Correct 386 ms 15944 KB Output is correct
85 Correct 346 ms 9232 KB Output is correct
86 Correct 346 ms 9288 KB Output is correct
87 Correct 338 ms 9460 KB Output is correct
88 Correct 324 ms 9464 KB Output is correct
89 Correct 462 ms 13112 KB Output is correct
90 Correct 470 ms 13300 KB Output is correct
91 Correct 457 ms 13472 KB Output is correct
92 Correct 496 ms 13408 KB Output is correct
93 Correct 389 ms 6156 KB Output is correct
94 Correct 216 ms 2256 KB Output is correct
95 Correct 401 ms 11080 KB Output is correct
96 Correct 260 ms 2132 KB Output is correct
97 Correct 410 ms 15588 KB Output is correct
98 Correct 378 ms 17384 KB Output is correct
99 Correct 346 ms 17640 KB Output is correct
100 Correct 358 ms 17152 KB Output is correct
101 Correct 374 ms 13044 KB Output is correct
102 Correct 374 ms 12524 KB Output is correct
103 Correct 354 ms 16100 KB Output is correct
104 Correct 373 ms 15024 KB Output is correct
105 Correct 342 ms 9460 KB Output is correct
106 Correct 343 ms 9460 KB Output is correct
107 Correct 345 ms 9460 KB Output is correct
108 Correct 348 ms 9460 KB Output is correct
109 Correct 438 ms 13180 KB Output is correct
110 Correct 413 ms 14728 KB Output is correct
111 Correct 358 ms 18148 KB Output is correct
112 Correct 365 ms 17688 KB Output is correct
113 Correct 424 ms 13212 KB Output is correct
114 Correct 457 ms 13472 KB Output is correct
115 Correct 468 ms 13000 KB Output is correct
116 Correct 460 ms 13452 KB Output is correct
117 Correct 416 ms 14328 KB Output is correct
118 Correct 414 ms 13376 KB Output is correct
119 Correct 471 ms 12664 KB Output is correct
120 Correct 407 ms 14836 KB Output is correct
121 Correct 359 ms 15848 KB Output is correct
122 Correct 372 ms 15844 KB Output is correct
123 Correct 350 ms 13808 KB Output is correct
124 Correct 403 ms 13032 KB Output is correct
125 Correct 1069 ms 27388 KB Output is correct
126 Correct 1046 ms 26668 KB Output is correct
127 Correct 1074 ms 26936 KB Output is correct
128 Correct 1014 ms 26836 KB Output is correct
129 Correct 1098 ms 27012 KB Output is correct
130 Correct 1072 ms 26468 KB Output is correct
131 Correct 626 ms 4616 KB Output is correct
132 Correct 865 ms 16672 KB Output is correct
133 Correct 944 ms 23784 KB Output is correct
134 Correct 974 ms 6828 KB Output is correct
135 Correct 822 ms 26600 KB Output is correct
136 Correct 400 ms 1620 KB Output is correct
137 Correct 812 ms 35128 KB Output is correct
138 Correct 917 ms 30752 KB Output is correct
139 Correct 864 ms 32812 KB Output is correct
140 Correct 810 ms 34424 KB Output is correct
141 Correct 915 ms 32044 KB Output is correct
142 Correct 980 ms 24412 KB Output is correct
143 Correct 858 ms 26340 KB Output is correct
144 Correct 829 ms 24384 KB Output is correct
145 Correct 815 ms 34200 KB Output is correct
146 Correct 852 ms 27732 KB Output is correct
147 Correct 850 ms 26372 KB Output is correct
148 Correct 863 ms 25636 KB Output is correct
149 Correct 808 ms 18672 KB Output is correct
150 Correct 855 ms 18668 KB Output is correct
151 Correct 827 ms 18864 KB Output is correct
152 Correct 824 ms 18796 KB Output is correct
153 Correct 821 ms 18860 KB Output is correct
154 Correct 763 ms 18780 KB Output is correct
155 Correct 949 ms 25052 KB Output is correct
156 Correct 914 ms 26648 KB Output is correct
157 Correct 850 ms 34536 KB Output is correct
158 Correct 848 ms 35144 KB Output is correct
159 Correct 958 ms 31060 KB Output is correct
160 Correct 895 ms 28164 KB Output is correct
161 Correct 1081 ms 26320 KB Output is correct
162 Correct 1065 ms 26292 KB Output is correct
163 Correct 1061 ms 26904 KB Output is correct
164 Correct 1072 ms 26848 KB Output is correct
165 Correct 1050 ms 27068 KB Output is correct
166 Correct 1088 ms 26864 KB Output is correct
167 Correct 822 ms 35808 KB Output is correct
168 Correct 856 ms 35848 KB Output is correct
169 Correct 868 ms 34324 KB Output is correct
170 Correct 951 ms 33792 KB Output is correct
171 Correct 964 ms 32228 KB Output is correct
172 Correct 1002 ms 27396 KB Output is correct
173 Correct 839 ms 34664 KB Output is correct
174 Correct 955 ms 27876 KB Output is correct
175 Correct 913 ms 32460 KB Output is correct
176 Correct 980 ms 25768 KB Output is correct
177 Correct 1040 ms 31208 KB Output is correct
178 Correct 996 ms 31564 KB Output is correct