oj.uz

Submission #805798

# Submission time Handle Problem Language Result Execution time Memory
805798 2023-08-03T23:45:38 Z farhan132 Segments (IZhO18_segments) C++17
100 / 100
 4027 ms 20804 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 long long 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()-1;
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]){
            bool done = 0;
            for(ll i = 0; i < req[block].size(); i++){
                if(req[block][i] == make_pair(l, r)){
                    req[block].erase(req[block].begin() + i);
                    done = 1;
                    break;
                }
            }
            if(!done) continue;
            S[block]--;
            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(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] && 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:72:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             for(ll i = 0; i < req[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~~~
segments.cpp:81:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |             for(ll i = 0; i < R[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~
segments.cpp:87:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |             for(ll i = 0; i < sz[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~~
segments.cpp: In function 'void build()':
segments.cpp:146:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |     for(ll i = 0; i < a.size(); i++){
      |                   ~~^~~~~~~~~~
segments.cpp: In function 'void solve()':
segments.cpp:180:26: warning: operation on 'cur' may be undefined [-Wsequence-point]
  180 |             cin >> range[++cur].ff >> range[cur].ss;
      |                          ^~~~~
segments.cpp: In function 'int main()':
segments.cpp:218:15: warning: unused variable 'CT' [-Wunused-variable]
  218 |     ll T = 1, CT = 0; //cin >> T;
      |               ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 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 724 KB Output is correct
6 Correct 9 ms 700 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 7 ms 724 KB Output is correct
9 Correct 7 ms 724 KB Output is correct
10 Correct 12 ms 836 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 12 ms 664 KB Output is correct
13 Correct 9 ms 852 KB Output is correct
14 Correct 11 ms 596 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 408 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 8 ms 724 KB Output is correct
19 Correct 6 ms 520 KB Output is correct
20 Correct 7 ms 556 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 606 ms 4836 KB Output is correct
2 Correct 583 ms 4812 KB Output is correct
3 Correct 601 ms 4808 KB Output is correct
4 Correct 647 ms 5168 KB Output is correct
5 Correct 1079 ms 8812 KB Output is correct
6 Correct 1140 ms 9024 KB Output is correct
7 Correct 623 ms 4896 KB Output is correct
8 Correct 602 ms 4796 KB Output is correct
9 Correct 612 ms 4736 KB Output is correct
10 Correct 330 ms 2220 KB Output is correct
11 Correct 390 ms 2708 KB Output is correct
12 Correct 801 ms 7216 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 916 KB Output is correct
2 Correct 32 ms 968 KB Output is correct
3 Correct 79 ms 952 KB Output is correct
4 Correct 35 ms 912 KB Output is correct
5 Correct 879 ms 7352 KB Output is correct
6 Correct 751 ms 5548 KB Output is correct
7 Correct 763 ms 5808 KB Output is correct
8 Correct 1065 ms 8848 KB Output is correct
9 Correct 1032 ms 8620 KB Output is correct
10 Correct 751 ms 6032 KB Output is correct
11 Correct 139 ms 1336 KB Output is correct
12 Correct 778 ms 7260 KB Output is correct
13 Correct 693 ms 5616 KB Output is correct
14 Correct 389 ms 3368 KB Output is correct
15 Correct 346 ms 3072 KB Output is correct
16 Correct 271 ms 2344 KB Output is correct
17 Correct 565 ms 4908 KB Output is correct
18 Correct 577 ms 4736 KB Output is correct
19 Correct 573 ms 4888 KB Output is correct
20 Correct 558 ms 4808 KB Output is correct
21 Correct 152 ms 1576 KB Output is correct
22 Correct 460 ms 4380 KB Output is correct
23 Correct 600 ms 5036 KB Output is correct
24 Correct 498 ms 4516 KB Output is correct
25 Correct 53 ms 976 KB Output is correct
26 Correct 39 ms 980 KB Output is correct
27 Correct 53 ms 980 KB Output is correct
28 Correct 41 ms 988 KB Output is correct
29 Correct 629 ms 5572 KB Output is correct
30 Correct 627 ms 5452 KB Output is correct
31 Correct 1057 ms 8716 KB Output is correct
32 Correct 752 ms 6148 KB Output is correct
33 Correct 704 ms 5740 KB Output is correct
34 Correct 340 ms 3068 KB Output is correct
35 Correct 578 ms 5092 KB Output is correct
36 Correct 753 ms 5992 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 972 KB Output is correct
2 Correct 35 ms 928 KB Output is correct
3 Correct 37 ms 928 KB Output is correct
4 Correct 41 ms 912 KB Output is correct
5 Correct 882 ms 7672 KB Output is correct
6 Correct 245 ms 1740 KB Output is correct
7 Correct 928 ms 8032 KB Output is correct
8 Correct 316 ms 2336 KB Output is correct
9 Correct 451 ms 4280 KB Output is correct
10 Correct 817 ms 7556 KB Output is correct
11 Correct 265 ms 2148 KB Output is correct
12 Correct 1074 ms 9100 KB Output is correct
13 Correct 693 ms 5568 KB Output is correct
14 Correct 450 ms 3504 KB Output is correct
15 Correct 1018 ms 8560 KB Output is correct
16 Correct 736 ms 5912 KB Output is correct
17 Correct 596 ms 4852 KB Output is correct
18 Correct 583 ms 4776 KB Output is correct
19 Correct 579 ms 4772 KB Output is correct
20 Correct 620 ms 4824 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 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 724 KB Output is correct
6 Correct 9 ms 700 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 7 ms 724 KB Output is correct
9 Correct 7 ms 724 KB Output is correct
10 Correct 12 ms 836 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 12 ms 664 KB Output is correct
13 Correct 9 ms 852 KB Output is correct
14 Correct 11 ms 596 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 408 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 8 ms 724 KB Output is correct
19 Correct 6 ms 520 KB Output is correct
20 Correct 7 ms 556 KB Output is correct
21 Correct 606 ms 4836 KB Output is correct
22 Correct 583 ms 4812 KB Output is correct
23 Correct 601 ms 4808 KB Output is correct
24 Correct 647 ms 5168 KB Output is correct
25 Correct 1079 ms 8812 KB Output is correct
26 Correct 1140 ms 9024 KB Output is correct
27 Correct 623 ms 4896 KB Output is correct
28 Correct 602 ms 4796 KB Output is correct
29 Correct 612 ms 4736 KB Output is correct
30 Correct 330 ms 2220 KB Output is correct
31 Correct 390 ms 2708 KB Output is correct
32 Correct 801 ms 7216 KB Output is correct
33 Correct 33 ms 972 KB Output is correct
34 Correct 35 ms 928 KB Output is correct
35 Correct 37 ms 928 KB Output is correct
36 Correct 41 ms 912 KB Output is correct
37 Correct 882 ms 7672 KB Output is correct
38 Correct 245 ms 1740 KB Output is correct
39 Correct 928 ms 8032 KB Output is correct
40 Correct 316 ms 2336 KB Output is correct
41 Correct 451 ms 4280 KB Output is correct
42 Correct 817 ms 7556 KB Output is correct
43 Correct 265 ms 2148 KB Output is correct
44 Correct 1074 ms 9100 KB Output is correct
45 Correct 693 ms 5568 KB Output is correct
46 Correct 450 ms 3504 KB Output is correct
47 Correct 1018 ms 8560 KB Output is correct
48 Correct 736 ms 5912 KB Output is correct
49 Correct 596 ms 4852 KB Output is correct
50 Correct 583 ms 4776 KB Output is correct
51 Correct 579 ms 4772 KB Output is correct
52 Correct 620 ms 4824 KB Output is correct
53 Correct 43 ms 936 KB Output is correct
54 Correct 45 ms 972 KB Output is correct
55 Correct 34 ms 872 KB Output is correct
56 Correct 35 ms 972 KB Output is correct
57 Correct 408 ms 3056 KB Output is correct
58 Correct 202 ms 1472 KB Output is correct
59 Correct 698 ms 5564 KB Output is correct
60 Correct 190 ms 1352 KB Output is correct
61 Correct 671 ms 5656 KB Output is correct
62 Correct 989 ms 8332 KB Output is correct
63 Correct 1062 ms 8980 KB Output is correct
64 Correct 1002 ms 8456 KB Output is correct
65 Correct 292 ms 2840 KB Output is correct
66 Correct 260 ms 2300 KB Output is correct
67 Correct 761 ms 5956 KB Output is correct
68 Correct 621 ms 5060 KB Output is correct
69 Correct 595 ms 4904 KB Output is correct
70 Correct 585 ms 4832 KB Output is correct
71 Correct 579 ms 4852 KB Output is correct
72 Correct 585 ms 4876 KB Output is correct
73 Correct 343 ms 3080 KB Output is correct
74 Correct 577 ms 4976 KB Output is correct
75 Correct 1152 ms 9020 KB Output is correct
76 Correct 1075 ms 8816 KB Output is correct
77 Correct 39 ms 972 KB Output is correct
78 Correct 35 ms 976 KB Output is correct
79 Correct 44 ms 1000 KB Output is correct
80 Correct 37 ms 992 KB Output is correct
81 Correct 554 ms 4856 KB Output is correct
82 Correct 329 ms 3072 KB Output is correct
83 Correct 215 ms 2100 KB Output is correct
84 Correct 557 ms 4892 KB Output is correct
85 Correct 763 ms 6016 KB Output is correct
86 Correct 791 ms 7320 KB Output is correct
87 Correct 457 ms 4304 KB Output is correct
88 Correct 232 ms 2148 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 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 724 KB Output is correct
6 Correct 9 ms 700 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 7 ms 724 KB Output is correct
9 Correct 7 ms 724 KB Output is correct
10 Correct 12 ms 836 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 12 ms 664 KB Output is correct
13 Correct 9 ms 852 KB Output is correct
14 Correct 11 ms 596 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 408 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 8 ms 724 KB Output is correct
19 Correct 6 ms 520 KB Output is correct
20 Correct 7 ms 556 KB Output is correct
21 Correct 606 ms 4836 KB Output is correct
22 Correct 583 ms 4812 KB Output is correct
23 Correct 601 ms 4808 KB Output is correct
24 Correct 647 ms 5168 KB Output is correct
25 Correct 1079 ms 8812 KB Output is correct
26 Correct 1140 ms 9024 KB Output is correct
27 Correct 623 ms 4896 KB Output is correct
28 Correct 602 ms 4796 KB Output is correct
29 Correct 612 ms 4736 KB Output is correct
30 Correct 330 ms 2220 KB Output is correct
31 Correct 390 ms 2708 KB Output is correct
32 Correct 801 ms 7216 KB Output is correct
33 Correct 69 ms 916 KB Output is correct
34 Correct 32 ms 968 KB Output is correct
35 Correct 79 ms 952 KB Output is correct
36 Correct 35 ms 912 KB Output is correct
37 Correct 879 ms 7352 KB Output is correct
38 Correct 751 ms 5548 KB Output is correct
39 Correct 763 ms 5808 KB Output is correct
40 Correct 1065 ms 8848 KB Output is correct
41 Correct 1032 ms 8620 KB Output is correct
42 Correct 751 ms 6032 KB Output is correct
43 Correct 139 ms 1336 KB Output is correct
44 Correct 778 ms 7260 KB Output is correct
45 Correct 693 ms 5616 KB Output is correct
46 Correct 389 ms 3368 KB Output is correct
47 Correct 346 ms 3072 KB Output is correct
48 Correct 271 ms 2344 KB Output is correct
49 Correct 565 ms 4908 KB Output is correct
50 Correct 577 ms 4736 KB Output is correct
51 Correct 573 ms 4888 KB Output is correct
52 Correct 558 ms 4808 KB Output is correct
53 Correct 152 ms 1576 KB Output is correct
54 Correct 460 ms 4380 KB Output is correct
55 Correct 600 ms 5036 KB Output is correct
56 Correct 498 ms 4516 KB Output is correct
57 Correct 53 ms 976 KB Output is correct
58 Correct 39 ms 980 KB Output is correct
59 Correct 53 ms 980 KB Output is correct
60 Correct 41 ms 988 KB Output is correct
61 Correct 629 ms 5572 KB Output is correct
62 Correct 627 ms 5452 KB Output is correct
63 Correct 1057 ms 8716 KB Output is correct
64 Correct 752 ms 6148 KB Output is correct
65 Correct 704 ms 5740 KB Output is correct
66 Correct 340 ms 3068 KB Output is correct
67 Correct 578 ms 5092 KB Output is correct
68 Correct 753 ms 5992 KB Output is correct
69 Correct 33 ms 972 KB Output is correct
70 Correct 35 ms 928 KB Output is correct
71 Correct 37 ms 928 KB Output is correct
72 Correct 41 ms 912 KB Output is correct
73 Correct 882 ms 7672 KB Output is correct
74 Correct 245 ms 1740 KB Output is correct
75 Correct 928 ms 8032 KB Output is correct
76 Correct 316 ms 2336 KB Output is correct
77 Correct 451 ms 4280 KB Output is correct
78 Correct 817 ms 7556 KB Output is correct
79 Correct 265 ms 2148 KB Output is correct
80 Correct 1074 ms 9100 KB Output is correct
81 Correct 693 ms 5568 KB Output is correct
82 Correct 450 ms 3504 KB Output is correct
83 Correct 1018 ms 8560 KB Output is correct
84 Correct 736 ms 5912 KB Output is correct
85 Correct 596 ms 4852 KB Output is correct
86 Correct 583 ms 4776 KB Output is correct
87 Correct 579 ms 4772 KB Output is correct
88 Correct 620 ms 4824 KB Output is correct
89 Correct 43 ms 936 KB Output is correct
90 Correct 45 ms 972 KB Output is correct
91 Correct 34 ms 872 KB Output is correct
92 Correct 35 ms 972 KB Output is correct
93 Correct 408 ms 3056 KB Output is correct
94 Correct 202 ms 1472 KB Output is correct
95 Correct 698 ms 5564 KB Output is correct
96 Correct 190 ms 1352 KB Output is correct
97 Correct 671 ms 5656 KB Output is correct
98 Correct 989 ms 8332 KB Output is correct
99 Correct 1062 ms 8980 KB Output is correct
100 Correct 1002 ms 8456 KB Output is correct
101 Correct 292 ms 2840 KB Output is correct
102 Correct 260 ms 2300 KB Output is correct
103 Correct 761 ms 5956 KB Output is correct
104 Correct 621 ms 5060 KB Output is correct
105 Correct 595 ms 4904 KB Output is correct
106 Correct 585 ms 4832 KB Output is correct
107 Correct 579 ms 4852 KB Output is correct
108 Correct 585 ms 4876 KB Output is correct
109 Correct 343 ms 3080 KB Output is correct
110 Correct 577 ms 4976 KB Output is correct
111 Correct 1152 ms 9020 KB Output is correct
112 Correct 1075 ms 8816 KB Output is correct
113 Correct 39 ms 972 KB Output is correct
114 Correct 35 ms 976 KB Output is correct
115 Correct 44 ms 1000 KB Output is correct
116 Correct 37 ms 992 KB Output is correct
117 Correct 554 ms 4856 KB Output is correct
118 Correct 329 ms 3072 KB Output is correct
119 Correct 215 ms 2100 KB Output is correct
120 Correct 557 ms 4892 KB Output is correct
121 Correct 763 ms 6016 KB Output is correct
122 Correct 791 ms 7320 KB Output is correct
123 Correct 457 ms 4304 KB Output is correct
124 Correct 232 ms 2148 KB Output is correct
125 Correct 84 ms 1584 KB Output is correct
126 Correct 92 ms 1596 KB Output is correct
127 Correct 137 ms 1648 KB Output is correct
128 Correct 107 ms 1584 KB Output is correct
129 Correct 87 ms 1504 KB Output is correct
130 Correct 107 ms 1588 KB Output is correct
131 Correct 604 ms 2500 KB Output is correct
132 Correct 1832 ms 8308 KB Output is correct
133 Correct 2672 ms 11304 KB Output is correct
134 Correct 842 ms 3268 KB Output is correct
135 Correct 2899 ms 13916 KB Output is correct
136 Correct 314 ms 1576 KB Output is correct
137 Correct 3887 ms 16552 KB Output is correct
138 Correct 2358 ms 10488 KB Output is correct
139 Correct 3069 ms 14476 KB Output is correct
140 Correct 3615 ms 15856 KB Output is correct
141 Correct 2677 ms 11508 KB Output is correct
142 Correct 413 ms 2764 KB Output is correct
143 Correct 966 ms 5188 KB Output is correct
144 Correct 322 ms 2352 KB Output is correct
145 Correct 3561 ms 15840 KB Output is correct
146 Correct 1573 ms 7944 KB Output is correct
147 Correct 1022 ms 5288 KB Output is correct
148 Correct 925 ms 5140 KB Output is correct
149 Correct 2071 ms 9308 KB Output is correct
150 Correct 2069 ms 9244 KB Output is correct
151 Correct 2094 ms 9252 KB Output is correct
152 Correct 2047 ms 9412 KB Output is correct
153 Correct 2071 ms 9180 KB Output is correct
154 Correct 2063 ms 9252 KB Output is correct
155 Correct 619 ms 3656 KB Output is correct
156 Correct 1054 ms 5520 KB Output is correct
157 Correct 3679 ms 16160 KB Output is correct
158 Correct 3727 ms 16416 KB Output is correct
159 Correct 2436 ms 10652 KB Output is correct
160 Correct 1635 ms 8200 KB Output is correct
161 Correct 127 ms 1576 KB Output is correct
162 Correct 125 ms 1592 KB Output is correct
163 Correct 109 ms 1588 KB Output is correct
164 Correct 191 ms 1788 KB Output is correct
165 Correct 123 ms 1684 KB Output is correct
166 Correct 115 ms 1612 KB Output is correct
167 Correct 3995 ms 16996 KB Output is correct
168 Correct 4027 ms 16992 KB Output is correct
169 Correct 3631 ms 15928 KB Output is correct
170 Correct 3433 ms 15364 KB Output is correct
171 Correct 2656 ms 11336 KB Output is correct
172 Correct 1378 ms 6356 KB Output is correct
173 Correct 3803 ms 20804 KB Output is correct
174 Correct 1491 ms 10996 KB Output is correct
175 Correct 2931 ms 18272 KB Output is correct
176 Correct 932 ms 9252 KB Output is correct
177 Correct 2437 ms 14880 KB Output is correct
178 Correct 2294 ms 14384 KB Output is correct