oj.uz

Submission #805797

# Submission time Handle Problem Language Result Execution time Memory
805797 2023-08-03T23:44:53 Z farhan132 Segments (IZhO18_segments) C++17
100 / 100
 4305 ms 21504 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].end(), 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 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 9 ms 736 KB Output is correct
6 Correct 10 ms 800 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 9 ms 724 KB Output is correct
9 Correct 8 ms 724 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 8 ms 660 KB Output is correct
13 Correct 9 ms 788 KB Output is correct
14 Correct 8 ms 596 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 9 ms 724 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 6 ms 560 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 959 ms 4928 KB Output is correct
2 Correct 986 ms 4752 KB Output is correct
3 Correct 963 ms 4788 KB Output is correct
4 Correct 1014 ms 5168 KB Output is correct
5 Correct 1177 ms 9012 KB Output is correct
6 Correct 1172 ms 8992 KB Output is correct
7 Correct 971 ms 4840 KB Output is correct
8 Correct 941 ms 4736 KB Output is correct
9 Correct 953 ms 4744 KB Output is correct
10 Correct 505 ms 2212 KB Output is correct
11 Correct 648 ms 2692 KB Output is correct
12 Correct 1131 ms 7260 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 1028 KB Output is correct
2 Correct 33 ms 956 KB Output is correct
3 Correct 81 ms 944 KB Output is correct
4 Correct 37 ms 896 KB Output is correct
5 Correct 1487 ms 7308 KB Output is correct
6 Correct 1546 ms 5552 KB Output is correct
7 Correct 1511 ms 5884 KB Output is correct
8 Correct 1279 ms 8864 KB Output is correct
9 Correct 1163 ms 8616 KB Output is correct
10 Correct 1014 ms 6128 KB Output is correct
11 Correct 161 ms 1360 KB Output is correct
12 Correct 1086 ms 7216 KB Output is correct
13 Correct 920 ms 5628 KB Output is correct
14 Correct 558 ms 3400 KB Output is correct
15 Correct 481 ms 3132 KB Output is correct
16 Correct 382 ms 2312 KB Output is correct
17 Correct 1439 ms 4820 KB Output is correct
18 Correct 1419 ms 4940 KB Output is correct
19 Correct 1430 ms 4860 KB Output is correct
20 Correct 1402 ms 4904 KB Output is correct
21 Correct 197 ms 1588 KB Output is correct
22 Correct 733 ms 4368 KB Output is correct
23 Correct 888 ms 5068 KB Output is correct
24 Correct 755 ms 4500 KB Output is correct
25 Correct 54 ms 968 KB Output is correct
26 Correct 42 ms 964 KB Output is correct
27 Correct 52 ms 1028 KB Output is correct
28 Correct 57 ms 912 KB Output is correct
29 Correct 1008 ms 5488 KB Output is correct
30 Correct 930 ms 5460 KB Output is correct
31 Correct 1162 ms 8652 KB Output is correct
32 Correct 1032 ms 6124 KB Output is correct
33 Correct 924 ms 5768 KB Output is correct
34 Correct 495 ms 3164 KB Output is correct
35 Correct 818 ms 5164 KB Output is correct
36 Correct 983 ms 5988 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 972 KB Output is correct
2 Correct 36 ms 920 KB Output is correct
3 Correct 35 ms 980 KB Output is correct
4 Correct 42 ms 888 KB Output is correct
5 Correct 1149 ms 7684 KB Output is correct
6 Correct 410 ms 1672 KB Output is correct
7 Correct 1179 ms 8048 KB Output is correct
8 Correct 523 ms 2348 KB Output is correct
9 Correct 583 ms 4272 KB Output is correct
10 Correct 965 ms 7500 KB Output is correct
11 Correct 284 ms 2132 KB Output is correct
12 Correct 1222 ms 8912 KB Output is correct
13 Correct 839 ms 5564 KB Output is correct
14 Correct 512 ms 3504 KB Output is correct
15 Correct 1165 ms 8552 KB Output is correct
16 Correct 907 ms 5916 KB Output is correct
17 Correct 1063 ms 4784 KB Output is correct
18 Correct 965 ms 4824 KB Output is correct
19 Correct 966 ms 4776 KB Output is correct
20 Correct 982 ms 4808 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 0 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 9 ms 736 KB Output is correct
6 Correct 10 ms 800 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 9 ms 724 KB Output is correct
9 Correct 8 ms 724 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 8 ms 660 KB Output is correct
13 Correct 9 ms 788 KB Output is correct
14 Correct 8 ms 596 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 9 ms 724 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 6 ms 560 KB Output is correct
21 Correct 959 ms 4928 KB Output is correct
22 Correct 986 ms 4752 KB Output is correct
23 Correct 963 ms 4788 KB Output is correct
24 Correct 1014 ms 5168 KB Output is correct
25 Correct 1177 ms 9012 KB Output is correct
26 Correct 1172 ms 8992 KB Output is correct
27 Correct 971 ms 4840 KB Output is correct
28 Correct 941 ms 4736 KB Output is correct
29 Correct 953 ms 4744 KB Output is correct
30 Correct 505 ms 2212 KB Output is correct
31 Correct 648 ms 2692 KB Output is correct
32 Correct 1131 ms 7260 KB Output is correct
33 Correct 36 ms 972 KB Output is correct
34 Correct 36 ms 920 KB Output is correct
35 Correct 35 ms 980 KB Output is correct
36 Correct 42 ms 888 KB Output is correct
37 Correct 1149 ms 7684 KB Output is correct
38 Correct 410 ms 1672 KB Output is correct
39 Correct 1179 ms 8048 KB Output is correct
40 Correct 523 ms 2348 KB Output is correct
41 Correct 583 ms 4272 KB Output is correct
42 Correct 965 ms 7500 KB Output is correct
43 Correct 284 ms 2132 KB Output is correct
44 Correct 1222 ms 8912 KB Output is correct
45 Correct 839 ms 5564 KB Output is correct
46 Correct 512 ms 3504 KB Output is correct
47 Correct 1165 ms 8552 KB Output is correct
48 Correct 907 ms 5916 KB Output is correct
49 Correct 1063 ms 4784 KB Output is correct
50 Correct 965 ms 4824 KB Output is correct
51 Correct 966 ms 4776 KB Output is correct
52 Correct 982 ms 4808 KB Output is correct
53 Correct 47 ms 956 KB Output is correct
54 Correct 46 ms 916 KB Output is correct
55 Correct 35 ms 980 KB Output is correct
56 Correct 36 ms 872 KB Output is correct
57 Correct 729 ms 3096 KB Output is correct
58 Correct 300 ms 1488 KB Output is correct
59 Correct 1078 ms 5568 KB Output is correct
60 Correct 273 ms 1416 KB Output is correct
61 Correct 818 ms 5612 KB Output is correct
62 Correct 1068 ms 8368 KB Output is correct
63 Correct 1113 ms 8780 KB Output is correct
64 Correct 1089 ms 8448 KB Output is correct
65 Correct 366 ms 2808 KB Output is correct
66 Correct 312 ms 2268 KB Output is correct
67 Correct 858 ms 6056 KB Output is correct
68 Correct 712 ms 5092 KB Output is correct
69 Correct 973 ms 5060 KB Output is correct
70 Correct 968 ms 4816 KB Output is correct
71 Correct 958 ms 4816 KB Output is correct
72 Correct 974 ms 4764 KB Output is correct
73 Correct 416 ms 3056 KB Output is correct
74 Correct 713 ms 4948 KB Output is correct
75 Correct 1176 ms 9036 KB Output is correct
76 Correct 1115 ms 8780 KB Output is correct
77 Correct 40 ms 876 KB Output is correct
78 Correct 36 ms 896 KB Output is correct
79 Correct 46 ms 940 KB Output is correct
80 Correct 37 ms 912 KB Output is correct
81 Correct 724 ms 4852 KB Output is correct
82 Correct 471 ms 3044 KB Output is correct
83 Correct 262 ms 2084 KB Output is correct
84 Correct 692 ms 5028 KB Output is correct
85 Correct 886 ms 6052 KB Output is correct
86 Correct 947 ms 7160 KB Output is correct
87 Correct 568 ms 4284 KB Output is correct
88 Correct 274 ms 2168 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 0 ms 340 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 9 ms 736 KB Output is correct
6 Correct 10 ms 800 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 9 ms 724 KB Output is correct
9 Correct 8 ms 724 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 8 ms 660 KB Output is correct
13 Correct 9 ms 788 KB Output is correct
14 Correct 8 ms 596 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 9 ms 724 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 6 ms 560 KB Output is correct
21 Correct 959 ms 4928 KB Output is correct
22 Correct 986 ms 4752 KB Output is correct
23 Correct 963 ms 4788 KB Output is correct
24 Correct 1014 ms 5168 KB Output is correct
25 Correct 1177 ms 9012 KB Output is correct
26 Correct 1172 ms 8992 KB Output is correct
27 Correct 971 ms 4840 KB Output is correct
28 Correct 941 ms 4736 KB Output is correct
29 Correct 953 ms 4744 KB Output is correct
30 Correct 505 ms 2212 KB Output is correct
31 Correct 648 ms 2692 KB Output is correct
32 Correct 1131 ms 7260 KB Output is correct
33 Correct 65 ms 1028 KB Output is correct
34 Correct 33 ms 956 KB Output is correct
35 Correct 81 ms 944 KB Output is correct
36 Correct 37 ms 896 KB Output is correct
37 Correct 1487 ms 7308 KB Output is correct
38 Correct 1546 ms 5552 KB Output is correct
39 Correct 1511 ms 5884 KB Output is correct
40 Correct 1279 ms 8864 KB Output is correct
41 Correct 1163 ms 8616 KB Output is correct
42 Correct 1014 ms 6128 KB Output is correct
43 Correct 161 ms 1360 KB Output is correct
44 Correct 1086 ms 7216 KB Output is correct
45 Correct 920 ms 5628 KB Output is correct
46 Correct 558 ms 3400 KB Output is correct
47 Correct 481 ms 3132 KB Output is correct
48 Correct 382 ms 2312 KB Output is correct
49 Correct 1439 ms 4820 KB Output is correct
50 Correct 1419 ms 4940 KB Output is correct
51 Correct 1430 ms 4860 KB Output is correct
52 Correct 1402 ms 4904 KB Output is correct
53 Correct 197 ms 1588 KB Output is correct
54 Correct 733 ms 4368 KB Output is correct
55 Correct 888 ms 5068 KB Output is correct
56 Correct 755 ms 4500 KB Output is correct
57 Correct 54 ms 968 KB Output is correct
58 Correct 42 ms 964 KB Output is correct
59 Correct 52 ms 1028 KB Output is correct
60 Correct 57 ms 912 KB Output is correct
61 Correct 1008 ms 5488 KB Output is correct
62 Correct 930 ms 5460 KB Output is correct
63 Correct 1162 ms 8652 KB Output is correct
64 Correct 1032 ms 6124 KB Output is correct
65 Correct 924 ms 5768 KB Output is correct
66 Correct 495 ms 3164 KB Output is correct
67 Correct 818 ms 5164 KB Output is correct
68 Correct 983 ms 5988 KB Output is correct
69 Correct 36 ms 972 KB Output is correct
70 Correct 36 ms 920 KB Output is correct
71 Correct 35 ms 980 KB Output is correct
72 Correct 42 ms 888 KB Output is correct
73 Correct 1149 ms 7684 KB Output is correct
74 Correct 410 ms 1672 KB Output is correct
75 Correct 1179 ms 8048 KB Output is correct
76 Correct 523 ms 2348 KB Output is correct
77 Correct 583 ms 4272 KB Output is correct
78 Correct 965 ms 7500 KB Output is correct
79 Correct 284 ms 2132 KB Output is correct
80 Correct 1222 ms 8912 KB Output is correct
81 Correct 839 ms 5564 KB Output is correct
82 Correct 512 ms 3504 KB Output is correct
83 Correct 1165 ms 8552 KB Output is correct
84 Correct 907 ms 5916 KB Output is correct
85 Correct 1063 ms 4784 KB Output is correct
86 Correct 965 ms 4824 KB Output is correct
87 Correct 966 ms 4776 KB Output is correct
88 Correct 982 ms 4808 KB Output is correct
89 Correct 47 ms 956 KB Output is correct
90 Correct 46 ms 916 KB Output is correct
91 Correct 35 ms 980 KB Output is correct
92 Correct 36 ms 872 KB Output is correct
93 Correct 729 ms 3096 KB Output is correct
94 Correct 300 ms 1488 KB Output is correct
95 Correct 1078 ms 5568 KB Output is correct
96 Correct 273 ms 1416 KB Output is correct
97 Correct 818 ms 5612 KB Output is correct
98 Correct 1068 ms 8368 KB Output is correct
99 Correct 1113 ms 8780 KB Output is correct
100 Correct 1089 ms 8448 KB Output is correct
101 Correct 366 ms 2808 KB Output is correct
102 Correct 312 ms 2268 KB Output is correct
103 Correct 858 ms 6056 KB Output is correct
104 Correct 712 ms 5092 KB Output is correct
105 Correct 973 ms 5060 KB Output is correct
106 Correct 968 ms 4816 KB Output is correct
107 Correct 958 ms 4816 KB Output is correct
108 Correct 974 ms 4764 KB Output is correct
109 Correct 416 ms 3056 KB Output is correct
110 Correct 713 ms 4948 KB Output is correct
111 Correct 1176 ms 9036 KB Output is correct
112 Correct 1115 ms 8780 KB Output is correct
113 Correct 40 ms 876 KB Output is correct
114 Correct 36 ms 896 KB Output is correct
115 Correct 46 ms 940 KB Output is correct
116 Correct 37 ms 912 KB Output is correct
117 Correct 724 ms 4852 KB Output is correct
118 Correct 471 ms 3044 KB Output is correct
119 Correct 262 ms 2084 KB Output is correct
120 Correct 692 ms 5028 KB Output is correct
121 Correct 886 ms 6052 KB Output is correct
122 Correct 947 ms 7160 KB Output is correct
123 Correct 568 ms 4284 KB Output is correct
124 Correct 274 ms 2168 KB Output is correct
125 Correct 86 ms 1544 KB Output is correct
126 Correct 94 ms 1536 KB Output is correct
127 Correct 142 ms 1580 KB Output is correct
128 Correct 103 ms 1576 KB Output is correct
129 Correct 77 ms 1524 KB Output is correct
130 Correct 111 ms 1604 KB Output is correct
131 Correct 1083 ms 2536 KB Output is correct
132 Correct 3354 ms 8320 KB Output is correct
133 Correct 4130 ms 14252 KB Output is correct
134 Correct 1642 ms 9180 KB Output is correct
135 Correct 4291 ms 17232 KB Output is correct
136 Correct 361 ms 7792 KB Output is correct
137 Correct 4253 ms 21068 KB Output is correct
138 Correct 2936 ms 14624 KB Output is correct
139 Correct 3596 ms 18872 KB Output is correct
140 Correct 4008 ms 20284 KB Output is correct
141 Correct 3209 ms 15768 KB Output is correct
142 Correct 501 ms 6940 KB Output is correct
143 Correct 1248 ms 9332 KB Output is correct
144 Correct 340 ms 6496 KB Output is correct
145 Correct 3978 ms 20236 KB Output is correct
146 Correct 2015 ms 12296 KB Output is correct
147 Correct 1314 ms 9528 KB Output is correct
148 Correct 1195 ms 9228 KB Output is correct
149 Correct 3623 ms 11676 KB Output is correct
150 Correct 3660 ms 11728 KB Output is correct
151 Correct 3598 ms 11824 KB Output is correct
152 Correct 3619 ms 11724 KB Output is correct
153 Correct 3591 ms 11728 KB Output is correct
154 Correct 3662 ms 11820 KB Output is correct
155 Correct 802 ms 7804 KB Output is correct
156 Correct 1397 ms 9772 KB Output is correct
157 Correct 4042 ms 20480 KB Output is correct
158 Correct 4150 ms 20848 KB Output is correct
159 Correct 2950 ms 15116 KB Output is correct
160 Correct 2130 ms 12500 KB Output is correct
161 Correct 141 ms 5816 KB Output is correct
162 Correct 116 ms 5796 KB Output is correct
163 Correct 138 ms 5756 KB Output is correct
164 Correct 181 ms 5916 KB Output is correct
165 Correct 132 ms 5756 KB Output is correct
166 Correct 104 ms 5748 KB Output is correct
167 Correct 4305 ms 21504 KB Output is correct
168 Correct 4221 ms 21504 KB Output is correct
169 Correct 4019 ms 20492 KB Output is correct
170 Correct 3877 ms 19892 KB Output is correct
171 Correct 3232 ms 15704 KB Output is correct
172 Correct 1773 ms 10624 KB Output is correct
173 Correct 4066 ms 16184 KB Output is correct
174 Correct 1897 ms 6772 KB Output is correct
175 Correct 3430 ms 13936 KB Output is correct
176 Correct 1177 ms 4956 KB Output is correct
177 Correct 2949 ms 10556 KB Output is correct
178 Correct 2781 ms 10064 KB Output is correct