oj.uz

Submission #805784

# Submission time Handle Problem Language Result Execution time Memory
805784 2023-08-03T23:24:55 Z farhan132 Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 4824 KB 
/***Farhan132***/
// #pragma GCC optimize("Ofast,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>
 
using namespace std;
 
typedef int ll;
typedef double dd;
typedef pair<ll , ll> ii;
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clz(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
const ll mod =  (ll) 998244353;
// const ll mod =  (ll) 1e9 + 7;
const ll inf = numeric_limits<int>::max()-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 = 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;
            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] - (lower_bound(R[i].begin(), R[i].end(), l + k - 1) - R[i].begin()));
        //     continue;
        // }
        // if(l <= lx[i] && rx[i] + k - 1 <= r){
        //     if(!S[i]) continue;
        //     ans += (S[i] - (lower_bound(sz[i].begin(), sz[i].end(), k) - 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 add(ll, ll)':
segments.cpp:58:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |             for(ll i = 1; i < R[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~
segments.cpp: In function 'void remove(ll, ll)':
segments.cpp:72:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             for(ll i = 0; i < req[block].size(); i++){
      |                           ~~^~~~~~~~~~~~~~~~~~~
segments.cpp:81:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<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 'int'} and 'std::vector<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:142:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |     for(ll i = 0; i < a.size(); i++){
      |                   ~~^~~~~~~~~~
segments.cpp: In function 'void solve()':
segments.cpp:176:26: warning: operation on 'cur' may be undefined [-Wsequence-point]
  176 |             cin >> range[++cur].ff >> range[cur].ss;
      |                          ^~~~~
segments.cpp: In function 'int main()':
segments.cpp:214:15: warning: unused variable 'CT' [-Wunused-variable]
  214 |     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 596 KB Output is correct
6 Correct 11 ms 536 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 8 ms 480 KB Output is correct
9 Correct 8 ms 544 KB Output is correct
10 Correct 9 ms 592 KB Output is correct
11 Correct 11 ms 532 KB Output is correct
12 Correct 11 ms 468 KB Output is correct
13 Correct 9 ms 596 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 2 ms 300 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 7 ms 468 KB Output is correct
18 Correct 8 ms 596 KB Output is correct
19 Correct 7 ms 464 KB Output is correct
20 Correct 7 ms 468 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2504 ms 2520 KB Output is correct
2 Correct 2510 ms 2728 KB Output is correct
3 Correct 2523 ms 2684 KB Output is correct
4 Correct 2561 ms 2888 KB Output is correct
5 Correct 1457 ms 4704 KB Output is correct
6 Correct 1282 ms 4752 KB Output is correct
7 Correct 2501 ms 2760 KB Output is correct
8 Correct 2505 ms 2632 KB Output is correct
9 Correct 2479 ms 2708 KB Output is correct
10 Correct 1475 ms 1512 KB Output is correct
11 Correct 1858 ms 1728 KB Output is correct
12 Correct 2427 ms 3992 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 688 KB Output is correct
2 Correct 32 ms 672 KB Output is correct
3 Correct 75 ms 688 KB Output is correct
4 Correct 35 ms 672 KB Output is correct
5 Correct 2735 ms 3876 KB Output is correct
6 Correct 2946 ms 2908 KB Output is correct
7 Correct 2892 ms 3048 KB Output is correct
8 Correct 1535 ms 4708 KB Output is correct
9 Correct 1291 ms 4708 KB Output is correct
10 Correct 1443 ms 3240 KB Output is correct
11 Correct 214 ms 848 KB Output is correct
12 Correct 1467 ms 3960 KB Output is correct
13 Correct 1638 ms 3044 KB Output is correct
14 Correct 1173 ms 1936 KB Output is correct
15 Correct 1050 ms 1856 KB Output is correct
16 Correct 754 ms 1384 KB Output is correct
17 Correct 2924 ms 2468 KB Output is correct
18 Correct 2920 ms 2496 KB Output is correct
19 Correct 2951 ms 2596 KB Output is correct
20 Correct 2922 ms 2500 KB Output is correct
21 Correct 282 ms 976 KB Output is correct
22 Correct 1179 ms 2528 KB Output is correct
23 Correct 1358 ms 2800 KB Output is correct
24 Correct 1236 ms 2456 KB Output is correct
25 Correct 61 ms 716 KB Output is correct
26 Correct 39 ms 652 KB Output is correct
27 Correct 51 ms 716 KB Output is correct
28 Correct 43 ms 716 KB Output is correct
29 Correct 1412 ms 2900 KB Output is correct
30 Correct 1416 ms 2904 KB Output is correct
31 Correct 1284 ms 4588 KB Output is correct
32 Correct 1470 ms 3196 KB Output is correct
33 Correct 1660 ms 3084 KB Output is correct
34 Correct 1016 ms 1792 KB Output is correct
35 Correct 1567 ms 2784 KB Output is correct
36 Correct 1642 ms 3260 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 588 KB Output is correct
2 Correct 35 ms 588 KB Output is correct
3 Correct 39 ms 700 KB Output is correct
4 Correct 41 ms 640 KB Output is correct
5 Correct 2241 ms 4004 KB Output is correct
6 Correct 1105 ms 1568 KB Output is correct
7 Correct 2016 ms 4512 KB Output is correct
8 Correct 1527 ms 1736 KB Output is correct
9 Correct 1002 ms 2612 KB Output is correct
10 Correct 1335 ms 4060 KB Output is correct
11 Correct 475 ms 1472 KB Output is correct
12 Correct 1176 ms 4788 KB Output is correct
13 Correct 1561 ms 3228 KB Output is correct
14 Correct 1150 ms 2156 KB Output is correct
15 Correct 1388 ms 4604 KB Output is correct
16 Correct 1579 ms 3352 KB Output is correct
17 Correct 2512 ms 2704 KB Output is correct
18 Correct 2502 ms 2712 KB Output is correct
19 Correct 2520 ms 2688 KB Output is correct
20 Correct 2504 ms 2724 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 596 KB Output is correct
6 Correct 11 ms 536 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 8 ms 480 KB Output is correct
9 Correct 8 ms 544 KB Output is correct
10 Correct 9 ms 592 KB Output is correct
11 Correct 11 ms 532 KB Output is correct
12 Correct 11 ms 468 KB Output is correct
13 Correct 9 ms 596 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 2 ms 300 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 7 ms 468 KB Output is correct
18 Correct 8 ms 596 KB Output is correct
19 Correct 7 ms 464 KB Output is correct
20 Correct 7 ms 468 KB Output is correct
21 Correct 2504 ms 2520 KB Output is correct
22 Correct 2510 ms 2728 KB Output is correct
23 Correct 2523 ms 2684 KB Output is correct
24 Correct 2561 ms 2888 KB Output is correct
25 Correct 1457 ms 4704 KB Output is correct
26 Correct 1282 ms 4752 KB Output is correct
27 Correct 2501 ms 2760 KB Output is correct
28 Correct 2505 ms 2632 KB Output is correct
29 Correct 2479 ms 2708 KB Output is correct
30 Correct 1475 ms 1512 KB Output is correct
31 Correct 1858 ms 1728 KB Output is correct
32 Correct 2427 ms 3992 KB Output is correct
33 Correct 33 ms 588 KB Output is correct
34 Correct 35 ms 588 KB Output is correct
35 Correct 39 ms 700 KB Output is correct
36 Correct 41 ms 640 KB Output is correct
37 Correct 2241 ms 4004 KB Output is correct
38 Correct 1105 ms 1568 KB Output is correct
39 Correct 2016 ms 4512 KB Output is correct
40 Correct 1527 ms 1736 KB Output is correct
41 Correct 1002 ms 2612 KB Output is correct
42 Correct 1335 ms 4060 KB Output is correct
43 Correct 475 ms 1472 KB Output is correct
44 Correct 1176 ms 4788 KB Output is correct
45 Correct 1561 ms 3228 KB Output is correct
46 Correct 1150 ms 2156 KB Output is correct
47 Correct 1388 ms 4604 KB Output is correct
48 Correct 1579 ms 3352 KB Output is correct
49 Correct 2512 ms 2704 KB Output is correct
50 Correct 2502 ms 2712 KB Output is correct
51 Correct 2520 ms 2688 KB Output is correct
52 Correct 2504 ms 2724 KB Output is correct
53 Correct 43 ms 764 KB Output is correct
54 Correct 46 ms 960 KB Output is correct
55 Correct 34 ms 752 KB Output is correct
56 Correct 36 ms 784 KB Output is correct
57 Correct 2053 ms 1836 KB Output is correct
58 Correct 787 ms 1400 KB Output is correct
59 Correct 2522 ms 3076 KB Output is correct
60 Correct 659 ms 1264 KB Output is correct
61 Correct 1299 ms 3152 KB Output is correct
62 Correct 1289 ms 4472 KB Output is correct
63 Correct 1220 ms 4824 KB Output is correct
64 Correct 1268 ms 4552 KB Output is correct
65 Correct 818 ms 1760 KB Output is correct
66 Correct 675 ms 1508 KB Output is correct
67 Correct 1584 ms 3408 KB Output is correct
68 Correct 1498 ms 2944 KB Output is correct
69 Correct 2511 ms 2836 KB Output is correct
70 Correct 2507 ms 2728 KB Output is correct
71 Correct 2518 ms 2704 KB Output is correct
72 Correct 2521 ms 2660 KB Output is correct
73 Correct 752 ms 1880 KB Output is correct
74 Correct 1193 ms 2824 KB Output is correct
75 Correct 1165 ms 4788 KB Output is correct
76 Correct 1205 ms 4796 KB Output is correct
77 Correct 39 ms 720 KB Output is correct
78 Correct 35 ms 820 KB Output is correct
79 Correct 45 ms 744 KB Output is correct
80 Correct 37 ms 824 KB Output is correct
81 Correct 1190 ms 2768 KB Output is correct
82 Correct 763 ms 2000 KB Output is correct
83 Correct 452 ms 1420 KB Output is correct
84 Correct 1195 ms 2800 KB Output is correct
85 Correct 1654 ms 3276 KB Output is correct
86 Correct 1636 ms 3856 KB Output is correct
87 Correct 1330 ms 2508 KB Output is correct
88 Correct 615 ms 1468 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 596 KB Output is correct
6 Correct 11 ms 536 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 8 ms 480 KB Output is correct
9 Correct 8 ms 544 KB Output is correct
10 Correct 9 ms 592 KB Output is correct
11 Correct 11 ms 532 KB Output is correct
12 Correct 11 ms 468 KB Output is correct
13 Correct 9 ms 596 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 2 ms 300 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 7 ms 468 KB Output is correct
18 Correct 8 ms 596 KB Output is correct
19 Correct 7 ms 464 KB Output is correct
20 Correct 7 ms 468 KB Output is correct
21 Correct 2504 ms 2520 KB Output is correct
22 Correct 2510 ms 2728 KB Output is correct
23 Correct 2523 ms 2684 KB Output is correct
24 Correct 2561 ms 2888 KB Output is correct
25 Correct 1457 ms 4704 KB Output is correct
26 Correct 1282 ms 4752 KB Output is correct
27 Correct 2501 ms 2760 KB Output is correct
28 Correct 2505 ms 2632 KB Output is correct
29 Correct 2479 ms 2708 KB Output is correct
30 Correct 1475 ms 1512 KB Output is correct
31 Correct 1858 ms 1728 KB Output is correct
32 Correct 2427 ms 3992 KB Output is correct
33 Correct 48 ms 688 KB Output is correct
34 Correct 32 ms 672 KB Output is correct
35 Correct 75 ms 688 KB Output is correct
36 Correct 35 ms 672 KB Output is correct
37 Correct 2735 ms 3876 KB Output is correct
38 Correct 2946 ms 2908 KB Output is correct
39 Correct 2892 ms 3048 KB Output is correct
40 Correct 1535 ms 4708 KB Output is correct
41 Correct 1291 ms 4708 KB Output is correct
42 Correct 1443 ms 3240 KB Output is correct
43 Correct 214 ms 848 KB Output is correct
44 Correct 1467 ms 3960 KB Output is correct
45 Correct 1638 ms 3044 KB Output is correct
46 Correct 1173 ms 1936 KB Output is correct
47 Correct 1050 ms 1856 KB Output is correct
48 Correct 754 ms 1384 KB Output is correct
49 Correct 2924 ms 2468 KB Output is correct
50 Correct 2920 ms 2496 KB Output is correct
51 Correct 2951 ms 2596 KB Output is correct
52 Correct 2922 ms 2500 KB Output is correct
53 Correct 282 ms 976 KB Output is correct
54 Correct 1179 ms 2528 KB Output is correct
55 Correct 1358 ms 2800 KB Output is correct
56 Correct 1236 ms 2456 KB Output is correct
57 Correct 61 ms 716 KB Output is correct
58 Correct 39 ms 652 KB Output is correct
59 Correct 51 ms 716 KB Output is correct
60 Correct 43 ms 716 KB Output is correct
61 Correct 1412 ms 2900 KB Output is correct
62 Correct 1416 ms 2904 KB Output is correct
63 Correct 1284 ms 4588 KB Output is correct
64 Correct 1470 ms 3196 KB Output is correct
65 Correct 1660 ms 3084 KB Output is correct
66 Correct 1016 ms 1792 KB Output is correct
67 Correct 1567 ms 2784 KB Output is correct
68 Correct 1642 ms 3260 KB Output is correct
69 Correct 33 ms 588 KB Output is correct
70 Correct 35 ms 588 KB Output is correct
71 Correct 39 ms 700 KB Output is correct
72 Correct 41 ms 640 KB Output is correct
73 Correct 2241 ms 4004 KB Output is correct
74 Correct 1105 ms 1568 KB Output is correct
75 Correct 2016 ms 4512 KB Output is correct
76 Correct 1527 ms 1736 KB Output is correct
77 Correct 1002 ms 2612 KB Output is correct
78 Correct 1335 ms 4060 KB Output is correct
79 Correct 475 ms 1472 KB Output is correct
80 Correct 1176 ms 4788 KB Output is correct
81 Correct 1561 ms 3228 KB Output is correct
82 Correct 1150 ms 2156 KB Output is correct
83 Correct 1388 ms 4604 KB Output is correct
84 Correct 1579 ms 3352 KB Output is correct
85 Correct 2512 ms 2704 KB Output is correct
86 Correct 2502 ms 2712 KB Output is correct
87 Correct 2520 ms 2688 KB Output is correct
88 Correct 2504 ms 2724 KB Output is correct
89 Correct 43 ms 764 KB Output is correct
90 Correct 46 ms 960 KB Output is correct
91 Correct 34 ms 752 KB Output is correct
92 Correct 36 ms 784 KB Output is correct
93 Correct 2053 ms 1836 KB Output is correct
94 Correct 787 ms 1400 KB Output is correct
95 Correct 2522 ms 3076 KB Output is correct
96 Correct 659 ms 1264 KB Output is correct
97 Correct 1299 ms 3152 KB Output is correct
98 Correct 1289 ms 4472 KB Output is correct
99 Correct 1220 ms 4824 KB Output is correct
100 Correct 1268 ms 4552 KB Output is correct
101 Correct 818 ms 1760 KB Output is correct
102 Correct 675 ms 1508 KB Output is correct
103 Correct 1584 ms 3408 KB Output is correct
104 Correct 1498 ms 2944 KB Output is correct
105 Correct 2511 ms 2836 KB Output is correct
106 Correct 2507 ms 2728 KB Output is correct
107 Correct 2518 ms 2704 KB Output is correct
108 Correct 2521 ms 2660 KB Output is correct
109 Correct 752 ms 1880 KB Output is correct
110 Correct 1193 ms 2824 KB Output is correct
111 Correct 1165 ms 4788 KB Output is correct
112 Correct 1205 ms 4796 KB Output is correct
113 Correct 39 ms 720 KB Output is correct
114 Correct 35 ms 820 KB Output is correct
115 Correct 45 ms 744 KB Output is correct
116 Correct 37 ms 824 KB Output is correct
117 Correct 1190 ms 2768 KB Output is correct
118 Correct 763 ms 2000 KB Output is correct
119 Correct 452 ms 1420 KB Output is correct
120 Correct 1195 ms 2800 KB Output is correct
121 Correct 1654 ms 3276 KB Output is correct
122 Correct 1636 ms 3856 KB Output is correct
123 Correct 1330 ms 2508 KB Output is correct
124 Correct 615 ms 1468 KB Output is correct
125 Correct 88 ms 1112 KB Output is correct
126 Correct 98 ms 1152 KB Output is correct
127 Correct 141 ms 1116 KB Output is correct
128 Correct 102 ms 1136 KB Output is correct
129 Correct 78 ms 1080 KB Output is correct
130 Correct 109 ms 1208 KB Output is correct
131 Correct 3316 ms 2268 KB Output is correct
132 Execution timed out 5061 ms 4648 KB Time limit exceeded
133 Halted 0 ms 0 KB -