oj.uz

Submission #805777

# Submission time Handle Problem Language Result Execution time Memory
805777 2023-08-03T23:13:36 Z farhan132 Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 11392 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]; 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]){
            R[block].pb(r);
            sz[block].pb(r - l + 1);
            req[block].pb({l, r});
            for(ll i = 1; i < R[block].size(); 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;
            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){
        //     ans += (R[i].end() - lower_bound(R[i].begin(), R[i].end(), l + k - 1));
        //     continue;
        // }
        // if(l <= lx[i] && rx[i] + k - 1 <= r){
        //     ans += (sz[i].end() - lower_bound(sz[i].begin(), sz[i].end(), k));            
        //     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();
    }
    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]);
    }

    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;
    ll lastans = 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 add(ll, ll)':
segments.cpp:57: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]
   57 |             for(ll i = 1; i < R[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~
segments.cpp: In function 'void remove(ll, ll)':
segments.cpp:71: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]
   71 |             for(ll i = 0; i < req[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~~~
segments.cpp:79: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]
   79 |             for(ll i = 0; i < R[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~
segments.cpp:85: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]
   85 |             for(ll i = 0; i < sz[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~~
segments.cpp: In function 'void build()':
segments.cpp:137: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]
  137 |     for(ll i = 0; i < a.size(); i++){
      |                   ~~^~~~~~~~~~
segments.cpp: In function 'void solve()':
segments.cpp:169:26: warning: operation on 'cur' may be undefined [-Wsequence-point]
  169 |             cin >> range[++cur].ff >> range[cur].ss;
      |                          ^~~~~
segments.cpp: In function 'int main()':
segments.cpp:207:15: warning: unused variable 'CT' [-Wunused-variable]
  207 |     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 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 10 ms 724 KB Output is correct
6 Correct 11 ms 724 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 8 ms 696 KB Output is correct
9 Correct 8 ms 724 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 11 ms 596 KB Output is correct
12 Correct 11 ms 596 KB Output is correct
13 Correct 9 ms 852 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 10 ms 556 KB Output is correct
18 Correct 11 ms 700 KB Output is correct
19 Correct 9 ms 524 KB Output is correct
20 Correct 10 ms 564 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2560 ms 4768 KB Output is correct
2 Correct 2644 ms 6228 KB Output is correct
3 Correct 2610 ms 6104 KB Output is correct
4 Correct 2636 ms 6572 KB Output is correct
5 Correct 1622 ms 11096 KB Output is correct
6 Correct 1366 ms 11392 KB Output is correct
7 Correct 2576 ms 6180 KB Output is correct
8 Correct 2706 ms 6076 KB Output is correct
9 Correct 2572 ms 6156 KB Output is correct
10 Correct 1588 ms 4980 KB Output is correct
11 Correct 1873 ms 5332 KB Output is correct
12 Correct 2557 ms 9160 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 992 KB Output is correct
2 Correct 33 ms 920 KB Output is correct
3 Correct 75 ms 976 KB Output is correct
4 Correct 35 ms 896 KB Output is correct
5 Correct 2794 ms 7812 KB Output is correct
6 Correct 3047 ms 6988 KB Output is correct
7 Correct 2949 ms 7484 KB Output is correct
8 Correct 1645 ms 11144 KB Output is correct
9 Correct 1360 ms 10796 KB Output is correct
10 Correct 1537 ms 8204 KB Output is correct
11 Correct 233 ms 3204 KB Output is correct
12 Correct 1516 ms 9368 KB Output is correct
13 Correct 1772 ms 7672 KB Output is correct
14 Correct 1216 ms 5388 KB Output is correct
15 Correct 1069 ms 4976 KB Output is correct
16 Correct 783 ms 4332 KB Output is correct
17 Correct 3006 ms 6096 KB Output is correct
18 Correct 3045 ms 6064 KB Output is correct
19 Correct 3073 ms 6052 KB Output is correct
20 Correct 2998 ms 6100 KB Output is correct
21 Correct 294 ms 3556 KB Output is correct
22 Correct 1263 ms 6444 KB Output is correct
23 Correct 1431 ms 7112 KB Output is correct
24 Correct 1268 ms 6488 KB Output is correct
25 Correct 53 ms 2764 KB Output is correct
26 Correct 38 ms 2832 KB Output is correct
27 Correct 53 ms 2816 KB Output is correct
28 Correct 42 ms 2764 KB Output is correct
29 Correct 1484 ms 7464 KB Output is correct
30 Correct 1466 ms 7592 KB Output is correct
31 Correct 1341 ms 10964 KB Output is correct
32 Correct 1548 ms 8128 KB Output is correct
33 Correct 1731 ms 7880 KB Output is correct
34 Correct 1045 ms 5008 KB Output is correct
35 Correct 1636 ms 7084 KB Output is correct
36 Correct 1698 ms 8028 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 972 KB Output is correct
2 Correct 43 ms 932 KB Output is correct
3 Correct 36 ms 884 KB Output is correct
4 Correct 43 ms 972 KB Output is correct
5 Correct 2318 ms 7688 KB Output is correct
6 Correct 1149 ms 5004 KB Output is correct
7 Correct 2128 ms 10212 KB Output is correct
8 Correct 1538 ms 5004 KB Output is correct
9 Correct 1063 ms 6396 KB Output is correct
10 Correct 1390 ms 9660 KB Output is correct
11 Correct 491 ms 4480 KB Output is correct
12 Correct 1265 ms 11188 KB Output is correct
13 Correct 1711 ms 7892 KB Output is correct
14 Correct 1184 ms 5632 KB Output is correct
15 Correct 1435 ms 10720 KB Output is correct
16 Correct 1625 ms 8056 KB Output is correct
17 Correct 2582 ms 6072 KB Output is correct
18 Correct 2531 ms 6104 KB Output is correct
19 Correct 2527 ms 6212 KB Output is correct
20 Correct 2566 ms 6172 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 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 10 ms 724 KB Output is correct
6 Correct 11 ms 724 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 8 ms 696 KB Output is correct
9 Correct 8 ms 724 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 11 ms 596 KB Output is correct
12 Correct 11 ms 596 KB Output is correct
13 Correct 9 ms 852 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 10 ms 556 KB Output is correct
18 Correct 11 ms 700 KB Output is correct
19 Correct 9 ms 524 KB Output is correct
20 Correct 10 ms 564 KB Output is correct
21 Correct 2560 ms 4768 KB Output is correct
22 Correct 2644 ms 6228 KB Output is correct
23 Correct 2610 ms 6104 KB Output is correct
24 Correct 2636 ms 6572 KB Output is correct
25 Correct 1622 ms 11096 KB Output is correct
26 Correct 1366 ms 11392 KB Output is correct
27 Correct 2576 ms 6180 KB Output is correct
28 Correct 2706 ms 6076 KB Output is correct
29 Correct 2572 ms 6156 KB Output is correct
30 Correct 1588 ms 4980 KB Output is correct
31 Correct 1873 ms 5332 KB Output is correct
32 Correct 2557 ms 9160 KB Output is correct
33 Correct 37 ms 972 KB Output is correct
34 Correct 43 ms 932 KB Output is correct
35 Correct 36 ms 884 KB Output is correct
36 Correct 43 ms 972 KB Output is correct
37 Correct 2318 ms 7688 KB Output is correct
38 Correct 1149 ms 5004 KB Output is correct
39 Correct 2128 ms 10212 KB Output is correct
40 Correct 1538 ms 5004 KB Output is correct
41 Correct 1063 ms 6396 KB Output is correct
42 Correct 1390 ms 9660 KB Output is correct
43 Correct 491 ms 4480 KB Output is correct
44 Correct 1265 ms 11188 KB Output is correct
45 Correct 1711 ms 7892 KB Output is correct
46 Correct 1184 ms 5632 KB Output is correct
47 Correct 1435 ms 10720 KB Output is correct
48 Correct 1625 ms 8056 KB Output is correct
49 Correct 2582 ms 6072 KB Output is correct
50 Correct 2531 ms 6104 KB Output is correct
51 Correct 2527 ms 6212 KB Output is correct
52 Correct 2566 ms 6172 KB Output is correct
53 Correct 55 ms 2984 KB Output is correct
54 Correct 55 ms 3060 KB Output is correct
55 Correct 35 ms 3064 KB Output is correct
56 Correct 37 ms 2952 KB Output is correct
57 Correct 2078 ms 5520 KB Output is correct
58 Correct 824 ms 4516 KB Output is correct
59 Correct 2623 ms 7100 KB Output is correct
60 Correct 692 ms 4480 KB Output is correct
61 Correct 1387 ms 7940 KB Output is correct
62 Correct 1364 ms 10672 KB Output is correct
63 Correct 1293 ms 11024 KB Output is correct
64 Correct 1479 ms 10660 KB Output is correct
65 Correct 851 ms 5004 KB Output is correct
66 Correct 695 ms 4356 KB Output is correct
67 Correct 1682 ms 8184 KB Output is correct
68 Correct 1595 ms 7128 KB Output is correct
69 Correct 2653 ms 6120 KB Output is correct
70 Correct 2619 ms 6152 KB Output is correct
71 Correct 2607 ms 6100 KB Output is correct
72 Correct 2629 ms 6080 KB Output is correct
73 Correct 808 ms 5148 KB Output is correct
74 Correct 1246 ms 7124 KB Output is correct
75 Correct 1235 ms 11328 KB Output is correct
76 Correct 1289 ms 11024 KB Output is correct
77 Correct 40 ms 2968 KB Output is correct
78 Correct 36 ms 3036 KB Output is correct
79 Correct 45 ms 2996 KB Output is correct
80 Correct 45 ms 3056 KB Output is correct
81 Correct 1206 ms 6976 KB Output is correct
82 Correct 802 ms 5180 KB Output is correct
83 Correct 488 ms 4188 KB Output is correct
84 Correct 1252 ms 7052 KB Output is correct
85 Correct 1687 ms 8144 KB Output is correct
86 Correct 1754 ms 9440 KB Output is correct
87 Correct 1321 ms 6384 KB Output is correct
88 Correct 634 ms 4216 KB Output is correct

Subtask #6
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 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 10 ms 724 KB Output is correct
6 Correct 11 ms 724 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 8 ms 696 KB Output is correct
9 Correct 8 ms 724 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 11 ms 596 KB Output is correct
12 Correct 11 ms 596 KB Output is correct
13 Correct 9 ms 852 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 10 ms 556 KB Output is correct
18 Correct 11 ms 700 KB Output is correct
19 Correct 9 ms 524 KB Output is correct
20 Correct 10 ms 564 KB Output is correct
21 Correct 2560 ms 4768 KB Output is correct
22 Correct 2644 ms 6228 KB Output is correct
23 Correct 2610 ms 6104 KB Output is correct
24 Correct 2636 ms 6572 KB Output is correct
25 Correct 1622 ms 11096 KB Output is correct
26 Correct 1366 ms 11392 KB Output is correct
27 Correct 2576 ms 6180 KB Output is correct
28 Correct 2706 ms 6076 KB Output is correct
29 Correct 2572 ms 6156 KB Output is correct
30 Correct 1588 ms 4980 KB Output is correct
31 Correct 1873 ms 5332 KB Output is correct
32 Correct 2557 ms 9160 KB Output is correct
33 Correct 49 ms 992 KB Output is correct
34 Correct 33 ms 920 KB Output is correct
35 Correct 75 ms 976 KB Output is correct
36 Correct 35 ms 896 KB Output is correct
37 Correct 2794 ms 7812 KB Output is correct
38 Correct 3047 ms 6988 KB Output is correct
39 Correct 2949 ms 7484 KB Output is correct
40 Correct 1645 ms 11144 KB Output is correct
41 Correct 1360 ms 10796 KB Output is correct
42 Correct 1537 ms 8204 KB Output is correct
43 Correct 233 ms 3204 KB Output is correct
44 Correct 1516 ms 9368 KB Output is correct
45 Correct 1772 ms 7672 KB Output is correct
46 Correct 1216 ms 5388 KB Output is correct
47 Correct 1069 ms 4976 KB Output is correct
48 Correct 783 ms 4332 KB Output is correct
49 Correct 3006 ms 6096 KB Output is correct
50 Correct 3045 ms 6064 KB Output is correct
51 Correct 3073 ms 6052 KB Output is correct
52 Correct 2998 ms 6100 KB Output is correct
53 Correct 294 ms 3556 KB Output is correct
54 Correct 1263 ms 6444 KB Output is correct
55 Correct 1431 ms 7112 KB Output is correct
56 Correct 1268 ms 6488 KB Output is correct
57 Correct 53 ms 2764 KB Output is correct
58 Correct 38 ms 2832 KB Output is correct
59 Correct 53 ms 2816 KB Output is correct
60 Correct 42 ms 2764 KB Output is correct
61 Correct 1484 ms 7464 KB Output is correct
62 Correct 1466 ms 7592 KB Output is correct
63 Correct 1341 ms 10964 KB Output is correct
64 Correct 1548 ms 8128 KB Output is correct
65 Correct 1731 ms 7880 KB Output is correct
66 Correct 1045 ms 5008 KB Output is correct
67 Correct 1636 ms 7084 KB Output is correct
68 Correct 1698 ms 8028 KB Output is correct
69 Correct 37 ms 972 KB Output is correct
70 Correct 43 ms 932 KB Output is correct
71 Correct 36 ms 884 KB Output is correct
72 Correct 43 ms 972 KB Output is correct
73 Correct 2318 ms 7688 KB Output is correct
74 Correct 1149 ms 5004 KB Output is correct
75 Correct 2128 ms 10212 KB Output is correct
76 Correct 1538 ms 5004 KB Output is correct
77 Correct 1063 ms 6396 KB Output is correct
78 Correct 1390 ms 9660 KB Output is correct
79 Correct 491 ms 4480 KB Output is correct
80 Correct 1265 ms 11188 KB Output is correct
81 Correct 1711 ms 7892 KB Output is correct
82 Correct 1184 ms 5632 KB Output is correct
83 Correct 1435 ms 10720 KB Output is correct
84 Correct 1625 ms 8056 KB Output is correct
85 Correct 2582 ms 6072 KB Output is correct
86 Correct 2531 ms 6104 KB Output is correct
87 Correct 2527 ms 6212 KB Output is correct
88 Correct 2566 ms 6172 KB Output is correct
89 Correct 55 ms 2984 KB Output is correct
90 Correct 55 ms 3060 KB Output is correct
91 Correct 35 ms 3064 KB Output is correct
92 Correct 37 ms 2952 KB Output is correct
93 Correct 2078 ms 5520 KB Output is correct
94 Correct 824 ms 4516 KB Output is correct
95 Correct 2623 ms 7100 KB Output is correct
96 Correct 692 ms 4480 KB Output is correct
97 Correct 1387 ms 7940 KB Output is correct
98 Correct 1364 ms 10672 KB Output is correct
99 Correct 1293 ms 11024 KB Output is correct
100 Correct 1479 ms 10660 KB Output is correct
101 Correct 851 ms 5004 KB Output is correct
102 Correct 695 ms 4356 KB Output is correct
103 Correct 1682 ms 8184 KB Output is correct
104 Correct 1595 ms 7128 KB Output is correct
105 Correct 2653 ms 6120 KB Output is correct
106 Correct 2619 ms 6152 KB Output is correct
107 Correct 2607 ms 6100 KB Output is correct
108 Correct 2629 ms 6080 KB Output is correct
109 Correct 808 ms 5148 KB Output is correct
110 Correct 1246 ms 7124 KB Output is correct
111 Correct 1235 ms 11328 KB Output is correct
112 Correct 1289 ms 11024 KB Output is correct
113 Correct 40 ms 2968 KB Output is correct
114 Correct 36 ms 3036 KB Output is correct
115 Correct 45 ms 2996 KB Output is correct
116 Correct 45 ms 3056 KB Output is correct
117 Correct 1206 ms 6976 KB Output is correct
118 Correct 802 ms 5180 KB Output is correct
119 Correct 488 ms 4188 KB Output is correct
120 Correct 1252 ms 7052 KB Output is correct
121 Correct 1687 ms 8144 KB Output is correct
122 Correct 1754 ms 9440 KB Output is correct
123 Correct 1321 ms 6384 KB Output is correct
124 Correct 634 ms 4216 KB Output is correct
125 Correct 86 ms 5708 KB Output is correct
126 Correct 95 ms 5708 KB Output is correct
127 Correct 134 ms 5756 KB Output is correct
128 Correct 101 ms 5708 KB Output is correct
129 Correct 94 ms 5744 KB Output is correct
130 Correct 106 ms 5796 KB Output is correct
131 Correct 3453 ms 8604 KB Output is correct
132 Execution timed out 5021 ms 10592 KB Time limit exceeded
133 Halted 0 ms 0 KB -