oj.uz

Submission #973254

# Submission time Handle Problem Language Result Execution time Memory
973254 2024-05-01T16:50:05 Z underwaterkillerwhale Event Hopping 2 (JOI21_event2) C++17
100 / 100
 1094 ms 86988 KB 
#include <bits/stdc++.h>
#define se              second
#define fs              first
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N = 5e5 + 7;
const ll Mod = 1e9 + 7;
const int szBL = 916;
const int INF = 2e9 + 7;
const int BASE = 137;

struct Segment_Tree {
    int Range;
    ll st[N << 2], lz[N << 2];

    void init (int n) {
        Range = n;
        rep (i, 0, n << 2) st[i] = 0, lz[i] = 0;
    }
    void down (int id, int l, int r) {
        int mid = l + r >> 1;
        st[id << 1] += lz[id] * (mid - l + 1);
        lz[id << 1] += lz[id];

        st[id << 1 | 1] += lz[id] * (r - mid);
        lz[id << 1 | 1] += lz[id];

        lz[id] = 0;
    }
    void update (int id, int l, int r, int u, int v, int val) {
        if (l > v || r < u) return;
        if (l >= u && r <= v) {
            st[id] += val * (r - l + 1);
            lz[id] += val;
            return;
        }
        int mid = l + r >> 1;
        down (id, l, r);
        update (id << 1, l, mid, u, v, val);
        update (id << 1 | 1, mid + 1, r, u, v, val);
        st[id] = st[id << 1] + st[id << 1 | 1];
    }
    void Assign (int id, int l, int r, int pos, int val) {
        if (l > pos || r < pos) return;
        if (l == r) {
            st[id] = val;
            return;
        }
        int mid = l + r >> 1;
        down (id, l, r);
        Assign (id << 1, l, mid, pos, val);
        Assign (id << 1 | 1, mid + 1, r, pos, val);
        st[id] = st[id << 1] + st[id << 1 | 1];
    }
    ll get (int id, int l, int r, int u, int v) {
        if (l > v || r < u) return 0;
        if (l >= u && r <= v) return st[id];
        int mid = l + r >> 1;
        down (id, l, r);
        return get (id << 1, l, mid, u, v) + get (id << 1 | 1, mid + 1, r, u, v);
    }

    void update (int u, int v, int val) {
        update (1, 1, Range, u, v, val);
    }
    void Assign (int pos, int val) {
        Assign (1, 1,  Range, pos, val);
    }
    ll get (int u, int v) {
        return get (1, 1, Range, u, v);
    }
}pre, suf, Fixed;

struct Segment_Tree1 {
    int Range;
    ll st[N << 2];

    void init (int n) {
        Range = n;
    }
    void Assign (int id, int l, int r, int pos, int val) {
        if (l > pos || r < pos) return;
        if (l == r) {
            st[id] = val;
            return;
        }
        int mid = l + r >> 1;
        Assign (id << 1, l, mid, pos, val);
        Assign (id << 1 | 1, mid + 1, r, pos, val);
        st[id] = max(st[id << 1], st[id << 1 | 1]);
    }
    ll get (int id, int l, int r, int u, int v) {
        if (l > v || r < u) return 0;
        if (l >= u && r <= v) return st[id];
        int mid = l + r >> 1;
        return max(get (id << 1, l, mid, u, v), get (id << 1 | 1, mid + 1, r, u, v));
    }

    void Assign (int pos, int val) {
        Assign (1, 1,  Range, pos, val);
    }
    ll get (int u, int v) {
        return get (1, 1, Range, u, v);
    }
}mx;

int n, K;
pair<int,int> a[N];
int spt[N][25];

vector<int> rar;
int numVal;
int mnsuf[N];

void compress () {
    rep (i, 1, n) rar.push_back(a[i].fs), rar.push_back(a[i].se);
    sort (ALL(rar));
    rar.resize(numVal = unique(ALL(rar)) - rar.begin());
    rep (i, 1, n)
        a[i].fs = lower_bound(ALL(rar), a[i].fs) - rar.begin() + 1,
        a[i].se = lower_bound(ALL(rar), a[i].se) - rar.begin() + 1;
}

