oj.uz

Submission #805811

# Submission time Handle Problem Language Result Execution time Memory
805811 2023-08-04T00:14:37 Z farhan132 Segments (IZhO18_segments) C++17
100 / 100
 3940 ms 8960 KB 
/***Farhan132***/
// #pragma GCC optimize("Ofast,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>
 
using namespace std;
 
typedef int ll;
typedef double dd;
typedef pair<ll , ll> ii;
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clz(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
const ll mod =  (ll) 998244353;
// const ll mod =  (ll) 1e9 + 7;
const ll inf = numeric_limits<int>::max()-5;
const ll INF = (ll)2e18;
 
// ll dx[]={0,1,0,-1};
// ll dy[]={1,0,-1,0};
// ll dxx[]={0,1,0,-1,1,1,-1,-1};
// ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 450;

vector < ll > R[450], sz[450];
vector < ii > req[450];
ll lx[450], rx[450], S[450]; ii range[450 * 450];
ll block_cnt = 1;

void add(ll l, ll r){
    for(ll block = 0; block < block_cnt; block++){
        if(lx[block] <= l && l <= rx[block]){
            S[block]++;
            R[block].pb(r);
            sz[block].pb(r - l + 1);
            req[block].pb({l, r});
            for(ll i = S[block] - 1; i >= 1; i--){
                if(R[block][i - 1] > R[block][i]) swap(R[block][i], R[block][i - 1]);
                if(sz[block][i - 1] > sz[block][i]) swap(sz[block][i], sz[block][i - 1]);
                if(req[block][i - 1] > req[block][i]) swap(req[block][i], req[block][i - 1]);
            }
            return;
        }
    }
}
void remove(ll l, ll r){
    // NOTE: must TLE for multiple l
    for(ll block = 0; block < block_cnt; block++){
        if(lx[block] <= l && l <= rx[block] && S[block]){
            auto it = lower_bound(req[block].begin(), req[block].begin() + S[block], make_pair(l, r)); 
            if(it == req[block].end() || *it !=  make_pair(l, r)) continue;
            S[block]--;
            for(ll i = 0; i < req[block].size(); i++){
                if(req[block][i] == make_pair(l, r)){
                    req[block].erase(req[block].begin() + i);
                    break;
                }
            }
            for(ll i = 0; i < R[block].size(); i++){
                if(R[block][i] == r){
                    R[block].erase(R[block].begin() + i);
                    break;
                }
            }
            for(ll i = 0; i < sz[block].size(); i++){
                if(sz[block][i] == r - l + 1){
                    sz[block].erase(sz[block].begin() + i);
                    break;
                }
            }
            return;
        }
    }
}
ll query(ll lastans, ll t){
    ll l, r, k; cin >> l >> r >> k;

    l ^= t * lastans;
    r ^= t * lastans;

    if(l > r) swap(l, r);
    if(r - l + 1 < k){
        return 0;
    } 

    ll ans = 0;
    if(k == 0){
        for(ll i = 0; i < block_cnt; i++) ans += req[i].size();
        return ans;
    }

    for(ll i = 0; i < block_cnt; i++){
        if( ((long long)lx[i]) + k - 1 > r) break;
        if(rx[i] <= l){
            if(!S[i]) continue;
            ans += (S[i] - (upper_bound(R[i].begin(), R[i].begin() + S[i], l + k - 2) - R[i].begin()));
            
            // for(auto u : R[i]){
            //     ans += (u >= l + k - 1);
            // }
            continue;
        }
        if(l <= lx[i] && ((long long) rx[i]) + k - 1 <= r){
            if(!S[i]) continue;
            ans += (S[i] - (upper_bound(sz[i].begin(), sz[i].begin() + S[i], k - 1) - sz[i].begin()));            
            continue;
        }

        for(auto [x, y] : req[i]){
            ans += ( (min(y, r) - max(l, x) + 1) >= k);
        }
    }
    return ans;
}
void build(){
    vector < ii > a;
    for(ll i = 0; i < block_cnt; i++){
        for(auto x : req[i]) a.pb(x);
        R[i].clear(); sz[i].clear(); req[i].clear();
        S[i] = 0;
    }
    sort(a.begin(), a.end());
    block_cnt = (a.size() - 1) / N; block_cnt++;
    for(ll i = 0; i < a.size(); i++){
        auto [l, r] = a[i];
        R[i / N].pb(r);
        sz[i / N].pb(r - l + 1);
        req[i / N].pb(a[i]);
        S[i / N]++;
    }

    for(ll i = 0; i < block_cnt; i++){
        sort(R[i].begin(), R[i].end());
        sort(sz[i].begin(), sz[i].end());
    }
    lx[0] = 0; rx[block_cnt - 1] = inf;
    for(ll i = 1; i < block_cnt; i++){
        lx[i] = rx[i - 1] = req[i][0].ff;
    }

    return;
}

void solve(){

    ll n, t; cin >> n >> t;

    ll changes = 0;

    ll cur = 0;
    lx[0] = 0; rx[0] = inf; S[0] = 0;
    ll lastans = 0;
    mem(S, 0);

    while(n--){
        ll T; cin >> T;
        if(T == 1){
            cin >> range[++cur].ff >> range[cur].ss;
            range[cur].ff ^= (t * lastans);
            range[cur].ss ^= (t * lastans);
            if(range[cur].ff > range[cur].ss) swap(range[cur].ff, range[cur].ss);
            add(range[cur].ff, range[cur].ss);
            changes++;
        }
        if(T == 2){
            ll id; cin >> id;
            remove(range[id].ff, range[id].ss);
        }
        if(T == 3){
            lastans = query(lastans, t);
            cout << lastans << '\n';
        }
        if(changes >= N){
            changes = 0;
            build();
        }
    }
    
   return;
}

int main() {

    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        auto start_time = clock();
    #else
         // freopen("subsequence.in", "r", stdin);
         // freopen("subsequence.out", "w", stdout); 
         ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif

    //precalc();
 
    ll T = 1, CT = 0; //cin >> T; 
 
    while(T--){
        // cout << "Case #" << ++CT << ": ";
        solve();
    }
    
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

segments.cpp: In function 'void remove(ll, ll)':
segments.cpp:74:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |             for(ll i = 0; i < req[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~~~
segments.cpp:80:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |             for(ll i = 0; i < R[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~
segments.cpp:86:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |             for(ll i = 0; i < sz[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~~
segments.cpp: In function 'void build()':
segments.cpp:145:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |     for(ll i = 0; i < a.size(); i++){
      |                   ~~^~~~~~~~~~
segments.cpp: In function 'void solve()':
segments.cpp:179:26: warning: operation on 'cur' may be undefined [-Wsequence-point]
  179 |             cin >> range[++cur].ff >> range[cur].ss;
      |                          ^~~~~
segments.cpp: In function 'int main()':
segments.cpp:217:15: warning: unused variable 'CT' [-Wunused-variable]
  217 |     ll T = 1, CT = 0; //cin >> T;
      |               ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 9 ms 588 KB Output is correct
6 Correct 10 ms 476 KB Output is correct
7 Correct 5 ms 424 KB Output is correct
8 Correct 8 ms 544 KB Output is correct
9 Correct 7 ms 520 KB Output is correct
10 Correct 9 ms 576 KB Output is correct
11 Correct 8 ms 468 KB Output is correct
12 Correct 8 ms 468 KB Output is correct
13 Correct 9 ms 580 KB Output is correct
14 Correct 7 ms 536 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 8 ms 588 KB Output is correct
19 Correct 6 ms 420 KB Output is correct
20 Correct 7 ms 388 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 571 ms 2564 KB Output is correct
2 Correct 566 ms 2492 KB Output is correct
3 Correct 592 ms 2612 KB Output is correct
4 Correct 634 ms 2704 KB Output is correct
5 Correct 1042 ms 4612 KB Output is correct
6 Correct 1102 ms 4752 KB Output is correct
7 Correct 585 ms 2588 KB Output is correct
8 Correct 584 ms 2476 KB Output is correct
9 Correct 564 ms 2584 KB Output is correct
10 Correct 292 ms 1468 KB Output is correct
11 Correct 360 ms 1580 KB Output is correct
12 Correct 770 ms 3872 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 716 KB Output is correct
2 Correct 34 ms 660 KB Output is correct
3 Correct 81 ms 764 KB Output is correct
4 Correct 37 ms 620 KB Output is correct
5 Correct 783 ms 3796 KB Output is correct
6 Correct 648 ms 2940 KB Output is correct
7 Correct 708 ms 3120 KB Output is correct
8 Correct 1121 ms 4592 KB Output is correct
9 Correct 1010 ms 4568 KB Output is correct
10 Correct 764 ms 3260 KB Output is correct
11 Correct 147 ms 960 KB Output is correct
12 Correct 766 ms 3832 KB Output is correct
13 Correct 666 ms 3064 KB Output is correct
14 Correct 383 ms 1920 KB Output is correct
15 Correct 337 ms 1820 KB Output is correct
16 Correct 263 ms 1436 KB Output is correct
17 Correct 549 ms 2528 KB Output is correct
18 Correct 550 ms 2528 KB Output is correct
19 Correct 545 ms 2612 KB Output is correct
20 Correct 549 ms 2608 KB Output is correct
21 Correct 158 ms 952 KB Output is correct
22 Correct 452 ms 2424 KB Output is correct
23 Correct 572 ms 2816 KB Output is correct
24 Correct 478 ms 2564 KB Output is correct
25 Correct 55 ms 644 KB Output is correct
26 Correct 40 ms 652 KB Output is correct
27 Correct 54 ms 716 KB Output is correct
28 Correct 46 ms 732 KB Output is correct
29 Correct 615 ms 2908 KB Output is correct
30 Correct 617 ms 2928 KB Output is correct
31 Correct 1022 ms 4672 KB Output is correct
32 Correct 780 ms 3204 KB Output is correct
33 Correct 694 ms 3120 KB Output is correct
34 Correct 336 ms 1796 KB Output is correct
35 Correct 587 ms 2888 KB Output is correct
36 Correct 733 ms 3272 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 676 KB Output is correct
2 Correct 48 ms 672 KB Output is correct
3 Correct 37 ms 712 KB Output is correct
4 Correct 43 ms 704 KB Output is correct
5 Correct 838 ms 4008 KB Output is correct
6 Correct 247 ms 1432 KB Output is correct
7 Correct 910 ms 4360 KB Output is correct
8 Correct 321 ms 1364 KB Output is correct
9 Correct 445 ms 2364 KB Output is correct
10 Correct 805 ms 3944 KB Output is correct
11 Correct 229 ms 1372 KB Output is correct
12 Correct 1074 ms 4716 KB Output is correct
13 Correct 672 ms 3092 KB Output is correct
14 Correct 415 ms 1984 KB Output is correct
15 Correct 1012 ms 4500 KB Output is correct
16 Correct 741 ms 3180 KB Output is correct
17 Correct 565 ms 2616 KB Output is correct
18 Correct 575 ms 2528 KB Output is correct
19 Correct 572 ms 2600 KB Output is correct
20 Correct 580 ms 2472 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 9 ms 588 KB Output is correct
6 Correct 10 ms 476 KB Output is correct
7 Correct 5 ms 424 KB Output is correct
8 Correct 8 ms 544 KB Output is correct
9 Correct 7 ms 520 KB Output is correct
10 Correct 9 ms 576 KB Output is correct
11 Correct 8 ms 468 KB Output is correct
12 Correct 8 ms 468 KB Output is correct
13 Correct 9 ms 580 KB Output is correct
14 Correct 7 ms 536 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 8 ms 588 KB Output is correct
19 Correct 6 ms 420 KB Output is correct
20 Correct 7 ms 388 KB Output is correct
21 Correct 571 ms 2564 KB Output is correct
22 Correct 566 ms 2492 KB Output is correct
23 Correct 592 ms 2612 KB Output is correct
24 Correct 634 ms 2704 KB Output is correct
25 Correct 1042 ms 4612 KB Output is correct
26 Correct 1102 ms 4752 KB Output is correct
27 Correct 585 ms 2588 KB Output is correct
28 Correct 584 ms 2476 KB Output is correct
29 Correct 564 ms 2584 KB Output is correct
30 Correct 292 ms 1468 KB Output is correct
31 Correct 360 ms 1580 KB Output is correct
32 Correct 770 ms 3872 KB Output is correct
33 Correct 46 ms 676 KB Output is correct
34 Correct 48 ms 672 KB Output is correct
35 Correct 37 ms 712 KB Output is correct
36 Correct 43 ms 704 KB Output is correct
37 Correct 838 ms 4008 KB Output is correct
38 Correct 247 ms 1432 KB Output is correct
39 Correct 910 ms 4360 KB Output is correct
40 Correct 321 ms 1364 KB Output is correct
41 Correct 445 ms 2364 KB Output is correct
42 Correct 805 ms 3944 KB Output is correct
43 Correct 229 ms 1372 KB Output is correct
44 Correct 1074 ms 4716 KB Output is correct
45 Correct 672 ms 3092 KB Output is correct
46 Correct 415 ms 1984 KB Output is correct
47 Correct 1012 ms 4500 KB Output is correct
48 Correct 741 ms 3180 KB Output is correct
49 Correct 565 ms 2616 KB Output is correct
50 Correct 575 ms 2528 KB Output is correct
51 Correct 572 ms 2600 KB Output is correct
52 Correct 580 ms 2472 KB Output is correct
53 Correct 52 ms 612 KB Output is correct
54 Correct 51 ms 672 KB Output is correct
55 Correct 41 ms 664 KB Output is correct
56 Correct 39 ms 688 KB Output is correct
57 Correct 424 ms 1724 KB Output is correct
58 Correct 214 ms 1276 KB Output is correct
59 Correct 706 ms 2960 KB Output is correct
60 Correct 202 ms 1152 KB Output is correct
61 Correct 681 ms 3084 KB Output is correct
62 Correct 985 ms 4368 KB Output is correct
63 Correct 1040 ms 4600 KB Output is correct
64 Correct 1040 ms 4472 KB Output is correct
65 Correct 289 ms 1640 KB Output is correct
66 Correct 255 ms 1432 KB Output is correct
67 Correct 737 ms 3404 KB Output is correct
68 Correct 608 ms 2840 KB Output is correct
69 Correct 568 ms 2496 KB Output is correct
70 Correct 567 ms 2544 KB Output is correct
71 Correct 563 ms 2576 KB Output is correct
72 Correct 564 ms 2532 KB Output is correct
73 Correct 334 ms 1824 KB Output is correct
74 Correct 555 ms 2704 KB Output is correct
75 Correct 1092 ms 4756 KB Output is correct
76 Correct 1059 ms 4644 KB Output is correct
77 Correct 49 ms 720 KB Output is correct
78 Correct 36 ms 588 KB Output is correct
79 Correct 46 ms 720 KB Output is correct
80 Correct 38 ms 648 KB Output is correct
81 Correct 540 ms 2740 KB Output is correct
82 Correct 326 ms 1764 KB Output is correct
83 Correct 224 ms 1572 KB Output is correct
84 Correct 560 ms 2692 KB Output is correct
85 Correct 734 ms 3244 KB Output is correct
86 Correct 801 ms 3816 KB Output is correct
87 Correct 454 ms 2384 KB Output is correct
88 Correct 241 ms 1316 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 9 ms 588 KB Output is correct
6 Correct 10 ms 476 KB Output is correct
7 Correct 5 ms 424 KB Output is correct
8 Correct 8 ms 544 KB Output is correct
9 Correct 7 ms 520 KB Output is correct
10 Correct 9 ms 576 KB Output is correct
11 Correct 8 ms 468 KB Output is correct
12 Correct 8 ms 468 KB Output is correct
13 Correct 9 ms 580 KB Output is correct
14 Correct 7 ms 536 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 8 ms 588 KB Output is correct
19 Correct 6 ms 420 KB Output is correct
20 Correct 7 ms 388 KB Output is correct
21 Correct 571 ms 2564 KB Output is correct
22 Correct 566 ms 2492 KB Output is correct
23 Correct 592 ms 2612 KB Output is correct
24 Correct 634 ms 2704 KB Output is correct
25 Correct 1042 ms 4612 KB Output is correct
26 Correct 1102 ms 4752 KB Output is correct
27 Correct 585 ms 2588 KB Output is correct
28 Correct 584 ms 2476 KB Output is correct
29 Correct 564 ms 2584 KB Output is correct
30 Correct 292 ms 1468 KB Output is correct
31 Correct 360 ms 1580 KB Output is correct
32 Correct 770 ms 3872 KB Output is correct
33 Correct 51 ms 716 KB Output is correct
34 Correct 34 ms 660 KB Output is correct
35 Correct 81 ms 764 KB Output is correct
36 Correct 37 ms 620 KB Output is correct
37 Correct 783 ms 3796 KB Output is correct
38 Correct 648 ms 2940 KB Output is correct
39 Correct 708 ms 3120 KB Output is correct
40 Correct 1121 ms 4592 KB Output is correct
41 Correct 1010 ms 4568 KB Output is correct
42 Correct 764 ms 3260 KB Output is correct
43 Correct 147 ms 960 KB Output is correct
44 Correct 766 ms 3832 KB Output is correct
45 Correct 666 ms 3064 KB Output is correct
46 Correct 383 ms 1920 KB Output is correct
47 Correct 337 ms 1820 KB Output is correct
48 Correct 263 ms 1436 KB Output is correct
49 Correct 549 ms 2528 KB Output is correct
50 Correct 550 ms 2528 KB Output is correct
51 Correct 545 ms 2612 KB Output is correct
52 Correct 549 ms 2608 KB Output is correct
53 Correct 158 ms 952 KB Output is correct
54 Correct 452 ms 2424 KB Output is correct
55 Correct 572 ms 2816 KB Output is correct
56 Correct 478 ms 2564 KB Output is correct
57 Correct 55 ms 644 KB Output is correct
58 Correct 40 ms 652 KB Output is correct
59 Correct 54 ms 716 KB Output is correct
60 Correct 46 ms 732 KB Output is correct
61 Correct 615 ms 2908 KB Output is correct
62 Correct 617 ms 2928 KB Output is correct
63 Correct 1022 ms 4672 KB Output is correct
64 Correct 780 ms 3204 KB Output is correct
65 Correct 694 ms 3120 KB Output is correct
66 Correct 336 ms 1796 KB Output is correct
67 Correct 587 ms 2888 KB Output is correct
68 Correct 733 ms 3272 KB Output is correct
69 Correct 46 ms 676 KB Output is correct
70 Correct 48 ms 672 KB Output is correct
71 Correct 37 ms 712 KB Output is correct
72 Correct 43 ms 704 KB Output is correct
73 Correct 838 ms 4008 KB Output is correct
74 Correct 247 ms 1432 KB Output is correct
75 Correct 910 ms 4360 KB Output is correct
76 Correct 321 ms 1364 KB Output is correct
77 Correct 445 ms 2364 KB Output is correct
78 Correct 805 ms 3944 KB Output is correct
79 Correct 229 ms 1372 KB Output is correct
80 Correct 1074 ms 4716 KB Output is correct
81 Correct 672 ms 3092 KB Output is correct
82 Correct 415 ms 1984 KB Output is correct
83 Correct 1012 ms 4500 KB Output is correct
84 Correct 741 ms 3180 KB Output is correct
85 Correct 565 ms 2616 KB Output is correct
86 Correct 575 ms 2528 KB Output is correct
87 Correct 572 ms 2600 KB Output is correct
88 Correct 580 ms 2472 KB Output is correct
89 Correct 52 ms 612 KB Output is correct
90 Correct 51 ms 672 KB Output is correct
91 Correct 41 ms 664 KB Output is correct
92 Correct 39 ms 688 KB Output is correct
93 Correct 424 ms 1724 KB Output is correct
94 Correct 214 ms 1276 KB Output is correct
95 Correct 706 ms 2960 KB Output is correct
96 Correct 202 ms 1152 KB Output is correct
97 Correct 681 ms 3084 KB Output is correct
98 Correct 985 ms 4368 KB Output is correct
99 Correct 1040 ms 4600 KB Output is correct
100 Correct 1040 ms 4472 KB Output is correct
101 Correct 289 ms 1640 KB Output is correct
102 Correct 255 ms 1432 KB Output is correct
103 Correct 737 ms 3404 KB Output is correct
104 Correct 608 ms 2840 KB Output is correct
105 Correct 568 ms 2496 KB Output is correct
106 Correct 567 ms 2544 KB Output is correct
107 Correct 563 ms 2576 KB Output is correct
108 Correct 564 ms 2532 KB Output is correct
109 Correct 334 ms 1824 KB Output is correct
110 Correct 555 ms 2704 KB Output is correct
111 Correct 1092 ms 4756 KB Output is correct
112 Correct 1059 ms 4644 KB Output is correct
113 Correct 49 ms 720 KB Output is correct
114 Correct 36 ms 588 KB Output is correct
115 Correct 46 ms 720 KB Output is correct
116 Correct 38 ms 648 KB Output is correct
117 Correct 540 ms 2740 KB Output is correct
118 Correct 326 ms 1764 KB Output is correct
119 Correct 224 ms 1572 KB Output is correct
120 Correct 560 ms 2692 KB Output is correct
121 Correct 734 ms 3244 KB Output is correct
122 Correct 801 ms 3816 KB Output is correct
123 Correct 454 ms 2384 KB Output is correct
124 Correct 241 ms 1316 KB Output is correct
125 Correct 95 ms 996 KB Output is correct
126 Correct 96 ms 972 KB Output is correct
127 Correct 149 ms 1080 KB Output is correct
128 Correct 105 ms 1092 KB Output is correct
129 Correct 78 ms 1004 KB Output is correct
130 Correct 116 ms 1008 KB Output is correct
131 Correct 601 ms 2048 KB Output is correct
132 Correct 1738 ms 4388 KB Output is correct
133 Correct 2587 ms 6020 KB Output is correct
134 Correct 819 ms 2216 KB Output is correct
135 Correct 2819 ms 7384 KB Output is correct
136 Correct 310 ms 1392 KB Output is correct
137 Correct 3754 ms 8748 KB Output is correct
138 Correct 2330 ms 5524 KB Output is correct
139 Correct 3064 ms 7484 KB Output is correct
140 Correct 3502 ms 8196 KB Output is correct
141 Correct 2631 ms 5920 KB Output is correct
142 Correct 423 ms 1704 KB Output is correct
143 Correct 958 ms 2888 KB Output is correct
144 Correct 317 ms 1528 KB Output is correct
145 Correct 3610 ms 8180 KB Output is correct
146 Correct 1548 ms 4320 KB Output is correct
147 Correct 1034 ms 2988 KB Output is correct
148 Correct 908 ms 2816 KB Output is correct
149 Correct 1997 ms 5012 KB Output is correct
150 Correct 1992 ms 4908 KB Output is correct
151 Correct 2029 ms 4912 KB Output is correct
152 Correct 1988 ms 4852 KB Output is correct
153 Correct 1986 ms 4880 KB Output is correct
154 Correct 1991 ms 4708 KB Output is correct
155 Correct 636 ms 2272 KB Output is correct
156 Correct 1022 ms 3112 KB Output is correct
157 Correct 3616 ms 8316 KB Output is correct
158 Correct 3686 ms 8520 KB Output is correct
159 Correct 2431 ms 5696 KB Output is correct
160 Correct 1604 ms 4560 KB Output is correct
161 Correct 130 ms 1060 KB Output is correct
162 Correct 118 ms 1104 KB Output is correct
163 Correct 115 ms 1016 KB Output is correct
164 Correct 186 ms 1100 KB Output is correct
165 Correct 129 ms 1064 KB Output is correct
166 Correct 105 ms 1056 KB Output is correct
167 Correct 3940 ms 8960 KB Output is correct
168 Correct 3853 ms 8772 KB Output is correct
169 Correct 3491 ms 8176 KB Output is correct
170 Correct 3295 ms 7952 KB Output is correct
171 Correct 2700 ms 5936 KB Output is correct
172 Correct 1364 ms 3516 KB Output is correct
173 Correct 3584 ms 8312 KB Output is correct
174 Correct 1459 ms 3648 KB Output is correct
175 Correct 2811 ms 7232 KB Output is correct
176 Correct 892 ms 2828 KB Output is correct
177 Correct 2389 ms 5548 KB Output is correct
178 Correct 2222 ms 5476 KB Output is correct