oj.uz

Submission #805794

# Submission time Handle Problem Language Result Execution time Memory
805794 2023-08-03T23:42:08 Z farhan132 Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 9036 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].end(), 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: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 1 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 12 ms 724 KB Output is correct
6 Correct 13 ms 724 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 8 ms 736 KB Output is correct
9 Correct 8 ms 704 KB Output is correct
10 Correct 10 ms 780 KB Output is correct
11 Correct 10 ms 596 KB Output is correct
12 Correct 10 ms 660 KB Output is correct
13 Correct 17 ms 924 KB Output is correct
14 Correct 8 ms 680 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 8 ms 520 KB Output is correct
18 Correct 9 ms 828 KB Output is correct
19 Correct 7 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 1657 ms 4768 KB Output is correct
2 Correct 1694 ms 4744 KB Output is correct
3 Correct 1622 ms 4848 KB Output is correct
4 Correct 1697 ms 5148 KB Output is correct
5 Correct 1347 ms 8828 KB Output is correct
6 Correct 1242 ms 9000 KB Output is correct
7 Correct 1655 ms 4780 KB Output is correct
8 Correct 1664 ms 4832 KB Output is correct
9 Correct 1700 ms 4816 KB Output is correct
10 Correct 911 ms 2224 KB Output is correct
11 Correct 1223 ms 2780 KB Output is correct
12 Correct 1800 ms 7212 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 964 KB Output is correct
2 Correct 34 ms 980 KB Output is correct
3 Correct 81 ms 1052 KB Output is correct
4 Correct 36 ms 972 KB Output is correct
5 Correct 2045 ms 7296 KB Output is correct
6 Correct 2193 ms 5476 KB Output is correct
7 Correct 2192 ms 5808 KB Output is correct
8 Correct 1394 ms 8844 KB Output is correct
9 Correct 1248 ms 8604 KB Output is correct
10 Correct 1219 ms 6176 KB Output is correct
11 Correct 197 ms 1436 KB Output is correct
12 Correct 1224 ms 7224 KB Output is correct
13 Correct 1220 ms 5696 KB Output is correct
14 Correct 822 ms 3376 KB Output is correct
15 Correct 734 ms 3180 KB Output is correct
16 Correct 529 ms 2328 KB Output is correct
17 Correct 2063 ms 4832 KB Output is correct
18 Correct 2050 ms 4816 KB Output is correct
19 Correct 2062 ms 4764 KB Output is correct
20 Correct 2104 ms 5028 KB Output is correct
21 Correct 242 ms 1568 KB Output is correct
22 Correct 920 ms 4456 KB Output is correct
23 Correct 1098 ms 5020 KB Output is correct
24 Correct 960 ms 4500 KB Output is correct
25 Correct 54 ms 988 KB Output is correct
26 Correct 38 ms 892 KB Output is correct
27 Correct 52 ms 1000 KB Output is correct
28 Correct 42 ms 932 KB Output is correct
29 Correct 1144 ms 5464 KB Output is correct
30 Correct 1149 ms 5416 KB Output is correct
31 Correct 1255 ms 8788 KB Output is correct
32 Correct 1216 ms 6112 KB Output is correct
33 Correct 1223 ms 5788 KB Output is correct
34 Correct 713 ms 3084 KB Output is correct
35 Correct 1205 ms 5028 KB Output is correct
36 Correct 1266 ms 6108 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 884 KB Output is correct
2 Correct 36 ms 944 KB Output is correct
3 Correct 35 ms 912 KB Output is correct
4 Correct 42 ms 968 KB Output is correct
5 Correct 1634 ms 7704 KB Output is correct
6 Correct 713 ms 1712 KB Output is correct
7 Correct 1548 ms 8048 KB Output is correct
8 Correct 998 ms 2324 KB Output is correct
9 Correct 771 ms 4264 KB Output is correct
10 Correct 1144 ms 7468 KB Output is correct
11 Correct 366 ms 2136 KB Output is correct
12 Correct 1186 ms 8908 KB Output is correct
13 Correct 1168 ms 5580 KB Output is correct
14 Correct 847 ms 3492 KB Output is correct
15 Correct 1232 ms 8652 KB Output is correct
16 Correct 1243 ms 5888 KB Output is correct
17 Correct 1620 ms 4832 KB Output is correct
18 Correct 1622 ms 4936 KB Output is correct
19 Correct 1674 ms 4840 KB Output is correct
20 Correct 1713 ms 4792 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 1 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 12 ms 724 KB Output is correct
6 Correct 13 ms 724 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 8 ms 736 KB Output is correct
9 Correct 8 ms 704 KB Output is correct
10 Correct 10 ms 780 KB Output is correct
11 Correct 10 ms 596 KB Output is correct
12 Correct 10 ms 660 KB Output is correct
13 Correct 17 ms 924 KB Output is correct
14 Correct 8 ms 680 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 8 ms 520 KB Output is correct
18 Correct 9 ms 828 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 7 ms 560 KB Output is correct
21 Correct 1657 ms 4768 KB Output is correct
22 Correct 1694 ms 4744 KB Output is correct
23 Correct 1622 ms 4848 KB Output is correct
24 Correct 1697 ms 5148 KB Output is correct
25 Correct 1347 ms 8828 KB Output is correct
26 Correct 1242 ms 9000 KB Output is correct
27 Correct 1655 ms 4780 KB Output is correct
28 Correct 1664 ms 4832 KB Output is correct
29 Correct 1700 ms 4816 KB Output is correct
30 Correct 911 ms 2224 KB Output is correct
31 Correct 1223 ms 2780 KB Output is correct
32 Correct 1800 ms 7212 KB Output is correct
33 Correct 34 ms 884 KB Output is correct
34 Correct 36 ms 944 KB Output is correct
35 Correct 35 ms 912 KB Output is correct
36 Correct 42 ms 968 KB Output is correct
37 Correct 1634 ms 7704 KB Output is correct
38 Correct 713 ms 1712 KB Output is correct
39 Correct 1548 ms 8048 KB Output is correct
40 Correct 998 ms 2324 KB Output is correct
41 Correct 771 ms 4264 KB Output is correct
42 Correct 1144 ms 7468 KB Output is correct
43 Correct 366 ms 2136 KB Output is correct
44 Correct 1186 ms 8908 KB Output is correct
45 Correct 1168 ms 5580 KB Output is correct
46 Correct 847 ms 3492 KB Output is correct
47 Correct 1232 ms 8652 KB Output is correct
48 Correct 1243 ms 5888 KB Output is correct
49 Correct 1620 ms 4832 KB Output is correct
50 Correct 1622 ms 4936 KB Output is correct
51 Correct 1674 ms 4840 KB Output is correct
52 Correct 1713 ms 4792 KB Output is correct
53 Correct 44 ms 892 KB Output is correct
54 Correct 47 ms 904 KB Output is correct
55 Correct 35 ms 948 KB Output is correct
56 Correct 36 ms 980 KB Output is correct
57 Correct 1321 ms 3184 KB Output is correct
58 Correct 521 ms 1480 KB Output is correct
59 Correct 1697 ms 5564 KB Output is correct
60 Correct 465 ms 1388 KB Output is correct
61 Correct 1054 ms 5624 KB Output is correct
62 Correct 1188 ms 8388 KB Output is correct
63 Correct 1197 ms 8856 KB Output is correct
64 Correct 1189 ms 8428 KB Output is correct
65 Correct 558 ms 2860 KB Output is correct
66 Correct 457 ms 2276 KB Output is correct
67 Correct 1208 ms 6008 KB Output is correct
68 Correct 1128 ms 5048 KB Output is correct
69 Correct 1751 ms 4820 KB Output is correct
70 Correct 1689 ms 4872 KB Output is correct
71 Correct 1636 ms 4884 KB Output is correct
72 Correct 1659 ms 4908 KB Output is correct
73 Correct 590 ms 3072 KB Output is correct
74 Correct 936 ms 4980 KB Output is correct
75 Correct 1170 ms 9036 KB Output is correct
76 Correct 1184 ms 8804 KB Output is correct
77 Correct 39 ms 968 KB Output is correct
78 Correct 35 ms 868 KB Output is correct
79 Correct 46 ms 932 KB Output is correct
80 Correct 47 ms 964 KB Output is correct
81 Correct 922 ms 4804 KB Output is correct
82 Correct 633 ms 3032 KB Output is correct
83 Correct 386 ms 2052 KB Output is correct
84 Correct 1035 ms 4908 KB Output is correct
85 Correct 1245 ms 5980 KB Output is correct
86 Correct 1355 ms 7156 KB Output is correct
87 Correct 907 ms 4260 KB Output is correct
88 Correct 443 ms 2224 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 12 ms 724 KB Output is correct
6 Correct 13 ms 724 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 8 ms 736 KB Output is correct
9 Correct 8 ms 704 KB Output is correct
10 Correct 10 ms 780 KB Output is correct
11 Correct 10 ms 596 KB Output is correct
12 Correct 10 ms 660 KB Output is correct
13 Correct 17 ms 924 KB Output is correct
14 Correct 8 ms 680 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 8 ms 520 KB Output is correct
18 Correct 9 ms 828 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 7 ms 560 KB Output is correct
21 Correct 1657 ms 4768 KB Output is correct
22 Correct 1694 ms 4744 KB Output is correct
23 Correct 1622 ms 4848 KB Output is correct
24 Correct 1697 ms 5148 KB Output is correct
25 Correct 1347 ms 8828 KB Output is correct
26 Correct 1242 ms 9000 KB Output is correct
27 Correct 1655 ms 4780 KB Output is correct
28 Correct 1664 ms 4832 KB Output is correct
29 Correct 1700 ms 4816 KB Output is correct
30 Correct 911 ms 2224 KB Output is correct
31 Correct 1223 ms 2780 KB Output is correct
32 Correct 1800 ms 7212 KB Output is correct
33 Correct 51 ms 964 KB Output is correct
34 Correct 34 ms 980 KB Output is correct
35 Correct 81 ms 1052 KB Output is correct
36 Correct 36 ms 972 KB Output is correct
37 Correct 2045 ms 7296 KB Output is correct
38 Correct 2193 ms 5476 KB Output is correct
39 Correct 2192 ms 5808 KB Output is correct
40 Correct 1394 ms 8844 KB Output is correct
41 Correct 1248 ms 8604 KB Output is correct
42 Correct 1219 ms 6176 KB Output is correct
43 Correct 197 ms 1436 KB Output is correct
44 Correct 1224 ms 7224 KB Output is correct
45 Correct 1220 ms 5696 KB Output is correct
46 Correct 822 ms 3376 KB Output is correct
47 Correct 734 ms 3180 KB Output is correct
48 Correct 529 ms 2328 KB Output is correct
49 Correct 2063 ms 4832 KB Output is correct
50 Correct 2050 ms 4816 KB Output is correct
51 Correct 2062 ms 4764 KB Output is correct
52 Correct 2104 ms 5028 KB Output is correct
53 Correct 242 ms 1568 KB Output is correct
54 Correct 920 ms 4456 KB Output is correct
55 Correct 1098 ms 5020 KB Output is correct
56 Correct 960 ms 4500 KB Output is correct
57 Correct 54 ms 988 KB Output is correct
58 Correct 38 ms 892 KB Output is correct
59 Correct 52 ms 1000 KB Output is correct
60 Correct 42 ms 932 KB Output is correct
61 Correct 1144 ms 5464 KB Output is correct
62 Correct 1149 ms 5416 KB Output is correct
63 Correct 1255 ms 8788 KB Output is correct
64 Correct 1216 ms 6112 KB Output is correct
65 Correct 1223 ms 5788 KB Output is correct
66 Correct 713 ms 3084 KB Output is correct
67 Correct 1205 ms 5028 KB Output is correct
68 Correct 1266 ms 6108 KB Output is correct
69 Correct 34 ms 884 KB Output is correct
70 Correct 36 ms 944 KB Output is correct
71 Correct 35 ms 912 KB Output is correct
72 Correct 42 ms 968 KB Output is correct
73 Correct 1634 ms 7704 KB Output is correct
74 Correct 713 ms 1712 KB Output is correct
75 Correct 1548 ms 8048 KB Output is correct
76 Correct 998 ms 2324 KB Output is correct
77 Correct 771 ms 4264 KB Output is correct
78 Correct 1144 ms 7468 KB Output is correct
79 Correct 366 ms 2136 KB Output is correct
80 Correct 1186 ms 8908 KB Output is correct
81 Correct 1168 ms 5580 KB Output is correct
82 Correct 847 ms 3492 KB Output is correct
83 Correct 1232 ms 8652 KB Output is correct
84 Correct 1243 ms 5888 KB Output is correct
85 Correct 1620 ms 4832 KB Output is correct
86 Correct 1622 ms 4936 KB Output is correct
87 Correct 1674 ms 4840 KB Output is correct
88 Correct 1713 ms 4792 KB Output is correct
89 Correct 44 ms 892 KB Output is correct
90 Correct 47 ms 904 KB Output is correct
91 Correct 35 ms 948 KB Output is correct
92 Correct 36 ms 980 KB Output is correct
93 Correct 1321 ms 3184 KB Output is correct
94 Correct 521 ms 1480 KB Output is correct
95 Correct 1697 ms 5564 KB Output is correct
96 Correct 465 ms 1388 KB Output is correct
97 Correct 1054 ms 5624 KB Output is correct
98 Correct 1188 ms 8388 KB Output is correct
99 Correct 1197 ms 8856 KB Output is correct
100 Correct 1189 ms 8428 KB Output is correct
101 Correct 558 ms 2860 KB Output is correct
102 Correct 457 ms 2276 KB Output is correct
103 Correct 1208 ms 6008 KB Output is correct
104 Correct 1128 ms 5048 KB Output is correct
105 Correct 1751 ms 4820 KB Output is correct
106 Correct 1689 ms 4872 KB Output is correct
107 Correct 1636 ms 4884 KB Output is correct
108 Correct 1659 ms 4908 KB Output is correct
109 Correct 590 ms 3072 KB Output is correct
110 Correct 936 ms 4980 KB Output is correct
111 Correct 1170 ms 9036 KB Output is correct
112 Correct 1184 ms 8804 KB Output is correct
113 Correct 39 ms 968 KB Output is correct
114 Correct 35 ms 868 KB Output is correct
115 Correct 46 ms 932 KB Output is correct
116 Correct 47 ms 964 KB Output is correct
117 Correct 922 ms 4804 KB Output is correct
118 Correct 633 ms 3032 KB Output is correct
119 Correct 386 ms 2052 KB Output is correct
120 Correct 1035 ms 4908 KB Output is correct
121 Correct 1245 ms 5980 KB Output is correct
122 Correct 1355 ms 7156 KB Output is correct
123 Correct 907 ms 4260 KB Output is correct
124 Correct 443 ms 2224 KB Output is correct
125 Correct 126 ms 1580 KB Output is correct
126 Correct 119 ms 1576 KB Output is correct
127 Correct 147 ms 1560 KB Output is correct
128 Correct 102 ms 1624 KB Output is correct
129 Correct 78 ms 1592 KB Output is correct
130 Correct 135 ms 1624 KB Output is correct
131 Correct 2160 ms 2516 KB Output is correct
132 Execution timed out 5076 ms 8388 KB Time limit exceeded
133 Halted 0 ms 0 KB -