void solution() {
    cin >> n >> K;
    rep (i, 1, n) {
        cin >> a[i].fs >> a[i].se;
    }
    compress();
    rep (i, 0, numVal + 2) mnsuf[i] = numVal + 2;
    rep (i, 1, n)
        mnsuf[a[i].fs] = min (mnsuf[a[i].fs], a[i].se);
    reb (i, numVal, 0)
        mnsuf[i] = min (mnsuf[i + 1], mnsuf[i]);
    rep (i, 0, numVal + 2) {
        spt[i][0] = mnsuf[i];
//        cout << spt[i][0] <<" ";
    }
//    cout <<"\n";
    rep (j, 1, 20)
    rep (i, 0, numVal + 2) spt[i][j] = spt[spt[i][j - 1]][j - 1];
//    rep (i, 0, 20) cout << spt[5][i] <<" "<<spt[17][1] <<"\n";
    pre.init(numVal);
    suf.init(numVal);
    Fixed.init(numVal);
    mx.init(numVal);
    vector<int> Ans;
    function<int(int L, int R)> numIT = [] (int L, int R) {
        int start = L, res = 0;
        reb (i, 20, 0) {
            if (spt[start][i] <= R) {
//                cout << start <<" "<<i<<" "<<spt[start][i]<<" "<<R <<"\n";
                start = spt[start][i];
                res += (1 << i);
            }
        }
        return res;
    };
//    cout << numIT (5, 19) <<"\n";
//    return;
    function<bool(int i)> check = [&] (int i) {
        iter (&id, Ans) {
            if (a[id].fs <= a[i].fs && a[id].se > a[i].fs)
                return 0;
        }
        return 1;
    };
    rep (i, 1, n) {
        if (SZ(Ans) == K) break;
        int L = a[i].fs, R = a[i].se;
        if (mx.get(1, L) > L || Fixed.get(L + 1, R - 1))  {
//            cout << i <<" hihi\n";
            continue;
        }
        function<int()> val_Left = [&] () {
            if (Fixed.get (1, L) == 0) return 0;
            int lf = 1, rt = L;
            while (lf < rt) {
                int mid = lf + rt + 1 >> 1;
                if (Fixed.get (mid, L) >= 1) lf = mid;
                else rt = mid - 1;
            }
            return lf;
        };
        function<int()> val_Right = [&] () {
            if (Fixed.get (R, numVal) == 0) return numVal + 1;
            int lf = R, rt = numVal;
            while (lf < rt) {
                int mid = lf + rt >> 1;
                if (Fixed.get (R, mid) >= 1) rt = mid;
                else lf = mid + 1;
            }
            return rt;
        };
        int Left = val_Left(), Right = val_Right();
        int valLR = numIT (Left, Right),
            nvalLR = 1 + numIT(Left, L) + numIT(R, Right);
//        cout << i<<":"<<Left <<" "<<Right<<"\n";
        if (pre.get(Left, Left) + suf.get(Right, Right) + nvalLR >= K) {
//            cout << i <<": "<<pre.get(Left, Left) <<" "<<suf.get(Right, Right) <<" "<<nvalLR<<"\n";
            Fixed.update (L, R, 1);
            mx.Assign (L, R);
            suf.update (1, Left, -valLR + nvalLR);
            pre.update (Right, numVal, -valLR + nvalLR);
            pre.Assign (R, pre.get(Left, Left) + numIT(Left, L) + 1);
            suf.Assign (L, suf.get(Right, Right) + numIT(R, Right) + 1);
            Ans.push_back(i);
        }
    }
    if (SZ(Ans) < K) cout << -1 <<"\n";
    else {
        iter (&id, Ans) cout << id <<"\n";
    }

}


#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);

int main () {
//    file("c");
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll num_Test = 1;
//    cin >> num_Test;
    while(num_Test--)
        solution();
}
/*
18 3
2 5
6 21
13 19
9 17
14 17
19 20
2 16
2 10
9 14
19 20
14 16
1 3
17 19
14 21
18 19
4 7
5 12
1 13

*/

Compilation message

event2.cpp: In member function 'void Segment_Tree::down(int, int, int)':
event2.cpp:35:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |         int mid = l + r >> 1;
      |                   ~~^~~
event2.cpp: In member function 'void Segment_Tree::update(int, int, int, int, int, int)':
event2.cpp:51:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |         int mid = l + r >> 1;
      |                   ~~^~~
event2.cpp: In member function 'void Segment_Tree::Assign(int, int, int, int, int)':
event2.cpp:63:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   63 |         int mid = l + r >> 1;
      |                   ~~^~~
