oj.uz

답안 #1031782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031782 2024-07-23T07:08:41 Z GrindMachine Segments (IZhO18_segments) C++17
100 / 100
 1153 ms 35560 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(){
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 11 ms 964 KB Output is correct
4 Correct 11 ms 936 KB Output is correct
5 Correct 18 ms 1372 KB Output is correct
6 Correct 11 ms 1176 KB Output is correct
7 Correct 14 ms 1192 KB Output is correct
8 Correct 11 ms 1112 KB Output is correct
9 Correct 10 ms 1176 KB Output is correct
10 Correct 13 ms 1408 KB Output is correct
11 Correct 10 ms 1012 KB Output is correct
12 Correct 12 ms 1004 KB Output is correct
13 Correct 12 ms 1372 KB Output is correct
14 Correct 12 ms 1184 KB Output is correct
15 Correct 12 ms 860 KB Output is correct
16 Correct 11 ms 860 KB Output is correct
17 Correct 14 ms 1116 KB Output is correct
18 Correct 19 ms 1372 KB Output is correct
19 Correct 11 ms 1116 KB Output is correct
20 Correct 11 ms 980 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 410 ms 9340 KB Output is correct
2 Correct 379 ms 11076 KB Output is correct
3 Correct 393 ms 11000 KB Output is correct
4 Correct 421 ms 11820 KB Output is correct
5 Correct 408 ms 18696 KB Output is correct
6 Correct 384 ms 18920 KB Output is correct
7 Correct 405 ms 10992 KB Output is correct
8 Correct 390 ms 11020 KB Output is correct
9 Correct 406 ms 11000 KB Output is correct
10 Correct 348 ms 5980 KB Output is correct
11 Correct 386 ms 7252 KB Output is correct
12 Correct 386 ms 14592 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 316 ms 13812 KB Output is correct
2 Correct 323 ms 13348 KB Output is correct
3 Correct 330 ms 14548 KB Output is correct
4 Correct 328 ms 14256 KB Output is correct
5 Correct 301 ms 14808 KB Output is correct
6 Correct 257 ms 12656 KB Output is correct
7 Correct 287 ms 14464 KB Output is correct
8 Correct 375 ms 18668 KB Output is correct
9 Correct 365 ms 18844 KB Output is correct
10 Correct 350 ms 17556 KB Output is correct
11 Correct 298 ms 13296 KB Output is correct
12 Correct 387 ms 17424 KB Output is correct
13 Correct 337 ms 16772 KB Output is correct
14 Correct 309 ms 14960 KB Output is correct
15 Correct 288 ms 15608 KB Output is correct
16 Correct 278 ms 14408 KB Output is correct
17 Correct 209 ms 10876 KB Output is correct
18 Correct 213 ms 10876 KB Output is correct
19 Correct 222 ms 10992 KB Output is correct
20 Correct 215 ms 10996 KB Output is correct
21 Correct 314 ms 13940 KB Output is correct
22 Correct 293 ms 15192 KB Output is correct
23 Correct 353 ms 17644 KB Output is correct
24 Correct 288 ms 15436 KB Output is correct
25 Correct 287 ms 14284 KB Output is correct
26 Correct 299 ms 14380 KB Output is correct
27 Correct 301 ms 14768 KB Output is correct
28 Correct 309 ms 14768 KB Output is correct
29 Correct 309 ms 16888 KB Output is correct
30 Correct 338 ms 16880 KB Output is correct
31 Correct 315 ms 19064 KB Output is correct
32 Correct 324 ms 17424 KB Output is correct
33 Correct 315 ms 17088 KB Output is correct
34 Correct 283 ms 14584 KB Output is correct
35 Correct 294 ms 16388 KB Output is correct
36 Correct 342 ms 17644 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 486 ms 14704 KB Output is correct
2 Correct 495 ms 14292 KB Output is correct
3 Correct 492 ms 14672 KB Output is correct
4 Correct 490 ms 14628 KB Output is correct
5 Correct 397 ms 15728 KB Output is correct
6 Correct 331 ms 5232 KB Output is correct
7 Correct 391 ms 16612 KB Output is correct
8 Correct 258 ms 6396 KB Output is correct
9 Correct 385 ms 15092 KB Output is correct
10 Correct 397 ms 17700 KB Output is correct
11 Correct 405 ms 13928 KB Output is correct
12 Correct 346 ms 19184 KB Output is correct
13 Correct 380 ms 16884 KB Output is correct
14 Correct 345 ms 15140 KB Output is correct
15 Correct 357 ms 18784 KB Output is correct
16 Correct 426 ms 17356 KB Output is correct
17 Correct 346 ms 11000 KB Output is correct
18 Correct 348 ms 10976 KB Output is correct
19 Correct 356 ms 11252 KB Output is correct
20 Correct 347 ms 11060 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 11 ms 964 KB Output is correct
4 Correct 11 ms 936 KB Output is correct
5 Correct 18 ms 1372 KB Output is correct
6 Correct 11 ms 1176 KB Output is correct
7 Correct 14 ms 1192 KB Output is correct
8 Correct 11 ms 1112 KB Output is correct
9 Correct 10 ms 1176 KB Output is correct
10 Correct 13 ms 1408 KB Output is correct
11 Correct 10 ms 1012 KB Output is correct
12 Correct 12 ms 1004 KB Output is correct
13 Correct 12 ms 1372 KB Output is correct
14 Correct 12 ms 1184 KB Output is correct
15 Correct 12 ms 860 KB Output is correct
16 Correct 11 ms 860 KB Output is correct
17 Correct 14 ms 1116 KB Output is correct
18 Correct 19 ms 1372 KB Output is correct
19 Correct 11 ms 1116 KB Output is correct
20 Correct 11 ms 980 KB Output is correct
21 Correct 410 ms 9340 KB Output is correct
22 Correct 379 ms 11076 KB Output is correct
23 Correct 393 ms 11000 KB Output is correct
24 Correct 421 ms 11820 KB Output is correct
25 Correct 408 ms 18696 KB Output is correct
26 Correct 384 ms 18920 KB Output is correct
27 Correct 405 ms 10992 KB Output is correct
28 Correct 390 ms 11020 KB Output is correct
29 Correct 406 ms 11000 KB Output is correct
30 Correct 348 ms 5980 KB Output is correct
31 Correct 386 ms 7252 KB Output is correct
32 Correct 386 ms 14592 KB Output is correct
33 Correct 486 ms 14704 KB Output is correct
34 Correct 495 ms 14292 KB Output is correct
35 Correct 492 ms 14672 KB Output is correct
36 Correct 490 ms 14628 KB Output is correct
37 Correct 397 ms 15728 KB Output is correct
38 Correct 331 ms 5232 KB Output is correct
39 Correct 391 ms 16612 KB Output is correct
40 Correct 258 ms 6396 KB Output is correct
41 Correct 385 ms 15092 KB Output is correct
42 Correct 397 ms 17700 KB Output is correct
43 Correct 405 ms 13928 KB Output is correct
44 Correct 346 ms 19184 KB Output is correct
45 Correct 380 ms 16884 KB Output is correct
46 Correct 345 ms 15140 KB Output is correct
47 Correct 357 ms 18784 KB Output is correct
48 Correct 426 ms 17356 KB Output is correct
49 Correct 346 ms 11000 KB Output is correct
50 Correct 348 ms 10976 KB Output is correct
51 Correct 356 ms 11252 KB Output is correct
52 Correct 347 ms 11060 KB Output is correct
53 Correct 462 ms 14396 KB Output is correct
54 Correct 445 ms 14556 KB Output is correct
55 Correct 464 ms 14832 KB Output is correct
56 Correct 460 ms 14836 KB Output is correct
57 Correct 396 ms 7212 KB Output is correct
58 Correct 213 ms 2388 KB Output is correct
59 Correct 401 ms 11252 KB Output is correct
60 Correct 248 ms 1876 KB Output is correct
61 Correct 382 ms 15588 KB Output is correct
62 Correct 356 ms 17540 KB Output is correct
63 Correct 357 ms 17556 KB Output is correct
64 Correct 345 ms 17388 KB Output is correct
65 Correct 379 ms 13128 KB Output is correct
66 Correct 367 ms 12524 KB Output is correct
67 Correct 385 ms 16192 KB Output is correct
68 Correct 358 ms 15100 KB Output is correct
69 Correct 353 ms 9472 KB Output is correct
70 Correct 343 ms 9232 KB Output is correct
71 Correct 331 ms 9232 KB Output is correct
72 Correct 338 ms 9460 KB Output is correct
73 Correct 406 ms 13052 KB Output is correct
74 Correct 392 ms 14840 KB Output is correct
75 Correct 369 ms 18332 KB Output is correct
76 Correct 333 ms 17720 KB Output is correct
77 Correct 462 ms 13304 KB Output is correct
78 Correct 432 ms 13328 KB Output is correct
79 Correct 461 ms 13060 KB Output is correct
80 Correct 458 ms 13312 KB Output is correct
81 Correct 394 ms 14328 KB Output is correct
82 Correct 399 ms 13152 KB Output is correct
83 Correct 409 ms 12776 KB Output is correct
84 Correct 398 ms 15124 KB Output is correct
85 Correct 356 ms 15904 KB Output is correct
86 Correct 374 ms 16108 KB Output is correct
87 Correct 368 ms 13812 KB Output is correct
88 Correct 388 ms 12884 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 11 ms 964 KB Output is correct
4 Correct 11 ms 936 KB Output is correct
5 Correct 18 ms 1372 KB Output is correct
6 Correct 11 ms 1176 KB Output is correct
7 Correct 14 ms 1192 KB Output is correct
8 Correct 11 ms 1112 KB Output is correct
9 Correct 10 ms 1176 KB Output is correct
10 Correct 13 ms 1408 KB Output is correct
11 Correct 10 ms 1012 KB Output is correct
12 Correct 12 ms 1004 KB Output is correct
13 Correct 12 ms 1372 KB Output is correct
14 Correct 12 ms 1184 KB Output is correct
15 Correct 12 ms 860 KB Output is correct
16 Correct 11 ms 860 KB Output is correct
17 Correct 14 ms 1116 KB Output is correct
18 Correct 19 ms 1372 KB Output is correct
19 Correct 11 ms 1116 KB Output is correct
20 Correct 11 ms 980 KB Output is correct
21 Correct 410 ms 9340 KB Output is correct
22 Correct 379 ms 11076 KB Output is correct
23 Correct 393 ms 11000 KB Output is correct
24 Correct 421 ms 11820 KB Output is correct
25 Correct 408 ms 18696 KB Output is correct
26 Correct 384 ms 18920 KB Output is correct
27 Correct 405 ms 10992 KB Output is correct
28 Correct 390 ms 11020 KB Output is correct
29 Correct 406 ms 11000 KB Output is correct
30 Correct 348 ms 5980 KB Output is correct
31 Correct 386 ms 7252 KB Output is correct
32 Correct 386 ms 14592 KB Output is correct
33 Correct 316 ms 13812 KB Output is correct
34 Correct 323 ms 13348 KB Output is correct
35 Correct 330 ms 14548 KB Output is correct
36 Correct 328 ms 14256 KB Output is correct
37 Correct 301 ms 14808 KB Output is correct
38 Correct 257 ms 12656 KB Output is correct
39 Correct 287 ms 14464 KB Output is correct
40 Correct 375 ms 18668 KB Output is correct
41 Correct 365 ms 18844 KB Output is correct
42 Correct 350 ms 17556 KB Output is correct
43 Correct 298 ms 13296 KB Output is correct
44 Correct 387 ms 17424 KB Output is correct
45 Correct 337 ms 16772 KB Output is correct
46 Correct 309 ms 14960 KB Output is correct
47 Correct 288 ms 15608 KB Output is correct
48 Correct 278 ms 14408 KB Output is correct
49 Correct 209 ms 10876 KB Output is correct
50 Correct 213 ms 10876 KB Output is correct
51 Correct 222 ms 10992 KB Output is correct
52 Correct 215 ms 10996 KB Output is correct
53 Correct 314 ms 13940 KB Output is correct
54 Correct 293 ms 15192 KB Output is correct
55 Correct 353 ms 17644 KB Output is correct
56 Correct 288 ms 15436 KB Output is correct
57 Correct 287 ms 14284 KB Output is correct
58 Correct 299 ms 14380 KB Output is correct
59 Correct 301 ms 14768 KB Output is correct
60 Correct 309 ms 14768 KB Output is correct
61 Correct 309 ms 16888 KB Output is correct
62 Correct 338 ms 16880 KB Output is correct
63 Correct 315 ms 19064 KB Output is correct
64 Correct 324 ms 17424 KB Output is correct
65 Correct 315 ms 17088 KB Output is correct
66 Correct 283 ms 14584 KB Output is correct
67 Correct 294 ms 16388 KB Output is correct
68 Correct 342 ms 17644 KB Output is correct
69 Correct 486 ms 14704 KB Output is correct
70 Correct 495 ms 14292 KB Output is correct
71 Correct 492 ms 14672 KB Output is correct
72 Correct 490 ms 14628 KB Output is correct
73 Correct 397 ms 15728 KB Output is correct
74 Correct 331 ms 5232 KB Output is correct
75 Correct 391 ms 16612 KB Output is correct
76 Correct 258 ms 6396 KB Output is correct
77 Correct 385 ms 15092 KB Output is correct
78 Correct 397 ms 17700 KB Output is correct
79 Correct 405 ms 13928 KB Output is correct
80 Correct 346 ms 19184 KB Output is correct
81 Correct 380 ms 16884 KB Output is correct
82 Correct 345 ms 15140 KB Output is correct
83 Correct 357 ms 18784 KB Output is correct
84 Correct 426 ms 17356 KB Output is correct
85 Correct 346 ms 11000 KB Output is correct
86 Correct 348 ms 10976 KB Output is correct
87 Correct 356 ms 11252 KB Output is correct
88 Correct 347 ms 11060 KB Output is correct
89 Correct 462 ms 14396 KB Output is correct
90 Correct 445 ms 14556 KB Output is correct
91 Correct 464 ms 14832 KB Output is correct
92 Correct 460 ms 14836 KB Output is correct
93 Correct 396 ms 7212 KB Output is correct
94 Correct 213 ms 2388 KB Output is correct
95 Correct 401 ms 11252 KB Output is correct
96 Correct 248 ms 1876 KB Output is correct
97 Correct 382 ms 15588 KB Output is correct
98 Correct 356 ms 17540 KB Output is correct
99 Correct 357 ms 17556 KB Output is correct
100 Correct 345 ms 17388 KB Output is correct
101 Correct 379 ms 13128 KB Output is correct
102 Correct 367 ms 12524 KB Output is correct
103 Correct 385 ms 16192 KB Output is correct
104 Correct 358 ms 15100 KB Output is correct
105 Correct 353 ms 9472 KB Output is correct
106 Correct 343 ms 9232 KB Output is correct
107 Correct 331 ms 9232 KB Output is correct
108 Correct 338 ms 9460 KB Output is correct
109 Correct 406 ms 13052 KB Output is correct
110 Correct 392 ms 14840 KB Output is correct
111 Correct 369 ms 18332 KB Output is correct
112 Correct 333 ms 17720 KB Output is correct
113 Correct 462 ms 13304 KB Output is correct
114 Correct 432 ms 13328 KB Output is correct
115 Correct 461 ms 13060 KB Output is correct
116 Correct 458 ms 13312 KB Output is correct
117 Correct 394 ms 14328 KB Output is correct
118 Correct 399 ms 13152 KB Output is correct
119 Correct 409 ms 12776 KB Output is correct
120 Correct 398 ms 15124 KB Output is correct
121 Correct 356 ms 15904 KB Output is correct
122 Correct 374 ms 16108 KB Output is correct
123 Correct 368 ms 13812 KB Output is correct
124 Correct 388 ms 12884 KB Output is correct
125 Correct 1123 ms 27324 KB Output is correct
126 Correct 1037 ms 26624 KB Output is correct
127 Correct 1055 ms 26884 KB Output is correct
128 Correct 1043 ms 26836 KB Output is correct
129 Correct 1047 ms 27008 KB Output is correct
130 Correct 1018 ms 26508 KB Output is correct
131 Correct 638 ms 4616 KB Output is correct
132 Correct 852 ms 16616 KB Output is correct
133 Correct 944 ms 23784 KB Output is correct
134 Correct 920 ms 6644 KB Output is correct
135 Correct 812 ms 26452 KB Output is correct
136 Correct 435 ms 1836 KB Output is correct
137 Correct 775 ms 34920 KB Output is correct
138 Correct 955 ms 31092 KB Output is correct
139 Correct 858 ms 32736 KB Output is correct
140 Correct 780 ms 34276 KB Output is correct
141 Correct 863 ms 32116 KB Output is correct
142 Correct 954 ms 24380 KB Output is correct
143 Correct 857 ms 26412 KB Output is correct
144 Correct 842 ms 24388 KB Output is correct
145 Correct 713 ms 34272 KB Output is correct
146 Correct 846 ms 27720 KB Output is correct
147 Correct 873 ms 26316 KB Output is correct
148 Correct 873 ms 25676 KB Output is correct
149 Correct 802 ms 18696 KB Output is correct
150 Correct 823 ms 18664 KB Output is correct
151 Correct 825 ms 18776 KB Output is correct
152 Correct 893 ms 18660 KB Output is correct
153 Correct 873 ms 18868 KB Output is correct
154 Correct 862 ms 18672 KB Output is correct
155 Correct 1058 ms 24912 KB Output is correct
156 Correct 1036 ms 26236 KB Output is correct
157 Correct 856 ms 34580 KB Output is correct
158 Correct 876 ms 35068 KB Output is correct
159 Correct 1004 ms 31036 KB Output is correct
160 Correct 988 ms 27988 KB Output is correct
161 Correct 1132 ms 26476 KB Output is correct
162 Correct 1130 ms 26392 KB Output is correct
163 Correct 1152 ms 27024 KB Output is correct
164 Correct 1146 ms 26908 KB Output is correct
165 Correct 1119 ms 26976 KB Output is correct
166 Correct 1153 ms 26728 KB Output is correct
167 Correct 832 ms 35556 KB Output is correct
168 Correct 839 ms 35560 KB Output is correct
169 Correct 833 ms 34268 KB Output is correct
170 Correct 866 ms 33696 KB Output is correct
171 Correct 907 ms 32328 KB Output is correct
172 Correct 1006 ms 27380 KB Output is correct
173 Correct 872 ms 34528 KB Output is correct
174 Correct 901 ms 27708 KB Output is correct
175 Correct 906 ms 32444 KB Output is correct
176 Correct 999 ms 25948 KB Output is correct
177 Correct 984 ms 31232 KB Output is correct
178 Correct 990 ms 31464 KB Output is correct