oj.uz

답안 #805795

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
805795 2023-08-03T23:43:21 Z farhan132 Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 9104 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()));
            assert(is_sorted(R[i].begin(), R[i].end()));
            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

# 결과 실행 시간 메모리 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 3 ms 340 KB Output is correct
5 Correct 16 ms 792 KB Output is correct
6 Correct 11 ms 800 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 9 ms 724 KB Output is correct
9 Correct 9 ms 712 KB Output is correct
10 Correct 9 ms 832 KB Output is correct
11 Correct 10 ms 580 KB Output is correct
12 Correct 10 ms 596 KB Output is correct
13 Correct 12 ms 852 KB Output is correct
14 Correct 8 ms 596 KB Output is correct
15 Correct 2 ms 392 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 7 ms 468 KB Output is correct
18 Correct 9 ms 724 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 9 ms 560 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2133 ms 4824 KB Output is correct
2 Correct 2231 ms 4736 KB Output is correct
3 Correct 2120 ms 4844 KB Output is correct
4 Correct 2132 ms 5164 KB Output is correct
5 Correct 1432 ms 8816 KB Output is correct
6 Correct 1309 ms 9016 KB Output is correct
7 Correct 2053 ms 4748 KB Output is correct
8 Correct 2106 ms 4760 KB Output is correct
9 Correct 2114 ms 4796 KB Output is correct
10 Correct 1190 ms 2252 KB Output is correct
11 Correct 1587 ms 2732 KB Output is correct
12 Correct 2021 ms 7264 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 956 KB Output is correct
2 Correct 48 ms 884 KB Output is correct
3 Correct 77 ms 996 KB Output is correct
4 Correct 34 ms 888 KB Output is correct
5 Correct 2404 ms 7336 KB Output is correct
6 Correct 2586 ms 5504 KB Output is correct
7 Correct 2493 ms 5848 KB Output is correct
8 Correct 1542 ms 8880 KB Output is correct
9 Correct 1278 ms 8652 KB Output is correct
10 Correct 1376 ms 6112 KB Output is correct
11 Correct 240 ms 1332 KB Output is correct
12 Correct 1474 ms 7240 KB Output is correct
13 Correct 1581 ms 5660 KB Output is correct
14 Correct 1106 ms 3388 KB Output is correct
15 Correct 947 ms 3076 KB Output is correct
16 Correct 754 ms 2352 KB Output is correct
17 Correct 2672 ms 4840 KB Output is correct
18 Correct 2533 ms 4720 KB Output is correct
19 Correct 2530 ms 5004 KB Output is correct
20 Correct 2524 ms 4848 KB Output is correct
21 Correct 265 ms 1588 KB Output is correct
22 Correct 1037 ms 4420 KB Output is correct
23 Correct 1262 ms 5060 KB Output is correct
24 Correct 1101 ms 4608 KB Output is correct
25 Correct 52 ms 972 KB Output is correct
26 Correct 46 ms 1000 KB Output is correct
27 Correct 51 ms 996 KB Output is correct
28 Correct 42 ms 1000 KB Output is correct
29 Correct 1279 ms 5452 KB Output is correct
30 Correct 1276 ms 5480 KB Output is correct
31 Correct 1305 ms 8648 KB Output is correct
32 Correct 1340 ms 6164 KB Output is correct
33 Correct 1426 ms 5828 KB Output is correct
34 Correct 853 ms 3232 KB Output is correct
35 Correct 1344 ms 5224 KB Output is correct
36 Correct 1442 ms 5996 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 868 KB Output is correct
2 Correct 36 ms 996 KB Output is correct
3 Correct 35 ms 952 KB Output is correct
4 Correct 41 ms 924 KB Output is correct
5 Correct 1901 ms 7860 KB Output is correct
6 Correct 891 ms 1836 KB Output is correct
7 Correct 1782 ms 8144 KB Output is correct
8 Correct 1234 ms 2316 KB Output is correct
9 Correct 874 ms 4244 KB Output is correct
10 Correct 1236 ms 7616 KB Output is correct
11 Correct 417 ms 2148 KB Output is correct
12 Correct 1171 ms 9040 KB Output is correct
13 Correct 1355 ms 5688 KB Output is correct
14 Correct 963 ms 3512 KB Output is correct
15 Correct 1298 ms 8700 KB Output is correct
16 Correct 1371 ms 5932 KB Output is correct
17 Correct 2101 ms 4832 KB Output is correct
18 Correct 2144 ms 4900 KB Output is correct
19 Correct 2154 ms 4836 KB Output is correct
20 Correct 2079 ms 4804 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 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 3 ms 340 KB Output is correct
5 Correct 16 ms 792 KB Output is correct
6 Correct 11 ms 800 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 9 ms 724 KB Output is correct
9 Correct 9 ms 712 KB Output is correct
10 Correct 9 ms 832 KB Output is correct
11 Correct 10 ms 580 KB Output is correct
12 Correct 10 ms 596 KB Output is correct
13 Correct 12 ms 852 KB Output is correct
14 Correct 8 ms 596 KB Output is correct
15 Correct 2 ms 392 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 7 ms 468 KB Output is correct
18 Correct 9 ms 724 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 9 ms 560 KB Output is correct
21 Correct 2133 ms 4824 KB Output is correct
22 Correct 2231 ms 4736 KB Output is correct
23 Correct 2120 ms 4844 KB Output is correct
24 Correct 2132 ms 5164 KB Output is correct
25 Correct 1432 ms 8816 KB Output is correct
26 Correct 1309 ms 9016 KB Output is correct
27 Correct 2053 ms 4748 KB Output is correct
28 Correct 2106 ms 4760 KB Output is correct
29 Correct 2114 ms 4796 KB Output is correct
30 Correct 1190 ms 2252 KB Output is correct
31 Correct 1587 ms 2732 KB Output is correct
32 Correct 2021 ms 7264 KB Output is correct
33 Correct 34 ms 868 KB Output is correct
34 Correct 36 ms 996 KB Output is correct
35 Correct 35 ms 952 KB Output is correct
36 Correct 41 ms 924 KB Output is correct
37 Correct 1901 ms 7860 KB Output is correct
38 Correct 891 ms 1836 KB Output is correct
39 Correct 1782 ms 8144 KB Output is correct
40 Correct 1234 ms 2316 KB Output is correct
41 Correct 874 ms 4244 KB Output is correct
42 Correct 1236 ms 7616 KB Output is correct
43 Correct 417 ms 2148 KB Output is correct
44 Correct 1171 ms 9040 KB Output is correct
45 Correct 1355 ms 5688 KB Output is correct
46 Correct 963 ms 3512 KB Output is correct
47 Correct 1298 ms 8700 KB Output is correct
48 Correct 1371 ms 5932 KB Output is correct
49 Correct 2101 ms 4832 KB Output is correct
50 Correct 2144 ms 4900 KB Output is correct
51 Correct 2154 ms 4836 KB Output is correct
52 Correct 2079 ms 4804 KB Output is correct
53 Correct 43 ms 892 KB Output is correct
54 Correct 45 ms 972 KB Output is correct
55 Correct 35 ms 936 KB Output is correct
56 Correct 35 ms 976 KB Output is correct
57 Correct 1670 ms 3036 KB Output is correct
58 Correct 669 ms 1492 KB Output is correct
59 Correct 2138 ms 5700 KB Output is correct
60 Correct 540 ms 1388 KB Output is correct
61 Correct 1183 ms 5592 KB Output is correct
62 Correct 1271 ms 8340 KB Output is correct
63 Correct 1229 ms 8800 KB Output is correct
64 Correct 1252 ms 8444 KB Output is correct
65 Correct 669 ms 2836 KB Output is correct
66 Correct 602 ms 2268 KB Output is correct
67 Correct 1402 ms 5976 KB Output is correct
68 Correct 1300 ms 5072 KB Output is correct
69 Correct 2068 ms 4876 KB Output is correct
70 Correct 2113 ms 4828 KB Output is correct
71 Correct 2112 ms 4800 KB Output is correct
72 Correct 2133 ms 4836 KB Output is correct
73 Correct 719 ms 3020 KB Output is correct
74 Correct 1074 ms 4988 KB Output is correct
75 Correct 1163 ms 9104 KB Output is correct
76 Correct 1221 ms 8792 KB Output is correct
77 Correct 39 ms 984 KB Output is correct
78 Correct 34 ms 932 KB Output is correct
79 Correct 47 ms 976 KB Output is correct
80 Correct 39 ms 996 KB Output is correct
81 Correct 1090 ms 4828 KB Output is correct
82 Correct 681 ms 3032 KB Output is correct
83 Correct 430 ms 2096 KB Output is correct
84 Correct 1143 ms 4908 KB Output is correct
85 Correct 1417 ms 5976 KB Output is correct
86 Correct 1475 ms 7160 KB Output is correct
87 Correct 1069 ms 4292 KB Output is correct
88 Correct 633 ms 2136 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 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 3 ms 340 KB Output is correct
5 Correct 16 ms 792 KB Output is correct
6 Correct 11 ms 800 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 9 ms 724 KB Output is correct
9 Correct 9 ms 712 KB Output is correct
10 Correct 9 ms 832 KB Output is correct
11 Correct 10 ms 580 KB Output is correct
12 Correct 10 ms 596 KB Output is correct
13 Correct 12 ms 852 KB Output is correct
14 Correct 8 ms 596 KB Output is correct
15 Correct 2 ms 392 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 7 ms 468 KB Output is correct
18 Correct 9 ms 724 KB Output is correct
19 Correct 7 ms 468 KB Output is correct
20 Correct 9 ms 560 KB Output is correct
21 Correct 2133 ms 4824 KB Output is correct
22 Correct 2231 ms 4736 KB Output is correct
23 Correct 2120 ms 4844 KB Output is correct
24 Correct 2132 ms 5164 KB Output is correct
25 Correct 1432 ms 8816 KB Output is correct
26 Correct 1309 ms 9016 KB Output is correct
27 Correct 2053 ms 4748 KB Output is correct
28 Correct 2106 ms 4760 KB Output is correct
29 Correct 2114 ms 4796 KB Output is correct
30 Correct 1190 ms 2252 KB Output is correct
31 Correct 1587 ms 2732 KB Output is correct
32 Correct 2021 ms 7264 KB Output is correct
33 Correct 48 ms 956 KB Output is correct
34 Correct 48 ms 884 KB Output is correct
35 Correct 77 ms 996 KB Output is correct
36 Correct 34 ms 888 KB Output is correct
37 Correct 2404 ms 7336 KB Output is correct
38 Correct 2586 ms 5504 KB Output is correct
39 Correct 2493 ms 5848 KB Output is correct
40 Correct 1542 ms 8880 KB Output is correct
41 Correct 1278 ms 8652 KB Output is correct
42 Correct 1376 ms 6112 KB Output is correct
43 Correct 240 ms 1332 KB Output is correct
44 Correct 1474 ms 7240 KB Output is correct
45 Correct 1581 ms 5660 KB Output is correct
46 Correct 1106 ms 3388 KB Output is correct
47 Correct 947 ms 3076 KB Output is correct
48 Correct 754 ms 2352 KB Output is correct
49 Correct 2672 ms 4840 KB Output is correct
50 Correct 2533 ms 4720 KB Output is correct
51 Correct 2530 ms 5004 KB Output is correct
52 Correct 2524 ms 4848 KB Output is correct
53 Correct 265 ms 1588 KB Output is correct
54 Correct 1037 ms 4420 KB Output is correct
55 Correct 1262 ms 5060 KB Output is correct
56 Correct 1101 ms 4608 KB Output is correct
57 Correct 52 ms 972 KB Output is correct
58 Correct 46 ms 1000 KB Output is correct
59 Correct 51 ms 996 KB Output is correct
60 Correct 42 ms 1000 KB Output is correct
61 Correct 1279 ms 5452 KB Output is correct
62 Correct 1276 ms 5480 KB Output is correct
63 Correct 1305 ms 8648 KB Output is correct
64 Correct 1340 ms 6164 KB Output is correct
65 Correct 1426 ms 5828 KB Output is correct
66 Correct 853 ms 3232 KB Output is correct
67 Correct 1344 ms 5224 KB Output is correct
68 Correct 1442 ms 5996 KB Output is correct
69 Correct 34 ms 868 KB Output is correct
70 Correct 36 ms 996 KB Output is correct
71 Correct 35 ms 952 KB Output is correct
72 Correct 41 ms 924 KB Output is correct
73 Correct 1901 ms 7860 KB Output is correct
74 Correct 891 ms 1836 KB Output is correct
75 Correct 1782 ms 8144 KB Output is correct
76 Correct 1234 ms 2316 KB Output is correct
77 Correct 874 ms 4244 KB Output is correct
78 Correct 1236 ms 7616 KB Output is correct
79 Correct 417 ms 2148 KB Output is correct
80 Correct 1171 ms 9040 KB Output is correct
81 Correct 1355 ms 5688 KB Output is correct
82 Correct 963 ms 3512 KB Output is correct
83 Correct 1298 ms 8700 KB Output is correct
84 Correct 1371 ms 5932 KB Output is correct
85 Correct 2101 ms 4832 KB Output is correct
86 Correct 2144 ms 4900 KB Output is correct
87 Correct 2154 ms 4836 KB Output is correct
88 Correct 2079 ms 4804 KB Output is correct
89 Correct 43 ms 892 KB Output is correct
90 Correct 45 ms 972 KB Output is correct
91 Correct 35 ms 936 KB Output is correct
92 Correct 35 ms 976 KB Output is correct
93 Correct 1670 ms 3036 KB Output is correct
94 Correct 669 ms 1492 KB Output is correct
95 Correct 2138 ms 5700 KB Output is correct
96 Correct 540 ms 1388 KB Output is correct
97 Correct 1183 ms 5592 KB Output is correct
98 Correct 1271 ms 8340 KB Output is correct
99 Correct 1229 ms 8800 KB Output is correct
100 Correct 1252 ms 8444 KB Output is correct
101 Correct 669 ms 2836 KB Output is correct
102 Correct 602 ms 2268 KB Output is correct
103 Correct 1402 ms 5976 KB Output is correct
104 Correct 1300 ms 5072 KB Output is correct
105 Correct 2068 ms 4876 KB Output is correct
106 Correct 2113 ms 4828 KB Output is correct
107 Correct 2112 ms 4800 KB Output is correct
108 Correct 2133 ms 4836 KB Output is correct
109 Correct 719 ms 3020 KB Output is correct
110 Correct 1074 ms 4988 KB Output is correct
111 Correct 1163 ms 9104 KB Output is correct
112 Correct 1221 ms 8792 KB Output is correct
113 Correct 39 ms 984 KB Output is correct
114 Correct 34 ms 932 KB Output is correct
115 Correct 47 ms 976 KB Output is correct
116 Correct 39 ms 996 KB Output is correct
117 Correct 1090 ms 4828 KB Output is correct
118 Correct 681 ms 3032 KB Output is correct
119 Correct 430 ms 2096 KB Output is correct
120 Correct 1143 ms 4908 KB Output is correct
121 Correct 1417 ms 5976 KB Output is correct
122 Correct 1475 ms 7160 KB Output is correct
123 Correct 1069 ms 4292 KB Output is correct
124 Correct 633 ms 2136 KB Output is correct
125 Correct 89 ms 1508 KB Output is correct
126 Correct 95 ms 1628 KB Output is correct
127 Correct 150 ms 1532 KB Output is correct
128 Correct 131 ms 1556 KB Output is correct
129 Correct 95 ms 1580 KB Output is correct
130 Correct 117 ms 1620 KB Output is correct
131 Correct 2699 ms 2476 KB Output is correct
132 Execution timed out 5037 ms 8352 KB Time limit exceeded
133 Halted 0 ms 0 KB -