event2.cpp: In member function 'long long int Segment_Tree::get(int, int, int, int, int)':
event2.cpp:72:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |         int mid = l + r >> 1;
      |                   ~~^~~
event2.cpp: In member function 'void Segment_Tree1::Assign(int, int, int, int, int)':
event2.cpp:101:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  101 |         int mid = l + r >> 1;
      |                   ~~^~~
event2.cpp: In member function 'long long int Segment_Tree1::get(int, int, int, int, int)':
event2.cpp:109:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  109 |         int mid = l + r >> 1;
      |                   ~~^~~
event2.cpp: In lambda function:
event2.cpp:193:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  193 |                 int mid = lf + rt + 1 >> 1;
      |                           ~~~~~~~~^~~
event2.cpp: In lambda function:
event2.cpp:203:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  203 |                 int mid = lf + rt >> 1;
      |                           ~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18776 KB Output is correct
2 Correct 3 ms 18776 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 481 ms 84684 KB Output is correct
5 Correct 559 ms 86560 KB Output is correct
6 Correct 521 ms 86524 KB Output is correct
7 Correct 389 ms 86328 KB Output is correct
8 Correct 498 ms 86988 KB Output is correct
9 Correct 459 ms 86696 KB Output is correct
10 Correct 497 ms 85544 KB Output is correct
11 Correct 437 ms 85136 KB Output is correct
12 Correct 385 ms 86068 KB Output is correct
13 Correct 334 ms 86344 KB Output is correct
14 Correct 328 ms 85948 KB Output is correct
15 Correct 282 ms 84432 KB Output is correct
16 Correct 164 ms 84672 KB Output is correct
17 Correct 132 ms 84692 KB Output is correct
18 Correct 135 ms 84416 KB Output is correct
19 Correct 108 ms 84728 KB Output is correct
20 Correct 88 ms 84676 KB Output is correct
21 Correct 83 ms 84432 KB Output is correct
22 Correct 82 ms 82888 KB Output is correct
23 Correct 94 ms 82788 KB Output is correct
24 Correct 75 ms 82636 KB Output is correct
25 Correct 79 ms 81616 KB Output is correct
26 Correct 79 ms 81608 KB Output is correct
27 Correct 75 ms 81352 KB Output is correct
28 Correct 149 ms 81668 KB Output is correct
29 Correct 132 ms 81356 KB Output is correct
30 Correct 128 ms 81364 KB Output is correct
31 Correct 134 ms 81348 KB Output is correct
32 Correct 141 ms 81416 KB Output is correct
33 Correct 149 ms 81620 KB Output is correct
34 Correct 245 ms 85196 KB Output is correct
35 Correct 201 ms 82880 KB Output is correct
36 Correct 112 ms 82112 KB Output is correct
37 Correct 299 ms 85184 KB Output is correct
38 Correct 290 ms 85168 KB Output is correct
39 Correct 276 ms 84944 KB Output is correct
40 Correct 270 ms 84864 KB Output is correct
41 Correct 270 ms 84684 KB Output is correct
42 Correct 136 ms 81376 KB Output is correct
43 Correct 306 ms 85960 KB Output is correct
44 Correct 297 ms 84980 KB Output is correct
45 Correct 289 ms 85092 KB Output is correct
46 Correct 280 ms 85528 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18780 KB Output is correct
2 Correct 2 ms 18780 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 3 ms 18780 KB Output is correct
5 Correct 3 ms 18780 KB Output is correct
6 Correct 2 ms 18780 KB Output is correct
7 Correct 3 ms 18780 KB Output is correct
8 Correct 3 ms 18780 KB Output is correct
9 Correct 2 ms 18912 KB Output is correct
10 Correct 2 ms 18976 KB Output is correct
11 Correct 3 ms 18780 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 3 ms 18780 KB Output is correct
14 Correct 2 ms 18780 KB Output is correct
15 Correct 2 ms 18780 KB Output is correct
16 Correct 2 ms 18780 KB Output is correct
17 Correct 2 ms 18780 KB Output is correct
18 Correct 3 ms 18780 KB Output is correct
19 Correct 2 ms 18780 KB Output is correct
20 Correct 2 ms 18780 KB Output is correct
21 Correct 2 ms 18812 KB Output is correct
22 Correct 2 ms 18780 KB Output is correct
23 Correct 2 ms 18776 KB Output is correct
24 Correct 3 ms 18780 KB Output is correct
25 Correct 2 ms 18780 KB Output is correct
26 Correct 2 ms 18780 KB Output is correct
27 Correct 2 ms 18780 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18780 KB Output is correct
2 Correct 2 ms 18780 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 3 ms 18780 KB Output is correct
5 Correct 3 ms 18780 KB Output is correct
6 Correct 2 ms 18780 KB Output is correct
7 Correct 3 ms 18780 KB Output is correct
8 Correct 3 ms 18780 KB Output is correct
9 Correct 2 ms 18912 KB Output is correct
10 Correct 2 ms 18976 KB Output is correct
11 Correct 3 ms 18780 KB Output is correct
12 Correct 2 ms 18780 KB Output is correct
13 Correct 3 ms 18780 KB Output is correct
14 Correct 2 ms 18780 KB Output is correct
15 Correct 2 ms 18780 KB Output is correct
16 Correct 2 ms 18780 KB Output is correct
17 Correct 2 ms 18780 KB Output is correct
18 Correct 3 ms 18780 KB Output is correct
19 Correct 2 ms 18780 KB Output is correct
20 Correct 2 ms 18780 KB Output is correct
21 Correct 2 ms 18812 KB Output is correct
22 Correct 2 ms 18780 KB Output is correct
23 Correct 2 ms 18776 KB Output is correct
24 Correct 3 ms 18780 KB Output is correct
25 Correct 2 ms 18780 KB Output is correct
26 Correct 2 ms 18780 KB Output is correct
27 Correct 2 ms 18780 KB Output is correct
28 Correct 6 ms 20828 KB Output is correct
29 Correct 6 ms 20824 KB Output is correct
30 Correct 5 ms 21052 KB Output is correct
31 Correct 4 ms 21076 KB Output is correct
32 Correct 4 ms 20828 KB Output is correct
33 Correct 6 ms 20828 KB Output is correct
34 Correct 7 ms 20828 KB Output is correct
35 Correct 20 ms 21072 KB Output is correct
36 Correct 18 ms 21084 KB Output is correct
37 Correct 14 ms 21084 KB Output is correct
38 Correct 6 ms 20828 KB Output is correct
39 Correct 17 ms 21068 KB Output is correct
40 Correct 16 ms 21084 KB Output is correct
41 Correct 15 ms 21084 KB Output is correct
42 Correct 6 ms 20828 KB Output is correct
43 Correct 10 ms 21072 KB Output is correct
44 Correct 9 ms 20828 KB Output is correct
45 Correct 8 ms 20828 KB Output is correct
46 Correct 7 ms 20824 KB Output is correct
47 Correct 8 ms 20828 KB Output is correct
48 Correct 6 ms 20828 KB Output is correct
49 Correct 5 ms 20828 KB Output is correct
50 Correct 6 ms 20828 KB Output is correct
51 Correct 7 ms 21056 KB Output is correct
52 Correct 6 ms 21048 KB Output is correct
53 Correct 5 ms 20828 KB Output is correct
54 Correct 6 ms 20828 KB Output is correct
55 Correct 11 ms 20828 KB Output is correct
56 Correct 11 ms 20828 KB Output is correct
57 Correct 11 ms 20828 KB Output is correct
58 Correct 12 ms 20828 KB Output is correct
59 Correct 10 ms 20828 KB Output is correct
60 Correct 10 ms 20828 KB Output is correct
61 Correct 12 ms 20828 KB Output is correct
62 Correct 10 ms 20828 KB Output is correct
63 Correct 9 ms 20828 KB Output is correct
64 Correct 5 ms 20828 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18776 KB Output is correct
2 Correct 3 ms 18776 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 481 ms 84684 KB Output is correct
5 Correct 559 ms 86560 KB Output is correct
6 Correct 521 ms 86524 KB Output is correct
7 Correct 389 ms 86328 KB Output is correct
8 Correct 498 ms 86988 KB Output is correct
9 Correct 459 ms 86696 KB Output is correct
10 Correct 497 ms 85544 KB Output is correct
11 Correct 437 ms 85136 KB Output is correct
12 Correct 385 ms 86068 KB Output is correct
13 Correct 334 ms 86344 KB Output is correct
14 Correct 328 ms 85948 KB Output is correct
15 Correct 282 ms 84432 KB Output is correct
16 Correct 164 ms 84672 KB Output is correct
17 Correct 132 ms 84692 KB Output is correct
18 Correct 135 ms 84416 KB Output is correct
19 Correct 108 ms 84728 KB Output is correct
20 Correct 88 ms 84676 KB Output is correct
21 Correct 83 ms 84432 KB Output is correct
22 Correct 82 ms 82888 KB Output is correct
23 Correct 94 ms 82788 KB Output is correct
24 Correct 75 ms 82636 KB Output is correct
25 Correct 79 ms 81616 KB Output is correct
26 Correct 79 ms 81608 KB Output is correct
27 Correct 75 ms 81352 KB Output is correct
28 Correct 149 ms 81668 KB Output is correct
29 Correct 132 ms 81356 KB Output is correct
30 Correct 128 ms 81364 KB Output is correct
31 Correct 134 ms 81348 KB Output is correct
32 Correct 141 ms 81416 KB Output is correct
33 Correct 149 ms 81620 KB Output is correct
34 Correct 245 ms 85196 KB Output is correct
35 Correct 201 ms 82880 KB Output is correct
36 Correct 112 ms 82112 KB Output is correct
37 Correct 299 ms 85184 KB Output is correct
38 Correct 290 ms 85168 KB Output is correct
39 Correct 276 ms 84944 KB Output is correct
40 Correct 270 ms 84864 KB Output is correct
41 Correct 270 ms 84684 KB Output is correct
42 Correct 136 ms 81376 KB Output is correct
43 Correct 306 ms 85960 KB Output is correct
44 Correct 297 ms 84980 KB Output is correct
45 Correct 289 ms 85092 KB Output is correct
46 Correct 280 ms 85528 KB Output is correct
47 Correct 2 ms 18780 KB Output is correct
48 Correct 2 ms 18780 KB Output is correct
49 Correct 2 ms 18780 KB Output is correct
50 Correct 3 ms 18780 KB Output is correct
51 Correct 3 ms 18780 KB Output is correct
52 Correct 2 ms 18780 KB Output is correct
53 Correct 3 ms 18780 KB Output is correct
54 Correct 3 ms 18780 KB Output is correct
55 Correct 2 ms 18912 KB Output is correct
56 Correct 2 ms 18976 KB Output is correct
57 Correct 3 ms 18780 KB Output is correct
58 Correct 2 ms 18780 KB Output is correct
59 Correct 3 ms 18780 KB Output is correct
60 Correct 2 ms 18780 KB Output is correct
61 Correct 2 ms 18780 KB Output is correct
62 Correct 2 ms 18780 KB Output is correct
63 Correct 2 ms 18780 KB Output is correct
64 Correct 3 ms 18780 KB Output is correct
65 Correct 2 ms 18780 KB Output is correct
66 Correct 2 ms 18780 KB Output is correct
67 Correct 2 ms 18812 KB Output is correct
68 Correct 2 ms 18780 KB Output is correct
69 Correct 2 ms 18776 KB Output is correct
70 Correct 3 ms 18780 KB Output is correct
71 Correct 2 ms 18780 KB Output is correct
72 Correct 2 ms 18780 KB Output is correct
73 Correct 2 ms 18780 KB Output is correct
74 Correct 6 ms 20828 KB Output is correct
75 Correct 6 ms 20824 KB Output is correct
76 Correct 5 ms 21052 KB Output is correct
77 Correct 4 ms 21076 KB Output is correct
78 Correct 4 ms 20828 KB Output is correct
79 Correct 6 ms 20828 KB Output is correct
80 Correct 7 ms 20828 KB Output is correct
81 Correct 20 ms 21072 KB Output is correct
82 Correct 18 ms 21084 KB Output is correct
83 Correct 14 ms 21084 KB Output is correct
84 Correct 6 ms 20828 KB Output is correct
85 Correct 17 ms 21068 KB Output is correct
86 Correct 16 ms 21084 KB Output is correct
87 Correct 15 ms 21084 KB Output is correct
88 Correct 6 ms 20828 KB Output is correct
89 Correct 10 ms 21072 KB Output is correct
90 Correct 9 ms 20828 KB Output is correct
91 Correct 8 ms 20828 KB Output is correct
92 Correct 7 ms 20824 KB Output is correct
93 Correct 8 ms 20828 KB Output is correct
94 Correct 6 ms 20828 KB Output is correct
95 Correct 5 ms 20828 KB Output is correct
96 Correct 6 ms 20828 KB Output is correct
97 Correct 7 ms 21056 KB Output is correct
98 Correct 6 ms 21048 KB Output is correct
99 Correct 5 ms 20828 KB Output is correct
100 Correct 6 ms 20828 KB Output is correct
101 Correct 11 ms 20828 KB Output is correct
102 Correct 11 ms 20828 KB Output is correct
103 Correct 11 ms 20828 KB Output is correct
104 Correct 12 ms 20828 KB Output is correct
105 Correct 10 ms 20828 KB Output is correct
106 Correct 10 ms 20828 KB Output is correct
107 Correct 12 ms 20828 KB Output is correct
108 Correct 10 ms 20828 KB Output is correct
109 Correct 9 ms 20828 KB Output is correct
110 Correct 5 ms 20828 KB Output is correct
111 Correct 139 ms 83456 KB Output is correct
112 Correct 128 ms 83264 KB Output is correct
113 Correct 122 ms 84600 KB Output is correct
114 Correct 104 ms 82124 KB Output is correct
115 Correct 106 ms 83388 KB Output is correct
116 Correct 211 ms 81352 KB Output is correct
117 Correct 193 ms 81356 KB Output is correct
118 Correct 1094 ms 86220 KB Output is correct
119 Correct 1064 ms 85904 KB Output is correct
120 Correct 580 ms 85332 KB Output is correct
121 Correct 239 ms 81408 KB Output is correct
122 Correct 745 ms 86096 KB Output is correct
123 Correct 636 ms 85180 KB Output is correct
124 Correct 589 ms 85688 KB Output is correct
125 Correct 227 ms 81400 KB Output is correct
126 Correct 355 ms 84756 KB Output is correct
127 Correct 288 ms 84784 KB Output is correct
128 Correct 233 ms 85544 KB Output is correct
129 Correct 203 ms 81352 KB Output is correct
130 Correct 269 ms 84576 KB Output is correct
131 Correct 214 ms 85516 KB Output is correct
132 Correct 147 ms 85544 KB Output is correct
133 Correct 203 ms 81352 KB Output is correct
134 Correct 277 ms 82892 KB Output is correct
135 Correct 176 ms 84424 KB Output is correct
136 Correct 115 ms 84424 KB Output is correct
137 Correct 191 ms 81408 KB Output is correct
138 Correct 141 ms 81384 KB Output is correct
139 Correct 127 ms 81484 KB Output is correct
140 Correct 88 ms 83452 KB Output is correct
141 Correct 204 ms 81352 KB Output is correct
142 Correct 481 ms 55160 KB Output is correct
143 Correct 449 ms 55244 KB Output is correct
144 Correct 444 ms 55244 KB Output is correct
145 Correct 463 ms 55220 KB Output is correct
146 Correct 424 ms 55252 KB Output is correct
147 Correct 432 ms 55224 KB Output is correct
148 Correct 451 ms 55416 KB Output is correct
149 Correct 424 ms 54992 KB Output is correct
150 Correct 427 ms 54872 KB Output is correct
151 Correct 363 ms 54736 KB Output is correct
152 Correct 104 ms 52672 KB Output is correct
153 Correct 445 ms 55224 KB Output is correct
154 Correct 456 ms 55152 KB Output is correct
155 Correct 450 ms 55248 KB Output is correct
156 Correct 407 ms 55068 KB Output is correct
157 Correct 393 ms 55320 KB Output is correct
158 Correct 386 ms 54992 KB Output is correct
159 Correct 346 ms 54928 KB Output is correct
160 Correct 107 ms 52688 KB Output is correct
161 Correct 609 ms 73168 KB Output is correct
162 Correct 552 ms 73016 KB Output is correct
163 Correct 589 ms 73600 KB Output is correct
164 Correct 514 ms 72936 KB Output is correct
165 Correct 497 ms 72772 KB Output is correct
166 Correct 144 ms 81460 KB Output is correct
167 Correct 324 ms 86044 KB Output is correct
168 Correct 296 ms 85404 KB Output is correct
169 Correct 291 ms 84924 KB Output is correct
170 Correct 272 ms 84776 KB Output is correct
171 Correct 313 ms 84636 KB Output is correct
172 Correct 297 ms 85324 KB Output is correct
173 Correct 649 ms 55280 KB Output is correct
174 Correct 638 ms 54604 KB Output is correct
175 Correct 631 ms 55580 KB Output is correct
176 Correct 410 ms 55224 KB Output is correct