oj.uz

Submission #157128

# Submission time Handle Problem Language Result Execution time Memory
157128 2019-10-09T16:50:22 Z hentai_lover Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 11912 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define lft(x) x * 2
#define rgt(x) x * 2 + 1

#define tm hui_pizda
#define ft first
#define sd second
#define pb push_back
#define pf push_front
#define sz size()
#define cnt continue
#define m_p make_pair
#define fr(i, l, r) for(int i = l; i <= r; ++ i)
#define rf(i, r, l) for(int i = r; i >= l; -- i)
#define all(x) x.begin(), x.end()
//#pragma GCC optimize(-O3)
//#pragma GCC optimize(Ofast)
//#pragma GCC optimize("unroll-loops")

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using _set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <ll> vl;
typedef vector <pii> vpi;
typedef vector <pll> vpl;

mt19937_64 rnd(time(NULL));

const ll N = 1e6;
const ll mtrxN = 10;
const ll oo = 1e18 + 10;
const ll B = 500;
const ll mod = 1e9 + 7;
const ll B1 = 2100;
const ll B2 = 2100;


struct mtrx{
    ll m[mtrxN][mtrxN] = {};
};
mtrx mtrx_mult(mtrx a, mtrx b){
    mtrx c;
    fr(i, 0, mtrxN - 1){
        fr(j, 0, mtrxN - 1){
            ll sum = 0;
            fr(x, 0, mtrxN - 1){
                sum += a.m[i][x] * b.m[x][j];
                sum %= mod;
            }
            c.m[i][j] = sum;
        }
    }
    return c;
}
mtrx mtrx_pow(mtrx a, ll n){
    mtrx res;
    fr(i, 0, mtrxN - 1)fr(j, 0, mtrxN - 1)res.m[i][j] = a.m[i][j];
    n --;
    while(n){
        if(n&1)res = mtrx_mult(res, a);
        a = mtrx_mult(a, a);
        n >>= 1;
    }
    return res;
}
ll _pow(ll a, ll n){
    ll r = 1;
    while(n){
        if(n&1)r = r * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return r;
}
ll div(ll x, ll y, ll md){
    return x * _pow(y, md - 2) % md;
}

ll lastans, last = 1, n, t, i, a, b, k, l, r, now, usd[N], mn[N], mx[N];
vpl temp, sqd1, sqd2, deleted, aded;
vl sqd3, sqd4;
pll o[N];

ll cnv(ll a){
    return (t * lastans) ^ a;
}

ll get1(ll l, ll r, ll x){
    ll last = 0, ans = 0;
    for(ll i = B2; i < (ll)sqd1.sz; i += B2){
        if(mx[i] < l || mn[i] > r);
        else if(mn[i] < l && l <= mx[i] || mn[i] <= r && r < mx[i]){
            //посчитать вручную
            //cout << "last: " << last << " i: " << i << endl;
            fr(j, last, i - 1)
                if(sqd1[j].sd >= l && sqd1[j].sd <= r && sqd1[j].ft >= x)ans ++;
        }   else{
            ll pos = lower_bound(sqd3.begin() + last, sqd3.begin() + i, x) - sqd3.begin();
            ans += i - pos;
        }
        last = i;
    }
    fr(i, last, (ll)sqd1.sz - 1)
        if(sqd1[i].sd >= l && sqd1[i].sd <= r && sqd1[i].ft >= x)ans ++;
    return ans;
}

ll get2(ll l, ll r, ll x){
    ll last = 0, ans = 0;
    for(ll i = B2; i < (ll)sqd2.sz; i += B2){
        if(mx[i] < l || mn[i] > r);
        else if(mn[i] < l && l <= mx[i] || mn[i] <= r && r < mx[i]){
            //посчитать вручную
            fr(j, last, i - 1)
                if(sqd2[j].sd >= l && sqd2[j].sd <= r && sqd2[j].ft >= x)ans ++;
        }   else{
            ll pos = lower_bound(sqd4.begin() + last, sqd4.begin() + i, x) - sqd4.begin();
            ans += i - pos;
        }
        last = i;
    }
    fr(i, last, (ll)sqd2.sz - 1)
        if(sqd2[i].sd >= l && sqd2[i].sd <= r && sqd2[i].ft >= x)ans ++;
    return ans;
}

int main(){
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n >> t;
    fr(tr, 1, n){
        cin >> i;
        if(i == 1){
            cin >> a >> b;
            l = cnv(a);
            r = cnv(b);
            if(l > r)swap(l, r);
            o[++ now] = {l, r};
            aded.pb({l, r});
        }
        if(i == 2){
            ll d;
            cin >> d;
            //удалить отрезок l..r
            usd[d] = 1;
            deleted.pb({o[d].ft, o[d].sd});
        }

        if(i == 3){
            cin >> a >> b >> k;
            l = cnv(a);
            r = cnv(b);
            if(l > r)swap(l, r);

            //(кол-во чисел с li 1..l - 1 и ri >= l + k - 1) + (кол-во чисел с li l..r - k + 1 и ri - li + 1)

            //пройтись по накопленному вектору отрезков

            lastans = 0;
            for(auto i : aded)
                if(i.ft < l && i.sd >= l + k - 1 || i.ft >= l && i.ft <= r - k + 1 && i.sd - i.ft + 1 >= k)lastans ++;
            for(auto i : deleted)
                if(i.ft < l && i.sd >= l + k - 1 || i.ft >= l && i.ft <= r - k + 1 && i.sd - i.ft + 1 >= k)lastans --;


            //взять ответ из посчитанной ранее sqrtdecompompozition
            lastans += get1(1, l - 1, l + k - 1);
            lastans += get2(l, r - k + 1, k);
//            cout << "                 ";
            cout << lastans << "\n";
        }

        if(tr % B1 == 0){
            temp.clear();
            fr(i, 1, now){
                if(usd[i])cnt;
                temp.pb(o[i]);
            }
            sort(temp.begin(), temp.end());
            vpl temp2, temp3;
            aded.clear();
            deleted.clear();
            sqd1.clear();
            sqd2.clear();
            sqd3.clear();
            sqd4.clear();

            ll n = oo, x = -oo;
            fr(i, 0, (ll)temp.sz - 1){

                if(i != 0 && i % B2 == 0){
                    mn[i] = n, mx[i] = x;
                    sort(temp2.begin(), temp2.end());
                    sort(temp3.begin(), temp3.end());
                    for(auto i : temp2)sqd1.pb(i), sqd3.pb(i.ft);
                    for(auto i : temp3)sqd2.pb(i), sqd4.pb(i.ft);
                    n = oo, x = -oo;
                    temp2.clear();
                    temp3.clear();
                }
                temp2.pb({temp[i].sd, temp[i].ft});
                temp3.pb({temp[i].sd - temp[i].ft + 1, temp[i].ft});
                n = min(n, temp[i].ft);
                x = max(x, temp[i].ft);
            }
            sort(temp2.begin(), temp2.end());
            sort(temp3.begin(), temp3.end());
            for(auto i : temp2)sqd1.pb(i), sqd3.pb(i.ft);
            for(auto i : temp3)sqd2.pb(i), sqd4.pb(i.ft);

            last = now + 1;
        }
    }
    return 0;
}
/*

*/

Compilation message

segments.cpp: In function 'll get1(ll, ll, ll)':
segments.cpp:103:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
         else if(mn[i] < l && l <= mx[i] || mn[i] <= r && r < mx[i]){
                 ~~~~~~~~~~^~~~~~~~~~~~~
segments.cpp: In function 'll get2(ll, ll, ll)':
segments.cpp:123:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
         else if(mn[i] < l && l <= mx[i] || mn[i] <= r && r < mx[i]){
                 ~~~~~~~~~~^~~~~~~~~~~~~
segments.cpp: In function 'int main()':
segments.cpp:171:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
                 if(i.ft < l && i.sd >= l + k - 1 || i.ft >= l && i.ft <= r - k + 1 && i.sd - i.ft + 1 >= k)lastans ++;
                    ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
segments.cpp:173:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
                 if(i.ft < l && i.sd >= l + k - 1 || i.ft >= l && i.ft <= r - k + 1 && i.sd - i.ft + 1 >= k)lastans --;
                    ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 11 ms 588 KB Output is correct
4 Correct 12 ms 576 KB Output is correct
5 Correct 23 ms 1256 KB Output is correct
6 Correct 31 ms 1016 KB Output is correct
7 Correct 17 ms 692 KB Output is correct
8 Correct 21 ms 1044 KB Output is correct
9 Correct 19 ms 932 KB Output is correct
10 Correct 9 ms 1272 KB Output is correct
11 Correct 48 ms 1044 KB Output is correct
12 Correct 48 ms 1016 KB Output is correct
13 Correct 11 ms 1272 KB Output is correct
14 Correct 22 ms 1016 KB Output is correct
15 Correct 12 ms 632 KB Output is correct
16 Correct 12 ms 632 KB Output is correct
17 Correct 21 ms 760 KB Output is correct
18 Correct 14 ms 1120 KB Output is correct
19 Correct 19 ms 820 KB Output is correct
20 Correct 19 ms 760 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1968 ms 7392 KB Output is correct
2 Correct 1948 ms 7508 KB Output is correct
3 Correct 1945 ms 7392 KB Output is correct
4 Correct 1757 ms 7820 KB Output is correct
5 Correct 837 ms 11844 KB Output is correct
6 Correct 743 ms 11912 KB Output is correct
7 Correct 1952 ms 7432 KB Output is correct
8 Correct 1935 ms 7360 KB Output is correct
9 Correct 1933 ms 7320 KB Output is correct
10 Correct 2141 ms 4836 KB Output is correct
11 Correct 2298 ms 5552 KB Output is correct
12 Correct 1471 ms 9872 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 3180 KB Output is correct
2 Correct 216 ms 3100 KB Output is correct
3 Correct 299 ms 3256 KB Output is correct
4 Correct 219 ms 2460 KB Output is correct
5 Correct 1414 ms 9348 KB Output is correct
6 Correct 1757 ms 7508 KB Output is correct
7 Correct 1606 ms 9068 KB Output is correct
8 Correct 846 ms 11028 KB Output is correct
9 Correct 775 ms 11488 KB Output is correct
10 Correct 987 ms 8392 KB Output is correct
11 Correct 782 ms 2988 KB Output is correct
12 Correct 979 ms 9556 KB Output is correct
13 Correct 936 ms 7832 KB Output is correct
14 Correct 948 ms 5452 KB Output is correct
15 Correct 900 ms 5072 KB Output is correct
16 Correct 849 ms 4196 KB Output is correct
17 Correct 1969 ms 6832 KB Output is correct
18 Correct 1965 ms 6680 KB Output is correct
19 Correct 1998 ms 6732 KB Output is correct
20 Correct 1971 ms 6772 KB Output is correct
21 Correct 884 ms 3312 KB Output is correct
22 Correct 1063 ms 6360 KB Output is correct
23 Correct 1066 ms 7208 KB Output is correct
24 Correct 1109 ms 6424 KB Output is correct
25 Correct 252 ms 2448 KB Output is correct
26 Correct 225 ms 2448 KB Output is correct
27 Correct 250 ms 2536 KB Output is correct
28 Correct 232 ms 2484 KB Output is correct
29 Correct 1027 ms 7540 KB Output is correct
30 Correct 1022 ms 7592 KB Output is correct
31 Correct 757 ms 11556 KB Output is correct
32 Correct 968 ms 8480 KB Output is correct
33 Correct 931 ms 8068 KB Output is correct
34 Correct 939 ms 5028 KB Output is correct
35 Correct 964 ms 7180 KB Output is correct
36 Correct 937 ms 8280 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 3240 KB Output is correct
2 Correct 219 ms 2464 KB Output is correct
3 Correct 221 ms 2416 KB Output is correct
4 Correct 232 ms 2424 KB Output is correct
5 Correct 1309 ms 9676 KB Output is correct
6 Correct 2184 ms 2424 KB Output is correct
7 Correct 1160 ms 9120 KB Output is correct
8 Correct 2348 ms 3100 KB Output is correct
9 Correct 1055 ms 5156 KB Output is correct
10 Correct 936 ms 8832 KB Output is correct
11 Correct 1041 ms 2780 KB Output is correct
12 Correct 705 ms 10736 KB Output is correct
13 Correct 956 ms 6648 KB Output is correct
14 Correct 960 ms 4584 KB Output is correct
15 Correct 755 ms 10224 KB Output is correct
16 Correct 937 ms 6976 KB Output is correct
17 Correct 1960 ms 5624 KB Output is correct
18 Correct 1935 ms 5552 KB Output is correct
19 Correct 2041 ms 5680 KB Output is correct
20 Correct 1939 ms 5616 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 11 ms 588 KB Output is correct
4 Correct 12 ms 576 KB Output is correct
5 Correct 23 ms 1256 KB Output is correct
6 Correct 31 ms 1016 KB Output is correct
7 Correct 17 ms 692 KB Output is correct
8 Correct 21 ms 1044 KB Output is correct
9 Correct 19 ms 932 KB Output is correct
10 Correct 9 ms 1272 KB Output is correct
11 Correct 48 ms 1044 KB Output is correct
12 Correct 48 ms 1016 KB Output is correct
13 Correct 11 ms 1272 KB Output is correct
14 Correct 22 ms 1016 KB Output is correct
15 Correct 12 ms 632 KB Output is correct
16 Correct 12 ms 632 KB Output is correct
17 Correct 21 ms 760 KB Output is correct
18 Correct 14 ms 1120 KB Output is correct
19 Correct 19 ms 820 KB Output is correct
20 Correct 19 ms 760 KB Output is correct
21 Correct 1968 ms 7392 KB Output is correct
22 Correct 1948 ms 7508 KB Output is correct
23 Correct 1945 ms 7392 KB Output is correct
24 Correct 1757 ms 7820 KB Output is correct
25 Correct 837 ms 11844 KB Output is correct
26 Correct 743 ms 11912 KB Output is correct
27 Correct 1952 ms 7432 KB Output is correct
28 Correct 1935 ms 7360 KB Output is correct
29 Correct 1933 ms 7320 KB Output is correct
30 Correct 2141 ms 4836 KB Output is correct
31 Correct 2298 ms 5552 KB Output is correct
32 Correct 1471 ms 9872 KB Output is correct
33 Correct 217 ms 3240 KB Output is correct
34 Correct 219 ms 2464 KB Output is correct
35 Correct 221 ms 2416 KB Output is correct
36 Correct 232 ms 2424 KB Output is correct
37 Correct 1309 ms 9676 KB Output is correct
38 Correct 2184 ms 2424 KB Output is correct
39 Correct 1160 ms 9120 KB Output is correct
40 Correct 2348 ms 3100 KB Output is correct
41 Correct 1055 ms 5156 KB Output is correct
42 Correct 936 ms 8832 KB Output is correct
43 Correct 1041 ms 2780 KB Output is correct
44 Correct 705 ms 10736 KB Output is correct
45 Correct 956 ms 6648 KB Output is correct
46 Correct 960 ms 4584 KB Output is correct
47 Correct 755 ms 10224 KB Output is correct
48 Correct 937 ms 6976 KB Output is correct
49 Correct 1960 ms 5624 KB Output is correct
50 Correct 1935 ms 5552 KB Output is correct
51 Correct 2041 ms 5680 KB Output is correct
52 Correct 1939 ms 5616 KB Output is correct
53 Correct 235 ms 1340 KB Output is correct
54 Correct 236 ms 1376 KB Output is correct
55 Correct 218 ms 1364 KB Output is correct
56 Correct 226 ms 1272 KB Output is correct
57 Correct 2063 ms 4108 KB Output is correct
58 Correct 2013 ms 1972 KB Output is correct
59 Correct 1616 ms 6360 KB Output is correct
60 Correct 2012 ms 1748 KB Output is correct
61 Correct 1000 ms 6780 KB Output is correct
62 Correct 847 ms 10020 KB Output is correct
63 Correct 762 ms 10468 KB Output is correct
64 Correct 807 ms 10100 KB Output is correct
65 Correct 935 ms 3504 KB Output is correct
66 Correct 949 ms 2948 KB Output is correct
67 Correct 1038 ms 7152 KB Output is correct
68 Correct 1004 ms 6236 KB Output is correct
69 Correct 1948 ms 5688 KB Output is correct
70 Correct 1939 ms 5664 KB Output is correct
71 Correct 1942 ms 5796 KB Output is correct
72 Correct 1937 ms 5864 KB Output is correct
73 Correct 1074 ms 3956 KB Output is correct
74 Correct 1020 ms 5988 KB Output is correct
75 Correct 674 ms 10904 KB Output is correct
76 Correct 730 ms 10540 KB Output is correct
77 Correct 226 ms 1272 KB Output is correct
78 Correct 223 ms 1400 KB Output is correct
79 Correct 239 ms 1272 KB Output is correct
80 Correct 223 ms 1268 KB Output is correct
81 Correct 1060 ms 5860 KB Output is correct
82 Correct 1088 ms 3756 KB Output is correct
83 Correct 963 ms 2832 KB Output is correct
84 Correct 1054 ms 5976 KB Output is correct
85 Correct 937 ms 7268 KB Output is correct
86 Correct 929 ms 8604 KB Output is correct
87 Correct 977 ms 5016 KB Output is correct
88 Correct 874 ms 2808 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 11 ms 588 KB Output is correct
4 Correct 12 ms 576 KB Output is correct
5 Correct 23 ms 1256 KB Output is correct
6 Correct 31 ms 1016 KB Output is correct
7 Correct 17 ms 692 KB Output is correct
8 Correct 21 ms 1044 KB Output is correct
9 Correct 19 ms 932 KB Output is correct
10 Correct 9 ms 1272 KB Output is correct
11 Correct 48 ms 1044 KB Output is correct
12 Correct 48 ms 1016 KB Output is correct
13 Correct 11 ms 1272 KB Output is correct
14 Correct 22 ms 1016 KB Output is correct
15 Correct 12 ms 632 KB Output is correct
16 Correct 12 ms 632 KB Output is correct
17 Correct 21 ms 760 KB Output is correct
18 Correct 14 ms 1120 KB Output is correct
19 Correct 19 ms 820 KB Output is correct
20 Correct 19 ms 760 KB Output is correct
21 Correct 1968 ms 7392 KB Output is correct
22 Correct 1948 ms 7508 KB Output is correct
23 Correct 1945 ms 7392 KB Output is correct
24 Correct 1757 ms 7820 KB Output is correct
25 Correct 837 ms 11844 KB Output is correct
26 Correct 743 ms 11912 KB Output is correct
27 Correct 1952 ms 7432 KB Output is correct
28 Correct 1935 ms 7360 KB Output is correct
29 Correct 1933 ms 7320 KB Output is correct
30 Correct 2141 ms 4836 KB Output is correct
31 Correct 2298 ms 5552 KB Output is correct
32 Correct 1471 ms 9872 KB Output is correct
33 Correct 242 ms 3180 KB Output is correct
34 Correct 216 ms 3100 KB Output is correct
35 Correct 299 ms 3256 KB Output is correct
36 Correct 219 ms 2460 KB Output is correct
37 Correct 1414 ms 9348 KB Output is correct
38 Correct 1757 ms 7508 KB Output is correct
39 Correct 1606 ms 9068 KB Output is correct
40 Correct 846 ms 11028 KB Output is correct
41 Correct 775 ms 11488 KB Output is correct
42 Correct 987 ms 8392 KB Output is correct
43 Correct 782 ms 2988 KB Output is correct
44 Correct 979 ms 9556 KB Output is correct
45 Correct 936 ms 7832 KB Output is correct
46 Correct 948 ms 5452 KB Output is correct
47 Correct 900 ms 5072 KB Output is correct
48 Correct 849 ms 4196 KB Output is correct
49 Correct 1969 ms 6832 KB Output is correct
50 Correct 1965 ms 6680 KB Output is correct
51 Correct 1998 ms 6732 KB Output is correct
52 Correct 1971 ms 6772 KB Output is correct
53 Correct 884 ms 3312 KB Output is correct
54 Correct 1063 ms 6360 KB Output is correct
55 Correct 1066 ms 7208 KB Output is correct
56 Correct 1109 ms 6424 KB Output is correct
57 Correct 252 ms 2448 KB Output is correct
58 Correct 225 ms 2448 KB Output is correct
59 Correct 250 ms 2536 KB Output is correct
60 Correct 232 ms 2484 KB Output is correct
61 Correct 1027 ms 7540 KB Output is correct
62 Correct 1022 ms 7592 KB Output is correct
63 Correct 757 ms 11556 KB Output is correct
64 Correct 968 ms 8480 KB Output is correct
65 Correct 931 ms 8068 KB Output is correct
66 Correct 939 ms 5028 KB Output is correct
67 Correct 964 ms 7180 KB Output is correct
68 Correct 937 ms 8280 KB Output is correct
69 Correct 217 ms 3240 KB Output is correct
70 Correct 219 ms 2464 KB Output is correct
71 Correct 221 ms 2416 KB Output is correct
72 Correct 232 ms 2424 KB Output is correct
73 Correct 1309 ms 9676 KB Output is correct
74 Correct 2184 ms 2424 KB Output is correct
75 Correct 1160 ms 9120 KB Output is correct
76 Correct 2348 ms 3100 KB Output is correct
77 Correct 1055 ms 5156 KB Output is correct
78 Correct 936 ms 8832 KB Output is correct
79 Correct 1041 ms 2780 KB Output is correct
80 Correct 705 ms 10736 KB Output is correct
81 Correct 956 ms 6648 KB Output is correct
82 Correct 960 ms 4584 KB Output is correct
83 Correct 755 ms 10224 KB Output is correct
84 Correct 937 ms 6976 KB Output is correct
85 Correct 1960 ms 5624 KB Output is correct
86 Correct 1935 ms 5552 KB Output is correct
87 Correct 2041 ms 5680 KB Output is correct
88 Correct 1939 ms 5616 KB Output is correct
89 Correct 235 ms 1340 KB Output is correct
90 Correct 236 ms 1376 KB Output is correct
91 Correct 218 ms 1364 KB Output is correct
92 Correct 226 ms 1272 KB Output is correct
93 Correct 2063 ms 4108 KB Output is correct
94 Correct 2013 ms 1972 KB Output is correct
95 Correct 1616 ms 6360 KB Output is correct
96 Correct 2012 ms 1748 KB Output is correct
97 Correct 1000 ms 6780 KB Output is correct
98 Correct 847 ms 10020 KB Output is correct
99 Correct 762 ms 10468 KB Output is correct
100 Correct 807 ms 10100 KB Output is correct
101 Correct 935 ms 3504 KB Output is correct
102 Correct 949 ms 2948 KB Output is correct
103 Correct 1038 ms 7152 KB Output is correct
104 Correct 1004 ms 6236 KB Output is correct
105 Correct 1948 ms 5688 KB Output is correct
106 Correct 1939 ms 5664 KB Output is correct
107 Correct 1942 ms 5796 KB Output is correct
108 Correct 1937 ms 5864 KB Output is correct
109 Correct 1074 ms 3956 KB Output is correct
110 Correct 1020 ms 5988 KB Output is correct
111 Correct 674 ms 10904 KB Output is correct
112 Correct 730 ms 10540 KB Output is correct
113 Correct 226 ms 1272 KB Output is correct
114 Correct 223 ms 1400 KB Output is correct
115 Correct 239 ms 1272 KB Output is correct
116 Correct 223 ms 1268 KB Output is correct
117 Correct 1060 ms 5860 KB Output is correct
118 Correct 1088 ms 3756 KB Output is correct
119 Correct 963 ms 2832 KB Output is correct
120 Correct 1054 ms 5976 KB Output is correct
121 Correct 937 ms 7268 KB Output is correct
122 Correct 929 ms 8604 KB Output is correct
123 Correct 977 ms 5016 KB Output is correct
124 Correct 874 ms 2808 KB Output is correct
125 Correct 468 ms 2260 KB Output is correct
126 Correct 493 ms 2352 KB Output is correct
127 Correct 560 ms 2300 KB Output is correct
128 Correct 493 ms 2368 KB Output is correct
129 Correct 451 ms 2296 KB Output is correct
130 Correct 520 ms 2316 KB Output is correct
131 Correct 4909 ms 3632 KB Output is correct
132 Execution timed out 5009 ms 10000 KB Time limit exceeded
133 Halted 0 ms 0 KB -