oj.uz

Submission #805805

# Submission time Handle Problem Language Result Execution time Memory
805805 2023-08-03T23:59:06 Z farhan132 Segments (IZhO18_segments) C++17
100 / 100
 4051 ms 17260 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] && 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(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:74: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]
   74 |             for(ll i = 0; i < req[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~~~
segments.cpp:80: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]
   80 |             for(ll i = 0; i < R[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~
segments.cpp:86: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]
   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 'long long int'} and 'std::vector<std::pair<long long int, long long 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 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 788 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 8 ms 724 KB Output is correct
9 Correct 8 ms 724 KB Output is correct
10 Correct 9 ms 872 KB Output is correct
11 Correct 8 ms 664 KB Output is correct
12 Correct 8 ms 596 KB Output is correct
13 Correct 9 ms 852 KB Output is correct
14 Correct 7 ms 596 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 7 ms 468 KB Output is correct
18 Correct 10 ms 724 KB Output is correct
19 Correct 9 ms 468 KB Output is correct
20 Correct 7 ms 560 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 589 ms 4772 KB Output is correct
2 Correct 595 ms 4752 KB Output is correct
3 Correct 592 ms 4856 KB Output is correct
4 Correct 636 ms 5108 KB Output is correct
5 Correct 1051 ms 8948 KB Output is correct
6 Correct 1096 ms 9008 KB Output is correct
7 Correct 595 ms 4836 KB Output is correct
8 Correct 590 ms 4820 KB Output is correct
9 Correct 590 ms 4752 KB Output is correct
10 Correct 300 ms 2240 KB Output is correct
11 Correct 367 ms 2748 KB Output is correct
12 Correct 786 ms 7236 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 936 KB Output is correct
2 Correct 39 ms 972 KB Output is correct
3 Correct 81 ms 1052 KB Output is correct
4 Correct 41 ms 1100 KB Output is correct
5 Correct 805 ms 7360 KB Output is correct
6 Correct 688 ms 5528 KB Output is correct
7 Correct 720 ms 5840 KB Output is correct
8 Correct 1061 ms 8860 KB Output is correct
9 Correct 1060 ms 8820 KB Output is correct
10 Correct 747 ms 6140 KB Output is correct
11 Correct 143 ms 1448 KB Output is correct
12 Correct 767 ms 7236 KB Output is correct
13 Correct 690 ms 5576 KB Output is correct
14 Correct 394 ms 3392 KB Output is correct
15 Correct 375 ms 3100 KB Output is correct
16 Correct 271 ms 2524 KB Output is correct
17 Correct 582 ms 4804 KB Output is correct
18 Correct 562 ms 4836 KB Output is correct
19 Correct 565 ms 4976 KB Output is correct
20 Correct 566 ms 4792 KB Output is correct
21 Correct 159 ms 1600 KB Output is correct
22 Correct 476 ms 4352 KB Output is correct
23 Correct 585 ms 5100 KB Output is correct
24 Correct 493 ms 4520 KB Output is correct
25 Correct 61 ms 988 KB Output is correct
26 Correct 40 ms 972 KB Output is correct
27 Correct 55 ms 1012 KB Output is correct
28 Correct 45 ms 1004 KB Output is correct
29 Correct 633 ms 5372 KB Output is correct
30 Correct 639 ms 5504 KB Output is correct
31 Correct 1054 ms 8700 KB Output is correct
32 Correct 745 ms 6132 KB Output is correct
33 Correct 724 ms 5844 KB Output is correct
34 Correct 336 ms 3136 KB Output is correct
35 Correct 586 ms 5092 KB Output is correct
36 Correct 743 ms 6008 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 884 KB Output is correct
2 Correct 38 ms 928 KB Output is correct
3 Correct 38 ms 984 KB Output is correct
4 Correct 44 ms 988 KB Output is correct
5 Correct 876 ms 7668 KB Output is correct
6 Correct 276 ms 1828 KB Output is correct
7 Correct 941 ms 8088 KB Output is correct
8 Correct 320 ms 2296 KB Output is correct
9 Correct 448 ms 4276 KB Output is correct
10 Correct 827 ms 7580 KB Output is correct
11 Correct 229 ms 2140 KB Output is correct
12 Correct 1085 ms 8912 KB Output is correct
13 Correct 717 ms 5608 KB Output is correct
14 Correct 422 ms 3508 KB Output is correct
15 Correct 1044 ms 8568 KB Output is correct
16 Correct 729 ms 5984 KB Output is correct
17 Correct 582 ms 4776 KB Output is correct
18 Correct 602 ms 4788 KB Output is correct
19 Correct 589 ms 4824 KB Output is correct
20 Correct 581 ms 4808 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 788 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 8 ms 724 KB Output is correct
9 Correct 8 ms 724 KB Output is correct
10 Correct 9 ms 872 KB Output is correct
11 Correct 8 ms 664 KB Output is correct
12 Correct 8 ms 596 KB Output is correct
13 Correct 9 ms 852 KB Output is correct
14 Correct 7 ms 596 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 7 ms 468 KB Output is correct
18 Correct 10 ms 724 KB Output is correct
19 Correct 9 ms 468 KB Output is correct
20 Correct 7 ms 560 KB Output is correct
21 Correct 589 ms 4772 KB Output is correct
22 Correct 595 ms 4752 KB Output is correct
23 Correct 592 ms 4856 KB Output is correct
24 Correct 636 ms 5108 KB Output is correct
25 Correct 1051 ms 8948 KB Output is correct
26 Correct 1096 ms 9008 KB Output is correct
27 Correct 595 ms 4836 KB Output is correct
28 Correct 590 ms 4820 KB Output is correct
29 Correct 590 ms 4752 KB Output is correct
30 Correct 300 ms 2240 KB Output is correct
31 Correct 367 ms 2748 KB Output is correct
32 Correct 786 ms 7236 KB Output is correct
33 Correct 35 ms 884 KB Output is correct
34 Correct 38 ms 928 KB Output is correct
35 Correct 38 ms 984 KB Output is correct
36 Correct 44 ms 988 KB Output is correct
37 Correct 876 ms 7668 KB Output is correct
38 Correct 276 ms 1828 KB Output is correct
39 Correct 941 ms 8088 KB Output is correct
40 Correct 320 ms 2296 KB Output is correct
41 Correct 448 ms 4276 KB Output is correct
42 Correct 827 ms 7580 KB Output is correct
43 Correct 229 ms 2140 KB Output is correct
44 Correct 1085 ms 8912 KB Output is correct
45 Correct 717 ms 5608 KB Output is correct
46 Correct 422 ms 3508 KB Output is correct
47 Correct 1044 ms 8568 KB Output is correct
48 Correct 729 ms 5984 KB Output is correct
49 Correct 582 ms 4776 KB Output is correct
50 Correct 602 ms 4788 KB Output is correct
51 Correct 589 ms 4824 KB Output is correct
52 Correct 581 ms 4808 KB Output is correct
53 Correct 52 ms 932 KB Output is correct
54 Correct 48 ms 1016 KB Output is correct
55 Correct 36 ms 980 KB Output is correct
56 Correct 38 ms 912 KB Output is correct
57 Correct 410 ms 3088 KB Output is correct
58 Correct 211 ms 1424 KB Output is correct
59 Correct 688 ms 5612 KB Output is correct
60 Correct 203 ms 1416 KB Output is correct
61 Correct 688 ms 5676 KB Output is correct
62 Correct 992 ms 8352 KB Output is correct
63 Correct 1051 ms 8876 KB Output is correct
64 Correct 989 ms 8500 KB Output is correct
65 Correct 295 ms 2828 KB Output is correct
66 Correct 253 ms 2284 KB Output is correct
67 Correct 775 ms 5984 KB Output is correct
68 Correct 610 ms 5084 KB Output is correct
69 Correct 602 ms 4840 KB Output is correct
70 Correct 595 ms 4876 KB Output is correct
71 Correct 587 ms 4812 KB Output is correct
72 Correct 604 ms 4848 KB Output is correct
73 Correct 342 ms 3052 KB Output is correct
74 Correct 580 ms 4976 KB Output is correct
75 Correct 1132 ms 9304 KB Output is correct
76 Correct 1089 ms 8976 KB Output is correct
77 Correct 41 ms 972 KB Output is correct
78 Correct 37 ms 896 KB Output is correct
79 Correct 48 ms 1004 KB Output is correct
80 Correct 39 ms 948 KB Output is correct
81 Correct 591 ms 4916 KB Output is correct
82 Correct 334 ms 3092 KB Output is correct
83 Correct 234 ms 2088 KB Output is correct
84 Correct 555 ms 4912 KB Output is correct
85 Correct 759 ms 6024 KB Output is correct
86 Correct 825 ms 7168 KB Output is correct
87 Correct 470 ms 4260 KB Output is correct
88 Correct 232 ms 2140 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 788 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 8 ms 724 KB Output is correct
9 Correct 8 ms 724 KB Output is correct
10 Correct 9 ms 872 KB Output is correct
11 Correct 8 ms 664 KB Output is correct
12 Correct 8 ms 596 KB Output is correct
13 Correct 9 ms 852 KB Output is correct
14 Correct 7 ms 596 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 7 ms 468 KB Output is correct
18 Correct 10 ms 724 KB Output is correct
19 Correct 9 ms 468 KB Output is correct
20 Correct 7 ms 560 KB Output is correct
21 Correct 589 ms 4772 KB Output is correct
22 Correct 595 ms 4752 KB Output is correct
23 Correct 592 ms 4856 KB Output is correct
24 Correct 636 ms 5108 KB Output is correct
25 Correct 1051 ms 8948 KB Output is correct
26 Correct 1096 ms 9008 KB Output is correct
27 Correct 595 ms 4836 KB Output is correct
28 Correct 590 ms 4820 KB Output is correct
29 Correct 590 ms 4752 KB Output is correct
30 Correct 300 ms 2240 KB Output is correct
31 Correct 367 ms 2748 KB Output is correct
32 Correct 786 ms 7236 KB Output is correct
33 Correct 57 ms 936 KB Output is correct
34 Correct 39 ms 972 KB Output is correct
35 Correct 81 ms 1052 KB Output is correct
36 Correct 41 ms 1100 KB Output is correct
37 Correct 805 ms 7360 KB Output is correct
38 Correct 688 ms 5528 KB Output is correct
39 Correct 720 ms 5840 KB Output is correct
40 Correct 1061 ms 8860 KB Output is correct
41 Correct 1060 ms 8820 KB Output is correct
42 Correct 747 ms 6140 KB Output is correct
43 Correct 143 ms 1448 KB Output is correct
44 Correct 767 ms 7236 KB Output is correct
45 Correct 690 ms 5576 KB Output is correct
46 Correct 394 ms 3392 KB Output is correct
47 Correct 375 ms 3100 KB Output is correct
48 Correct 271 ms 2524 KB Output is correct
49 Correct 582 ms 4804 KB Output is correct
50 Correct 562 ms 4836 KB Output is correct
51 Correct 565 ms 4976 KB Output is correct
52 Correct 566 ms 4792 KB Output is correct
53 Correct 159 ms 1600 KB Output is correct
54 Correct 476 ms 4352 KB Output is correct
55 Correct 585 ms 5100 KB Output is correct
56 Correct 493 ms 4520 KB Output is correct
57 Correct 61 ms 988 KB Output is correct
58 Correct 40 ms 972 KB Output is correct
59 Correct 55 ms 1012 KB Output is correct
60 Correct 45 ms 1004 KB Output is correct
61 Correct 633 ms 5372 KB Output is correct
62 Correct 639 ms 5504 KB Output is correct
63 Correct 1054 ms 8700 KB Output is correct
64 Correct 745 ms 6132 KB Output is correct
65 Correct 724 ms 5844 KB Output is correct
66 Correct 336 ms 3136 KB Output is correct
67 Correct 586 ms 5092 KB Output is correct
68 Correct 743 ms 6008 KB Output is correct
69 Correct 35 ms 884 KB Output is correct
70 Correct 38 ms 928 KB Output is correct
71 Correct 38 ms 984 KB Output is correct
72 Correct 44 ms 988 KB Output is correct
73 Correct 876 ms 7668 KB Output is correct
74 Correct 276 ms 1828 KB Output is correct
75 Correct 941 ms 8088 KB Output is correct
76 Correct 320 ms 2296 KB Output is correct
77 Correct 448 ms 4276 KB Output is correct
78 Correct 827 ms 7580 KB Output is correct
79 Correct 229 ms 2140 KB Output is correct
80 Correct 1085 ms 8912 KB Output is correct
81 Correct 717 ms 5608 KB Output is correct
82 Correct 422 ms 3508 KB Output is correct
83 Correct 1044 ms 8568 KB Output is correct
84 Correct 729 ms 5984 KB Output is correct
85 Correct 582 ms 4776 KB Output is correct
86 Correct 602 ms 4788 KB Output is correct
87 Correct 589 ms 4824 KB Output is correct
88 Correct 581 ms 4808 KB Output is correct
89 Correct 52 ms 932 KB Output is correct
90 Correct 48 ms 1016 KB Output is correct
91 Correct 36 ms 980 KB Output is correct
92 Correct 38 ms 912 KB Output is correct
93 Correct 410 ms 3088 KB Output is correct
94 Correct 211 ms 1424 KB Output is correct
95 Correct 688 ms 5612 KB Output is correct
96 Correct 203 ms 1416 KB Output is correct
97 Correct 688 ms 5676 KB Output is correct
98 Correct 992 ms 8352 KB Output is correct
99 Correct 1051 ms 8876 KB Output is correct
100 Correct 989 ms 8500 KB Output is correct
101 Correct 295 ms 2828 KB Output is correct
102 Correct 253 ms 2284 KB Output is correct
103 Correct 775 ms 5984 KB Output is correct
104 Correct 610 ms 5084 KB Output is correct
105 Correct 602 ms 4840 KB Output is correct
106 Correct 595 ms 4876 KB Output is correct
107 Correct 587 ms 4812 KB Output is correct
108 Correct 604 ms 4848 KB Output is correct
109 Correct 342 ms 3052 KB Output is correct
110 Correct 580 ms 4976 KB Output is correct
111 Correct 1132 ms 9304 KB Output is correct
112 Correct 1089 ms 8976 KB Output is correct
113 Correct 41 ms 972 KB Output is correct
114 Correct 37 ms 896 KB Output is correct
115 Correct 48 ms 1004 KB Output is correct
116 Correct 39 ms 948 KB Output is correct
117 Correct 591 ms 4916 KB Output is correct
118 Correct 334 ms 3092 KB Output is correct
119 Correct 234 ms 2088 KB Output is correct
120 Correct 555 ms 4912 KB Output is correct
121 Correct 759 ms 6024 KB Output is correct
122 Correct 825 ms 7168 KB Output is correct
123 Correct 470 ms 4260 KB Output is correct
124 Correct 232 ms 2140 KB Output is correct
125 Correct 89 ms 1576 KB Output is correct
126 Correct 102 ms 1596 KB Output is correct
127 Correct 145 ms 1612 KB Output is correct
128 Correct 106 ms 1624 KB Output is correct
129 Correct 83 ms 1484 KB Output is correct
130 Correct 112 ms 1588 KB Output is correct
131 Correct 602 ms 2492 KB Output is correct
132 Correct 1880 ms 8336 KB Output is correct
133 Correct 2675 ms 11224 KB Output is correct
134 Correct 850 ms 3144 KB Output is correct
135 Correct 2917 ms 13976 KB Output is correct
136 Correct 311 ms 1484 KB Output is correct
137 Correct 3852 ms 16676 KB Output is correct
138 Correct 2382 ms 10236 KB Output is correct
139 Correct 3161 ms 14580 KB Output is correct
140 Correct 3644 ms 15884 KB Output is correct
141 Correct 2733 ms 11392 KB Output is correct
142 Correct 440 ms 2728 KB Output is correct
143 Correct 974 ms 5152 KB Output is correct
144 Correct 315 ms 2324 KB Output is correct
145 Correct 3614 ms 15884 KB Output is correct
146 Correct 1602 ms 8064 KB Output is correct
147 Correct 1036 ms 5292 KB Output is correct
148 Correct 933 ms 5076 KB Output is correct
149 Correct 2064 ms 9204 KB Output is correct
150 Correct 2054 ms 9140 KB Output is correct
151 Correct 2091 ms 9200 KB Output is correct
152 Correct 2110 ms 9200 KB Output is correct
153 Correct 2067 ms 9172 KB Output is correct
154 Correct 2070 ms 9224 KB Output is correct
155 Correct 636 ms 3664 KB Output is correct
156 Correct 1049 ms 5428 KB Output is correct
157 Correct 3737 ms 16016 KB Output is correct
158 Correct 3874 ms 16468 KB Output is correct
159 Correct 2528 ms 10728 KB Output is correct
160 Correct 1645 ms 8504 KB Output is correct
161 Correct 134 ms 1576 KB Output is correct
162 Correct 117 ms 1648 KB Output is correct
163 Correct 115 ms 1624 KB Output is correct
164 Correct 184 ms 1688 KB Output is correct
165 Correct 131 ms 1592 KB Output is correct
166 Correct 113 ms 1844 KB Output is correct
167 Correct 4051 ms 17260 KB Output is correct
168 Correct 4033 ms 17136 KB Output is correct
169 Correct 3643 ms 15876 KB Output is correct
170 Correct 3415 ms 15452 KB Output is correct
171 Correct 2685 ms 11508 KB Output is correct
172 Correct 1351 ms 6404 KB Output is correct
173 Correct 3747 ms 16256 KB Output is correct
174 Correct 1494 ms 6776 KB Output is correct
175 Correct 2955 ms 13908 KB Output is correct
176 Correct 909 ms 4924 KB Output is correct
177 Correct 2518 ms 10528 KB Output is correct
178 Correct 2322 ms 10084 KB Output is correct