oj.uz

Submission #171070

# Submission time Handle Problem Language Result Execution time Memory
171070 2019-12-27T10:00:27 Z hentai_lover Segments (IZhO18_segments) C++14
100 / 100
 4997 ms 15632 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 int 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 = 1500;
const ll B2 = 1500;


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:42:20: warning: overflow in implicit constant conversion [-Woverflow]
 const ll oo = 1e18 + 10;
               ~~~~~^~~~
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 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 11 ms 504 KB Output is correct
4 Correct 10 ms 508 KB Output is correct
5 Correct 21 ms 888 KB Output is correct
6 Correct 29 ms 744 KB Output is correct
7 Correct 16 ms 632 KB Output is correct
8 Correct 18 ms 760 KB Output is correct
9 Correct 15 ms 760 KB Output is correct
10 Correct 9 ms 892 KB Output is correct
11 Correct 39 ms 788 KB Output is correct
12 Correct 38 ms 888 KB Output is correct
13 Correct 10 ms 888 KB Output is correct
14 Correct 19 ms 696 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 10 ms 632 KB Output is correct
17 Correct 20 ms 632 KB Output is correct
18 Correct 13 ms 888 KB Output is correct
19 Correct 18 ms 700 KB Output is correct
20 Correct 19 ms 728 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1664 ms 6108 KB Output is correct
2 Correct 1669 ms 6224 KB Output is correct
3 Correct 1664 ms 6252 KB Output is correct
4 Correct 1647 ms 6436 KB Output is correct
5 Correct 983 ms 7604 KB Output is correct
6 Correct 914 ms 7832 KB Output is correct
7 Correct 1660 ms 6380 KB Output is correct
8 Correct 1665 ms 6244 KB Output is correct
9 Correct 1653 ms 6184 KB Output is correct
10 Correct 1871 ms 5004 KB Output is correct
11 Correct 1754 ms 5272 KB Output is correct
12 Correct 1467 ms 7192 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 2856 KB Output is correct
2 Correct 171 ms 2752 KB Output is correct
3 Correct 252 ms 2824 KB Output is correct
4 Correct 176 ms 2780 KB Output is correct
5 Correct 1431 ms 6708 KB Output is correct
6 Correct 1559 ms 6320 KB Output is correct
7 Correct 1517 ms 6636 KB Output is correct
8 Correct 972 ms 7636 KB Output is correct
9 Correct 947 ms 7808 KB Output is correct
10 Correct 1049 ms 6436 KB Output is correct
11 Correct 633 ms 3116 KB Output is correct
12 Correct 1058 ms 6692 KB Output is correct
13 Correct 994 ms 5996 KB Output is correct
14 Correct 908 ms 4736 KB Output is correct
15 Correct 856 ms 4328 KB Output is correct
16 Correct 752 ms 4000 KB Output is correct
17 Correct 1660 ms 5860 KB Output is correct
18 Correct 1677 ms 5620 KB Output is correct
19 Correct 1664 ms 5832 KB Output is correct
20 Correct 1661 ms 5964 KB Output is correct
21 Correct 699 ms 3360 KB Output is correct
22 Correct 1033 ms 5088 KB Output is correct
23 Correct 1028 ms 5672 KB Output is correct
24 Correct 1071 ms 5264 KB Output is correct
25 Correct 206 ms 2808 KB Output is correct
26 Correct 178 ms 2808 KB Output is correct
27 Correct 216 ms 2792 KB Output is correct
28 Correct 182 ms 2812 KB Output is correct
29 Correct 1047 ms 5884 KB Output is correct
30 Correct 1045 ms 5808 KB Output is correct
31 Correct 913 ms 7740 KB Output is correct
32 Correct 1027 ms 6604 KB Output is correct
33 Correct 997 ms 6192 KB Output is correct
34 Correct 818 ms 4276 KB Output is correct
35 Correct 988 ms 5404 KB Output is correct
36 Correct 1016 ms 6368 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 3108 KB Output is correct
2 Correct 172 ms 3000 KB Output is correct
3 Correct 174 ms 3052 KB Output is correct
4 Correct 184 ms 3064 KB Output is correct
5 Correct 1308 ms 7304 KB Output is correct
6 Correct 1692 ms 4884 KB Output is correct
7 Correct 1229 ms 7248 KB Output is correct
8 Correct 1856 ms 4948 KB Output is correct
9 Correct 1006 ms 5088 KB Output is correct
10 Correct 1047 ms 6964 KB Output is correct
11 Correct 840 ms 3932 KB Output is correct
12 Correct 898 ms 7976 KB Output is correct
13 Correct 1172 ms 6284 KB Output is correct
14 Correct 907 ms 4712 KB Output is correct
15 Correct 925 ms 7516 KB Output is correct
16 Correct 1016 ms 6496 KB Output is correct
17 Correct 1662 ms 6240 KB Output is correct
18 Correct 1666 ms 6176 KB Output is correct
19 Correct 1659 ms 6176 KB Output is correct
20 Correct 1668 ms 6232 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 11 ms 504 KB Output is correct
4 Correct 10 ms 508 KB Output is correct
5 Correct 21 ms 888 KB Output is correct
6 Correct 29 ms 744 KB Output is correct
7 Correct 16 ms 632 KB Output is correct
8 Correct 18 ms 760 KB Output is correct
9 Correct 15 ms 760 KB Output is correct
10 Correct 9 ms 892 KB Output is correct
11 Correct 39 ms 788 KB Output is correct
12 Correct 38 ms 888 KB Output is correct
13 Correct 10 ms 888 KB Output is correct
14 Correct 19 ms 696 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 10 ms 632 KB Output is correct
17 Correct 20 ms 632 KB Output is correct
18 Correct 13 ms 888 KB Output is correct
19 Correct 18 ms 700 KB Output is correct
20 Correct 19 ms 728 KB Output is correct
21 Correct 1664 ms 6108 KB Output is correct
22 Correct 1669 ms 6224 KB Output is correct
23 Correct 1664 ms 6252 KB Output is correct
24 Correct 1647 ms 6436 KB Output is correct
25 Correct 983 ms 7604 KB Output is correct
26 Correct 914 ms 7832 KB Output is correct
27 Correct 1660 ms 6380 KB Output is correct
28 Correct 1665 ms 6244 KB Output is correct
29 Correct 1653 ms 6184 KB Output is correct
30 Correct 1871 ms 5004 KB Output is correct
31 Correct 1754 ms 5272 KB Output is correct
32 Correct 1467 ms 7192 KB Output is correct
33 Correct 169 ms 3108 KB Output is correct
34 Correct 172 ms 3000 KB Output is correct
35 Correct 174 ms 3052 KB Output is correct
36 Correct 184 ms 3064 KB Output is correct
37 Correct 1308 ms 7304 KB Output is correct
38 Correct 1692 ms 4884 KB Output is correct
39 Correct 1229 ms 7248 KB Output is correct
40 Correct 1856 ms 4948 KB Output is correct
41 Correct 1006 ms 5088 KB Output is correct
42 Correct 1047 ms 6964 KB Output is correct
43 Correct 840 ms 3932 KB Output is correct
44 Correct 898 ms 7976 KB Output is correct
45 Correct 1172 ms 6284 KB Output is correct
46 Correct 907 ms 4712 KB Output is correct
47 Correct 925 ms 7516 KB Output is correct
48 Correct 1016 ms 6496 KB Output is correct
49 Correct 1662 ms 6240 KB Output is correct
50 Correct 1666 ms 6176 KB Output is correct
51 Correct 1659 ms 6176 KB Output is correct
52 Correct 1668 ms 6232 KB Output is correct
53 Correct 186 ms 2940 KB Output is correct
54 Correct 189 ms 3020 KB Output is correct
55 Correct 173 ms 3064 KB Output is correct
56 Correct 174 ms 2912 KB Output is correct
57 Correct 1754 ms 5300 KB Output is correct
58 Correct 1581 ms 4704 KB Output is correct
59 Correct 1598 ms 6472 KB Output is correct
60 Correct 1701 ms 4616 KB Output is correct
61 Correct 1041 ms 6220 KB Output is correct
62 Correct 1002 ms 7636 KB Output is correct
63 Correct 923 ms 7916 KB Output is correct
64 Correct 950 ms 7760 KB Output is correct
65 Correct 794 ms 4088 KB Output is correct
66 Correct 758 ms 3920 KB Output is correct
67 Correct 1027 ms 6376 KB Output is correct
68 Correct 1016 ms 5832 KB Output is correct
69 Correct 1694 ms 6184 KB Output is correct
70 Correct 1670 ms 6200 KB Output is correct
71 Correct 1666 ms 6192 KB Output is correct
72 Correct 1658 ms 6300 KB Output is correct
73 Correct 911 ms 4384 KB Output is correct
74 Correct 1053 ms 5728 KB Output is correct
75 Correct 874 ms 8148 KB Output is correct
76 Correct 902 ms 7772 KB Output is correct
77 Correct 181 ms 2936 KB Output is correct
78 Correct 172 ms 2908 KB Output is correct
79 Correct 189 ms 3000 KB Output is correct
80 Correct 181 ms 2936 KB Output is correct
81 Correct 1031 ms 5476 KB Output is correct
82 Correct 917 ms 4400 KB Output is correct
83 Correct 819 ms 3960 KB Output is correct
84 Correct 1022 ms 5600 KB Output is correct
85 Correct 1014 ms 6280 KB Output is correct
86 Correct 1031 ms 6784 KB Output is correct
87 Correct 934 ms 5240 KB Output is correct
88 Correct 706 ms 3972 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 11 ms 504 KB Output is correct
4 Correct 10 ms 508 KB Output is correct
5 Correct 21 ms 888 KB Output is correct
6 Correct 29 ms 744 KB Output is correct
7 Correct 16 ms 632 KB Output is correct
8 Correct 18 ms 760 KB Output is correct
9 Correct 15 ms 760 KB Output is correct
10 Correct 9 ms 892 KB Output is correct
11 Correct 39 ms 788 KB Output is correct
12 Correct 38 ms 888 KB Output is correct
13 Correct 10 ms 888 KB Output is correct
14 Correct 19 ms 696 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 10 ms 632 KB Output is correct
17 Correct 20 ms 632 KB Output is correct
18 Correct 13 ms 888 KB Output is correct
19 Correct 18 ms 700 KB Output is correct
20 Correct 19 ms 728 KB Output is correct
21 Correct 1664 ms 6108 KB Output is correct
22 Correct 1669 ms 6224 KB Output is correct
23 Correct 1664 ms 6252 KB Output is correct
24 Correct 1647 ms 6436 KB Output is correct
25 Correct 983 ms 7604 KB Output is correct
26 Correct 914 ms 7832 KB Output is correct
27 Correct 1660 ms 6380 KB Output is correct
28 Correct 1665 ms 6244 KB Output is correct
29 Correct 1653 ms 6184 KB Output is correct
30 Correct 1871 ms 5004 KB Output is correct
31 Correct 1754 ms 5272 KB Output is correct
32 Correct 1467 ms 7192 KB Output is correct
33 Correct 200 ms 2856 KB Output is correct
34 Correct 171 ms 2752 KB Output is correct
35 Correct 252 ms 2824 KB Output is correct
36 Correct 176 ms 2780 KB Output is correct
37 Correct 1431 ms 6708 KB Output is correct
38 Correct 1559 ms 6320 KB Output is correct
39 Correct 1517 ms 6636 KB Output is correct
40 Correct 972 ms 7636 KB Output is correct
41 Correct 947 ms 7808 KB Output is correct
42 Correct 1049 ms 6436 KB Output is correct
43 Correct 633 ms 3116 KB Output is correct
44 Correct 1058 ms 6692 KB Output is correct
45 Correct 994 ms 5996 KB Output is correct
46 Correct 908 ms 4736 KB Output is correct
47 Correct 856 ms 4328 KB Output is correct
48 Correct 752 ms 4000 KB Output is correct
49 Correct 1660 ms 5860 KB Output is correct
50 Correct 1677 ms 5620 KB Output is correct
51 Correct 1664 ms 5832 KB Output is correct
52 Correct 1661 ms 5964 KB Output is correct
53 Correct 699 ms 3360 KB Output is correct
54 Correct 1033 ms 5088 KB Output is correct
55 Correct 1028 ms 5672 KB Output is correct
56 Correct 1071 ms 5264 KB Output is correct
57 Correct 206 ms 2808 KB Output is correct
58 Correct 178 ms 2808 KB Output is correct
59 Correct 216 ms 2792 KB Output is correct
60 Correct 182 ms 2812 KB Output is correct
61 Correct 1047 ms 5884 KB Output is correct
62 Correct 1045 ms 5808 KB Output is correct
63 Correct 913 ms 7740 KB Output is correct
64 Correct 1027 ms 6604 KB Output is correct
65 Correct 997 ms 6192 KB Output is correct
66 Correct 818 ms 4276 KB Output is correct
67 Correct 988 ms 5404 KB Output is correct
68 Correct 1016 ms 6368 KB Output is correct
69 Correct 169 ms 3108 KB Output is correct
70 Correct 172 ms 3000 KB Output is correct
71 Correct 174 ms 3052 KB Output is correct
72 Correct 184 ms 3064 KB Output is correct
73 Correct 1308 ms 7304 KB Output is correct
74 Correct 1692 ms 4884 KB Output is correct
75 Correct 1229 ms 7248 KB Output is correct
76 Correct 1856 ms 4948 KB Output is correct
77 Correct 1006 ms 5088 KB Output is correct
78 Correct 1047 ms 6964 KB Output is correct
79 Correct 840 ms 3932 KB Output is correct
80 Correct 898 ms 7976 KB Output is correct
81 Correct 1172 ms 6284 KB Output is correct
82 Correct 907 ms 4712 KB Output is correct
83 Correct 925 ms 7516 KB Output is correct
84 Correct 1016 ms 6496 KB Output is correct
85 Correct 1662 ms 6240 KB Output is correct
86 Correct 1666 ms 6176 KB Output is correct
87 Correct 1659 ms 6176 KB Output is correct
88 Correct 1668 ms 6232 KB Output is correct
89 Correct 186 ms 2940 KB Output is correct
90 Correct 189 ms 3020 KB Output is correct
91 Correct 173 ms 3064 KB Output is correct
92 Correct 174 ms 2912 KB Output is correct
93 Correct 1754 ms 5300 KB Output is correct
94 Correct 1581 ms 4704 KB Output is correct
95 Correct 1598 ms 6472 KB Output is correct
96 Correct 1701 ms 4616 KB Output is correct
97 Correct 1041 ms 6220 KB Output is correct
98 Correct 1002 ms 7636 KB Output is correct
99 Correct 923 ms 7916 KB Output is correct
100 Correct 950 ms 7760 KB Output is correct
101 Correct 794 ms 4088 KB Output is correct
102 Correct 758 ms 3920 KB Output is correct
103 Correct 1027 ms 6376 KB Output is correct
104 Correct 1016 ms 5832 KB Output is correct
105 Correct 1694 ms 6184 KB Output is correct
106 Correct 1670 ms 6200 KB Output is correct
107 Correct 1666 ms 6192 KB Output is correct
108 Correct 1658 ms 6300 KB Output is correct
109 Correct 911 ms 4384 KB Output is correct
110 Correct 1053 ms 5728 KB Output is correct
111 Correct 874 ms 8148 KB Output is correct
112 Correct 902 ms 7772 KB Output is correct
113 Correct 181 ms 2936 KB Output is correct
114 Correct 172 ms 2908 KB Output is correct
115 Correct 189 ms 3000 KB Output is correct
116 Correct 181 ms 2936 KB Output is correct
117 Correct 1031 ms 5476 KB Output is correct
118 Correct 917 ms 4400 KB Output is correct
119 Correct 819 ms 3960 KB Output is correct
120 Correct 1022 ms 5600 KB Output is correct
121 Correct 1014 ms 6280 KB Output is correct
122 Correct 1031 ms 6784 KB Output is correct
123 Correct 934 ms 5240 KB Output is correct
124 Correct 706 ms 3972 KB Output is correct
125 Correct 374 ms 5520 KB Output is correct
126 Correct 417 ms 5720 KB Output is correct
127 Correct 462 ms 5724 KB Output is correct
128 Correct 402 ms 5736 KB Output is correct
129 Correct 357 ms 5624 KB Output is correct
130 Correct 415 ms 5612 KB Output is correct
131 Correct 3857 ms 8788 KB Output is correct
132 Correct 4912 ms 11240 KB Output is correct
133 Correct 4797 ms 12424 KB Output is correct
134 Correct 4398 ms 9096 KB Output is correct
135 Correct 4631 ms 13872 KB Output is correct
136 Correct 2764 ms 7912 KB Output is correct
137 Correct 3591 ms 15236 KB Output is correct
138 Correct 3508 ms 11028 KB Output is correct
139 Correct 3662 ms 13664 KB Output is correct
140 Correct 3641 ms 14780 KB Output is correct
141 Correct 3632 ms 11856 KB Output is correct
142 Correct 1678 ms 6520 KB Output is correct
143 Correct 2279 ms 7748 KB Output is correct
144 Correct 1204 ms 6008 KB Output is correct
145 Correct 3634 ms 14612 KB Output is correct
146 Correct 2929 ms 9552 KB Output is correct
147 Correct 2324 ms 7960 KB Output is correct
148 Correct 2296 ms 7904 KB Output is correct
149 Correct 4952 ms 11652 KB Output is correct
150 Correct 4930 ms 11656 KB Output is correct
151 Correct 4946 ms 11684 KB Output is correct
152 Correct 4978 ms 11568 KB Output is correct
153 Correct 4997 ms 11556 KB Output is correct
154 Correct 4972 ms 11544 KB Output is correct
155 Correct 2017 ms 7064 KB Output is correct
156 Correct 2517 ms 8148 KB Output is correct
157 Correct 3631 ms 14692 KB Output is correct
158 Correct 3606 ms 15172 KB Output is correct
159 Correct 3554 ms 11492 KB Output is correct
160 Correct 3066 ms 9760 KB Output is correct
161 Correct 443 ms 5824 KB Output is correct
162 Correct 421 ms 5832 KB Output is correct
163 Correct 419 ms 5736 KB Output is correct
164 Correct 696 ms 5880 KB Output is correct
165 Correct 458 ms 5624 KB Output is correct
166 Correct 405 ms 5804 KB Output is correct
167 Correct 3535 ms 15432 KB Output is correct
168 Correct 3529 ms 15632 KB Output is correct
169 Correct 3623 ms 14616 KB Output is correct
170 Correct 3649 ms 14396 KB Output is correct
171 Correct 3594 ms 11796 KB Output is correct
172 Correct 2873 ms 8928 KB Output is correct
173 Correct 3609 ms 14828 KB Output is correct
174 Correct 2873 ms 9016 KB Output is correct
175 Correct 3749 ms 13196 KB Output is correct
176 Correct 2263 ms 7820 KB Output is correct
177 Correct 3511 ms 11332 KB Output is correct
178 Correct 3407 ms 11068 KB Output is correct