oj.uz

Submission #1031786

# Submission time Handle Problem Language Result Execution time Memory
1031786 2024-07-23T07:11:45 Z GrindMachine Segments (IZhO18_segments) C++17
100 / 100
 1129 ms 38368 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++;
    }

    void reset(int n_){
        n = n_;
        tr.resize(n+1);
        LOG = 0;
        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.clear(), fenw2.clear();
        fenw1.reset(sz(a)), fenw2.reset(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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 10 ms 756 KB Output is correct
4 Correct 10 ms 860 KB Output is correct
5 Correct 11 ms 1116 KB Output is correct
6 Correct 15 ms 860 KB Output is correct
7 Correct 11 ms 860 KB Output is correct
8 Correct 11 ms 1124 KB Output is correct
9 Correct 10 ms 1116 KB Output is correct
10 Correct 12 ms 1284 KB Output is correct
11 Correct 10 ms 876 KB Output is correct
12 Correct 9 ms 856 KB Output is correct
13 Correct 12 ms 1116 KB Output is correct
14 Correct 11 ms 860 KB Output is correct
15 Correct 10 ms 860 KB Output is correct
16 Correct 10 ms 980 KB Output is correct
17 Correct 13 ms 860 KB Output is correct
18 Correct 12 ms 1312 KB Output is correct
19 Correct 11 ms 860 KB Output is correct
20 Correct 10 ms 1104 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 362 ms 9368 KB Output is correct
2 Correct 381 ms 9412 KB Output is correct
3 Correct 367 ms 9276 KB Output is correct
4 Correct 396 ms 10076 KB Output is correct
5 Correct 405 ms 17124 KB Output is correct
6 Correct 367 ms 17380 KB Output is correct
7 Correct 359 ms 9476 KB Output is correct
8 Correct 355 ms 9240 KB Output is correct
9 Correct 373 ms 9632 KB Output is correct
10 Correct 316 ms 4168 KB Output is correct
11 Correct 368 ms 5388 KB Output is correct
12 Correct 370 ms 13124 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 13768 KB Output is correct
2 Correct 320 ms 13252 KB Output is correct
3 Correct 320 ms 13176 KB Output is correct
4 Correct 343 ms 12988 KB Output is correct
5 Correct 306 ms 13224 KB Output is correct
6 Correct 257 ms 11020 KB Output is correct
7 Correct 295 ms 13248 KB Output is correct
8 Correct 352 ms 17124 KB Output is correct
9 Correct 363 ms 17380 KB Output is correct
10 Correct 342 ms 16108 KB Output is correct
11 Correct 316 ms 12012 KB Output is correct
12 Correct 370 ms 16108 KB Output is correct
13 Correct 362 ms 15588 KB Output is correct
14 Correct 301 ms 13560 KB Output is correct
15 Correct 303 ms 14556 KB Output is correct
16 Correct 295 ms 12872 KB Output is correct
17 Correct 218 ms 9292 KB Output is correct
18 Correct 219 ms 9288 KB Output is correct
19 Correct 224 ms 9460 KB Output is correct
20 Correct 238 ms 9460 KB Output is correct
21 Correct 307 ms 12352 KB Output is correct
22 Correct 302 ms 13808 KB Output is correct
23 Correct 349 ms 16048 KB Output is correct
24 Correct 315 ms 14092 KB Output is correct
25 Correct 304 ms 13144 KB Output is correct
26 Correct 317 ms 13100 KB Output is correct
27 Correct 309 ms 13480 KB Output is correct
28 Correct 311 ms 13436 KB Output is correct
29 Correct 341 ms 15172 KB Output is correct
30 Correct 348 ms 15344 KB Output is correct
31 Correct 341 ms 17472 KB Output is correct
32 Correct 323 ms 15852 KB Output is correct
33 Correct 316 ms 15604 KB Output is correct
34 Correct 293 ms 13308 KB Output is correct
35 Correct 289 ms 15228 KB Output is correct
36 Correct 317 ms 16100 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 453 ms 13020 KB Output is correct
2 Correct 456 ms 13188 KB Output is correct
3 Correct 447 ms 13224 KB Output is correct
4 Correct 458 ms 13188 KB Output is correct
5 Correct 379 ms 14316 KB Output is correct
6 Correct 348 ms 3152 KB Output is correct
7 Correct 373 ms 15332 KB Output is correct
8 Correct 293 ms 4356 KB Output is correct
9 Correct 421 ms 13812 KB Output is correct
10 Correct 384 ms 16192 KB Output is correct
11 Correct 438 ms 12636 KB Output is correct
12 Correct 373 ms 17568 KB Output is correct
13 Correct 448 ms 15336 KB Output is correct
14 Correct 367 ms 13812 KB Output is correct
15 Correct 367 ms 17208 KB Output is correct
16 Correct 402 ms 15904 KB Output is correct
17 Correct 346 ms 9464 KB Output is correct
18 Correct 337 ms 9456 KB Output is correct
19 Correct 366 ms 9456 KB Output is correct
20 Correct 329 ms 9228 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 10 ms 756 KB Output is correct
4 Correct 10 ms 860 KB Output is correct
5 Correct 11 ms 1116 KB Output is correct
6 Correct 15 ms 860 KB Output is correct
7 Correct 11 ms 860 KB Output is correct
8 Correct 11 ms 1124 KB Output is correct
9 Correct 10 ms 1116 KB Output is correct
10 Correct 12 ms 1284 KB Output is correct
11 Correct 10 ms 876 KB Output is correct
12 Correct 9 ms 856 KB Output is correct
13 Correct 12 ms 1116 KB Output is correct
14 Correct 11 ms 860 KB Output is correct
15 Correct 10 ms 860 KB Output is correct
16 Correct 10 ms 980 KB Output is correct
17 Correct 13 ms 860 KB Output is correct
18 Correct 12 ms 1312 KB Output is correct
19 Correct 11 ms 860 KB Output is correct
20 Correct 10 ms 1104 KB Output is correct
21 Correct 362 ms 9368 KB Output is correct
22 Correct 381 ms 9412 KB Output is correct
23 Correct 367 ms 9276 KB Output is correct
24 Correct 396 ms 10076 KB Output is correct
25 Correct 405 ms 17124 KB Output is correct
26 Correct 367 ms 17380 KB Output is correct
27 Correct 359 ms 9476 KB Output is correct
28 Correct 355 ms 9240 KB Output is correct
29 Correct 373 ms 9632 KB Output is correct
30 Correct 316 ms 4168 KB Output is correct
31 Correct 368 ms 5388 KB Output is correct
32 Correct 370 ms 13124 KB Output is correct
33 Correct 453 ms 13020 KB Output is correct
34 Correct 456 ms 13188 KB Output is correct
35 Correct 447 ms 13224 KB Output is correct
36 Correct 458 ms 13188 KB Output is correct
37 Correct 379 ms 14316 KB Output is correct
38 Correct 348 ms 3152 KB Output is correct
39 Correct 373 ms 15332 KB Output is correct
40 Correct 293 ms 4356 KB Output is correct
41 Correct 421 ms 13812 KB Output is correct
42 Correct 384 ms 16192 KB Output is correct
43 Correct 438 ms 12636 KB Output is correct
44 Correct 373 ms 17568 KB Output is correct
45 Correct 448 ms 15336 KB Output is correct
46 Correct 367 ms 13812 KB Output is correct
47 Correct 367 ms 17208 KB Output is correct
48 Correct 402 ms 15904 KB Output is correct
49 Correct 346 ms 9464 KB Output is correct
50 Correct 337 ms 9456 KB Output is correct
51 Correct 366 ms 9456 KB Output is correct
52 Correct 329 ms 9228 KB Output is correct
53 Correct 452 ms 13120 KB Output is correct
54 Correct 432 ms 13288 KB Output is correct
55 Correct 396 ms 13468 KB Output is correct
56 Correct 441 ms 13408 KB Output is correct
57 Correct 387 ms 6172 KB Output is correct
58 Correct 209 ms 2340 KB Output is correct
59 Correct 382 ms 11056 KB Output is correct
60 Correct 248 ms 1876 KB Output is correct
61 Correct 395 ms 15400 KB Output is correct
62 Correct 349 ms 17412 KB Output is correct
63 Correct 354 ms 17476 KB Output is correct
64 Correct 334 ms 17384 KB Output is correct
65 Correct 356 ms 13052 KB Output is correct
66 Correct 361 ms 12620 KB Output is correct
67 Correct 365 ms 16112 KB Output is correct
68 Correct 330 ms 15096 KB Output is correct
69 Correct 333 ms 9460 KB Output is correct
70 Correct 305 ms 9460 KB Output is correct
71 Correct 321 ms 9460 KB Output is correct
72 Correct 339 ms 11356 KB Output is correct
73 Correct 410 ms 14848 KB Output is correct
74 Correct 385 ms 16376 KB Output is correct
75 Correct 353 ms 19944 KB Output is correct
76 Correct 337 ms 19432 KB Output is correct
77 Correct 457 ms 14772 KB Output is correct
78 Correct 417 ms 14852 KB Output is correct
79 Correct 428 ms 14604 KB Output is correct
80 Correct 415 ms 14864 KB Output is correct
81 Correct 402 ms 15848 KB Output is correct
82 Correct 440 ms 14864 KB Output is correct
83 Correct 400 ms 14244 KB Output is correct
84 Correct 363 ms 16372 KB Output is correct
85 Correct 374 ms 17412 KB Output is correct
86 Correct 346 ms 17572 KB Output is correct
87 Correct 354 ms 15304 KB Output is correct
88 Correct 381 ms 14568 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 10 ms 756 KB Output is correct
4 Correct 10 ms 860 KB Output is correct
5 Correct 11 ms 1116 KB Output is correct
6 Correct 15 ms 860 KB Output is correct
7 Correct 11 ms 860 KB Output is correct
8 Correct 11 ms 1124 KB Output is correct
9 Correct 10 ms 1116 KB Output is correct
10 Correct 12 ms 1284 KB Output is correct
11 Correct 10 ms 876 KB Output is correct
12 Correct 9 ms 856 KB Output is correct
13 Correct 12 ms 1116 KB Output is correct
14 Correct 11 ms 860 KB Output is correct
15 Correct 10 ms 860 KB Output is correct
16 Correct 10 ms 980 KB Output is correct
17 Correct 13 ms 860 KB Output is correct
18 Correct 12 ms 1312 KB Output is correct
19 Correct 11 ms 860 KB Output is correct
20 Correct 10 ms 1104 KB Output is correct
21 Correct 362 ms 9368 KB Output is correct
22 Correct 381 ms 9412 KB Output is correct
23 Correct 367 ms 9276 KB Output is correct
24 Correct 396 ms 10076 KB Output is correct
25 Correct 405 ms 17124 KB Output is correct
26 Correct 367 ms 17380 KB Output is correct
27 Correct 359 ms 9476 KB Output is correct
28 Correct 355 ms 9240 KB Output is correct
29 Correct 373 ms 9632 KB Output is correct
30 Correct 316 ms 4168 KB Output is correct
31 Correct 368 ms 5388 KB Output is correct
32 Correct 370 ms 13124 KB Output is correct
33 Correct 310 ms 13768 KB Output is correct
34 Correct 320 ms 13252 KB Output is correct
35 Correct 320 ms 13176 KB Output is correct
36 Correct 343 ms 12988 KB Output is correct
37 Correct 306 ms 13224 KB Output is correct
38 Correct 257 ms 11020 KB Output is correct
39 Correct 295 ms 13248 KB Output is correct
40 Correct 352 ms 17124 KB Output is correct
41 Correct 363 ms 17380 KB Output is correct
42 Correct 342 ms 16108 KB Output is correct
43 Correct 316 ms 12012 KB Output is correct
44 Correct 370 ms 16108 KB Output is correct
45 Correct 362 ms 15588 KB Output is correct
46 Correct 301 ms 13560 KB Output is correct
47 Correct 303 ms 14556 KB Output is correct
48 Correct 295 ms 12872 KB Output is correct
49 Correct 218 ms 9292 KB Output is correct
50 Correct 219 ms 9288 KB Output is correct
51 Correct 224 ms 9460 KB Output is correct
52 Correct 238 ms 9460 KB Output is correct
53 Correct 307 ms 12352 KB Output is correct
54 Correct 302 ms 13808 KB Output is correct
55 Correct 349 ms 16048 KB Output is correct
56 Correct 315 ms 14092 KB Output is correct
57 Correct 304 ms 13144 KB Output is correct
58 Correct 317 ms 13100 KB Output is correct
59 Correct 309 ms 13480 KB Output is correct
60 Correct 311 ms 13436 KB Output is correct
61 Correct 341 ms 15172 KB Output is correct
62 Correct 348 ms 15344 KB Output is correct
63 Correct 341 ms 17472 KB Output is correct
64 Correct 323 ms 15852 KB Output is correct
65 Correct 316 ms 15604 KB Output is correct
66 Correct 293 ms 13308 KB Output is correct
67 Correct 289 ms 15228 KB Output is correct
68 Correct 317 ms 16100 KB Output is correct
69 Correct 453 ms 13020 KB Output is correct
70 Correct 456 ms 13188 KB Output is correct
71 Correct 447 ms 13224 KB Output is correct
72 Correct 458 ms 13188 KB Output is correct
73 Correct 379 ms 14316 KB Output is correct
74 Correct 348 ms 3152 KB Output is correct
75 Correct 373 ms 15332 KB Output is correct
76 Correct 293 ms 4356 KB Output is correct
77 Correct 421 ms 13812 KB Output is correct
78 Correct 384 ms 16192 KB Output is correct
79 Correct 438 ms 12636 KB Output is correct
80 Correct 373 ms 17568 KB Output is correct
81 Correct 448 ms 15336 KB Output is correct
82 Correct 367 ms 13812 KB Output is correct
83 Correct 367 ms 17208 KB Output is correct
84 Correct 402 ms 15904 KB Output is correct
85 Correct 346 ms 9464 KB Output is correct
86 Correct 337 ms 9456 KB Output is correct
87 Correct 366 ms 9456 KB Output is correct
88 Correct 329 ms 9228 KB Output is correct
89 Correct 452 ms 13120 KB Output is correct
90 Correct 432 ms 13288 KB Output is correct
91 Correct 396 ms 13468 KB Output is correct
92 Correct 441 ms 13408 KB Output is correct
93 Correct 387 ms 6172 KB Output is correct
94 Correct 209 ms 2340 KB Output is correct
95 Correct 382 ms 11056 KB Output is correct
96 Correct 248 ms 1876 KB Output is correct
97 Correct 395 ms 15400 KB Output is correct
98 Correct 349 ms 17412 KB Output is correct
99 Correct 354 ms 17476 KB Output is correct
100 Correct 334 ms 17384 KB Output is correct
101 Correct 356 ms 13052 KB Output is correct
102 Correct 361 ms 12620 KB Output is correct
103 Correct 365 ms 16112 KB Output is correct
104 Correct 330 ms 15096 KB Output is correct
105 Correct 333 ms 9460 KB Output is correct
106 Correct 305 ms 9460 KB Output is correct
107 Correct 321 ms 9460 KB Output is correct
108 Correct 339 ms 11356 KB Output is correct
109 Correct 410 ms 14848 KB Output is correct
110 Correct 385 ms 16376 KB Output is correct
111 Correct 353 ms 19944 KB Output is correct
112 Correct 337 ms 19432 KB Output is correct
113 Correct 457 ms 14772 KB Output is correct
114 Correct 417 ms 14852 KB Output is correct
115 Correct 428 ms 14604 KB Output is correct
116 Correct 415 ms 14864 KB Output is correct
117 Correct 402 ms 15848 KB Output is correct
118 Correct 440 ms 14864 KB Output is correct
119 Correct 400 ms 14244 KB Output is correct
120 Correct 363 ms 16372 KB Output is correct
121 Correct 374 ms 17412 KB Output is correct
122 Correct 346 ms 17572 KB Output is correct
123 Correct 354 ms 15304 KB Output is correct
124 Correct 381 ms 14568 KB Output is correct
125 Correct 989 ms 29988 KB Output is correct
126 Correct 1070 ms 29140 KB Output is correct
127 Correct 1008 ms 29504 KB Output is correct
128 Correct 1052 ms 29392 KB Output is correct
129 Correct 1067 ms 29364 KB Output is correct
130 Correct 1035 ms 29100 KB Output is correct
131 Correct 657 ms 8152 KB Output is correct
132 Correct 894 ms 19864 KB Output is correct
133 Correct 975 ms 26812 KB Output is correct
134 Correct 959 ms 10616 KB Output is correct
135 Correct 794 ms 29160 KB Output is correct
136 Correct 441 ms 5296 KB Output is correct
137 Correct 826 ms 37856 KB Output is correct
138 Correct 994 ms 33512 KB Output is correct
139 Correct 921 ms 35692 KB Output is correct
140 Correct 858 ms 37032 KB Output is correct
141 Correct 907 ms 34920 KB Output is correct
142 Correct 1077 ms 27068 KB Output is correct
143 Correct 828 ms 28896 KB Output is correct
144 Correct 883 ms 27084 KB Output is correct
145 Correct 825 ms 36960 KB Output is correct
146 Correct 852 ms 30332 KB Output is correct
147 Correct 899 ms 28824 KB Output is correct
148 Correct 929 ms 28208 KB Output is correct
149 Correct 817 ms 21948 KB Output is correct
150 Correct 804 ms 22008 KB Output is correct
151 Correct 818 ms 21752 KB Output is correct
152 Correct 831 ms 21736 KB Output is correct
153 Correct 805 ms 21744 KB Output is correct
154 Correct 869 ms 21928 KB Output is correct
155 Correct 1079 ms 27580 KB Output is correct
156 Correct 1040 ms 29012 KB Output is correct
157 Correct 911 ms 37456 KB Output is correct
158 Correct 835 ms 37852 KB Output is correct
159 Correct 954 ms 33760 KB Output is correct
160 Correct 995 ms 30564 KB Output is correct
161 Correct 1109 ms 28820 KB Output is correct
162 Correct 1123 ms 29020 KB Output is correct
163 Correct 1076 ms 29640 KB Output is correct
164 Correct 1054 ms 29468 KB Output is correct
165 Correct 1129 ms 29628 KB Output is correct
166 Correct 1037 ms 29492 KB Output is correct
167 Correct 739 ms 38368 KB Output is correct
168 Correct 784 ms 38364 KB Output is correct
169 Correct 796 ms 37052 KB Output is correct
170 Correct 822 ms 36636 KB Output is correct
171 Correct 868 ms 35168 KB Output is correct
172 Correct 936 ms 29928 KB Output is correct
173 Correct 779 ms 37344 KB Output is correct
174 Correct 833 ms 30448 KB Output is correct
175 Correct 859 ms 34936 KB Output is correct
176 Correct 907 ms 28540 KB Output is correct
177 Correct 939 ms 33808 KB Output is correct
178 Correct 833 ms 34020 KB Output is correct