oj.uz

Submission #893810

# Submission time Handle Problem Language Result Execution time Memory
893810 2023-12-27T13:20:50 Z danikoynov Event Hopping 2 (JOI21_event2) C++14
100 / 100
 248 ms 20424 KB 
/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 1e5 + 10;

struct interval
{
    int l, r;
};

int n, k;
interval seg[maxn];
void input()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i ++)
        cin >> seg[i].l >> seg[i].r;
}


bool cmp(interval it1, interval it2)
{
    if (it1.l != it2.l)
        return it1.l < it2.l;
    return it1.r > it2.r;
}

interval rel[maxn];
int m;
void get_relevant()
{
    vector < interval > vec;
    for (int i = 1; i <= n; i ++)
        vec.push_back(seg[i]);

    sort(vec.begin(), vec.end(), cmp);
    int cl = 1e9 + 10;
    for (int i = n - 1; i >= 0; i --)
    {
        if (vec[i].r >= cl)
        {
            continue;
        }
        rel[++ m] = vec[i];
        cl = vec[i].r;
    }

    reverse(rel + 1, rel + m + 1);
}

int len[2][maxn], pt[2][maxn], used[maxn];

void calc_pointers()
{
    int last = 0;
    rel[m + 1].l = 1e9 + 10;
    for (int i = 1; i <= m; i ++)
    {
        if (used[i])
            continue;
        len[0][i] = 0;
        pt[0][i] = 0;
        if (last != 0)
            pt[0][i] = pt[0][last];
        while(rel[pt[0][i]].r <= rel[i].l)
            pt[0][i] ++;
        pt[0][i] --;
        while(pt[0][i] > 0 && used[pt[0][i]])
            pt[0][i] --;

        len[0][i] = len[0][pt[0][i]] + 1;
        last = i;
    }

    last = m + 1;
    for (int i = m; i > 0; i --)
    {
        if (used[i])
            continue;
        len[1][i] = 0;
        pt[1][i] = m + 1;
        if (last != m + 1)
            pt[1][i] = pt[1][last];
        while(rel[pt[1][i]].l >= rel[i].r)
            pt[1][i] --;
        pt[1][i] ++;
        while(pt[1][i] <= m && used[pt[1][i]])
            pt[1][i] ++;
        len[1][i] = len[1][pt[1][i]] + 1;
        ///cout << "line 107 " << i << " " << pt[1][i] << endl;
        last = i;
    }
}

bool intersect(interval a, interval b)
{
    if (a.l == b.l)
        return true;
    if (a.l > b.l)
        swap(a, b);
    if (a.r >= b.r)
        return true;
    return a.r > b.l;
}

void get_intersections(interval cur)
{
    for (int i = 1; i <= m; i ++)
        if (used[i] == 0 && intersect(rel[i], cur))
            used[i] = 2;

}
set < pair < int, int > > act;
const int maxlog = 21;

int dp[maxlog][maxn];

int fen[2][maxn];

void add(int r, int p, int v)
{
    ///cout << v << endl;
    for (int i = p; i <= m; i += (i & -i))
        fen[r][i] += v;
}

int sum(int r, int p)
{
    int s = 0;
    for (int i = p; i > 0; i -= (i & -i))
        s += fen[r][i];
    return s;
}


int get_length(int pos, int to)
{
    int jump = 0;
    for (int bit = maxlog - 1; bit >= 0; bit --)
    {
        //cout << "get length " << pos << " " << jump << " " << m << endl;
        if (dp[bit][pos] <= to)
        {
            jump += (1 << bit);
            pos = dp[bit][pos];
        }
    }
    return jump + 1;
}

int get_pos(int r, int pos)
{
    return sum(r, pos) - sum(r, pos - 1);
}

void remove_interval(int l, int r)
{
    while(true)
    {
        set < pair < int, int > > :: iterator it = act.lower_bound({l, -1});
        if (it == act.end() || it -> first > r)
            break;
        if (it -> second <= r)
        {
            act.erase(it);
            add(1, it -> first, -get_length(it -> first, it -> second));
        }
        else
        {
            pair < int, int > nw;
            nw.first = r + 1;
            nw.second = it -> second;
            act.erase(it);
            add(1, it -> first, -get_length(it -> first, it -> second));
            act.insert(nw);
            add(1, nw.first, get_length(nw.first, nw.second));
            break;
        }
    }
    set < pair < int, int > > :: iterator it = act.lower_bound({l, -1});
    //cout << "cur " << it -> first << " " << it -> second << endl;
    if (it != act.begin())
    {
        it = prev(it);
        ///cout << "back " << it -> first << " " << it -> second << endl;
        if (it -> second > r)
        {
            pair < int, int > lf = *it, rf = *it;
            lf.second = l - 1;
            rf.first = r + 1;
            act.erase(it);
            add(1, it -> first, -get_pos(1,it -> first));
            act.insert(lf);
            add(1, lf.first, get_length(lf.first, lf.second));
            act.insert(rf);
            add(1, rf.first, get_length(rf.first, rf.second));
        }
        else if (it -> second >= l)
        {
            pair < int, int > nw = *it;
            nw.second = l - 1;
            act.erase(it);
            add(1, it -> first, -get_pos(1, it -> first));
            act.insert(nw);
            add(1, nw.first, get_length(nw.first, nw.second));
        }
    }
}

pair < int, int > first_bef(int pos)
{
    set < pair < int, int > > :: iterator it = act.lower_bound({pos, -1});
    if (it == act.begin())
        return {0, 0};
    return {prev(it) -> first, min(pos - 1, prev(it) -> second)};
}
pair < int, int > first_aft(int pos)
{

    set < pair < int, int > > :: iterator it = act.lower_bound({pos, -1});
    if (it != act.begin() && prev(it) -> second > pos)
        return {pos + 1, prev(it) -> second};
    if (it == act.end())
        return {m + 1, m + 1};
    return {max(pos + 1, it -> first), it -> second};
}


int lb_last, rb_last;
int get_longest(interval cur)
{
    /**int lb = 1;
    while(lb <= m && rel[lb].r <= cur.l)
        lb ++;
    lb --;
    while(lb > 0 && used[lb])
        lb --;

    int rb = m;
    while(rb > 0 && rel[rb].l >= cur.r)
        rb --;
    rb ++;
    while(rb <= m && used[rb])
        rb ++;*/

    int lf = 1, rf = m;
    while(lf <= rf)
    {
        int mf = (lf + rf) / 2;
        if (rel[mf].r <= cur.l)
            lf = mf + 1;
        else
            rf = mf - 1;
    }

    int lb = lf;

    lf = 1;
    rf = m;
    while(lf <= rf)
    {
        int mf = (lf + rf) / 2;
        if (rel[mf].l >= cur.r)
            rf = mf - 1;
        else
            lf = mf + 1;
    }

    int rb = rf;


    pair < int, int > fb = first_bef(lb);
    pair < int, int > fa = first_aft(rb);
    ///cout << sum(1, m) << " :::: " << sum(1, fa.second) << endl;
    int longest = 0;
    if (fb.first != 0)
        longest += get_length(fb.first, fb.second) + sum(1, fb.first - 1);

    ///cout << "HERE " << fa.first << " " << fa.second << " " << get_length(fa.first, fa.second) << endl;
    if (fa.second != m + 1)
        longest += get_length(fa.first, fa.second) + sum(1, m) - sum(1, fa.second);
    ///int longest = len[0][fb.second] + len[1][fa.first];
    lb_last = lb;
    rb_last = rb;

    return longest;
}

void reverse_intersections()
{
    for (int i = 1; i <= m; i ++)
        if (used[i] == 2)
            used[i] = 0;
}

void apply_intersections()
{
    for (int i = 1; i <= m; i ++)
        if (used[i] == 2)
            used[i] = 1;
}


void binary_lifting()
{
    int last = 0;
    rel[m + 1].l = 1e9 + 10;
    for (int i = 1; i <= m; i ++)
    {
        if (used[i])
            continue;
        len[0][i] = 0;
        pt[0][i] = 0;
        if (last != 0)
            pt[0][i] = pt[0][last];
        while(rel[pt[0][i]].r <= rel[i].l)
            pt[0][i] ++;
        pt[0][i] --;
        while(pt[0][i] > 0 && used[pt[0][i]])
            pt[0][i] --;

        len[0][i] = len[0][pt[0][i]] + 1;
        last = i;
    }

    last = m + 1;
    for (int i = m; i > 0; i --)
    {
        if (used[i])
            continue;
        len[1][i] = 0;
        pt[1][i] = m + 1;
        if (last != m + 1)
            pt[1][i] = pt[1][last];
        while(rel[pt[1][i]].l >= rel[i].r)
            pt[1][i] --;
        pt[1][i] ++;
        while(pt[1][i] <= m && used[pt[1][i]])
            pt[1][i] ++;
        len[1][i] = len[1][pt[1][i]] + 1;
        ///cout << "line 107 " << i << " " << pt[1][i] << endl;
        last = i;
    }

    for (int i = 0; i <= m; i ++)
        dp[0][i] = pt[1][i];
    for (int j = 0; j < maxlog; j ++)
        dp[j][m + 1] = m + 1;
    for (int j = 1; j < maxlog; j ++)
    {
        for (int i = 1; i <= m; i ++)
        {
            dp[j][i] = dp[j - 1][dp[j - 1][i]];
        }
    }

}

set < pair < int, int > > ranges;

bool match(interval cur)
{
    set < pair < int, int > > :: iterator it = ranges.lower_bound({cur.l, -1});
    if (it != ranges.end() && it -> first < cur.r)
        return true;
    if (it != ranges.begin())
    {
        it = prev(it);
        if (it -> second > cur.l)
        {
            //cout << cur.l << " : " << cur.r << " " << it -> second << endl;
            return true;
        }
    }
    return false;
}
void create_sequence()
{
    act.insert({1, m});
    binary_lifting();
    add(1, 1, get_length(1, m));
    vector < int > seq;
    for (int i = 1; i <= n && k > 0; i ++)
    {
        if (match(seg[i]))
            continue;
        int longest = get_longest(seg[i]);

        if (longest >= k - 1)
        {

            seq.push_back(i);
            k --;
            remove_interval(lb_last, rb_last);
            ranges.insert({seg[i].l, seg[i].r});
        }

    }

    if (k != 0)
    {
        cout << -1 << endl;
        return;
    }
    for (int cur : seq)
        cout << cur << endl;
}
void solve()
{
    input();
    get_relevant();
    ///calc_pointers();
    create_sequence();
}

int main()
{
    speed();
    solve();
    return 0;
}

/**
2 2
1 3
1 2

20 9
18 22
2 5
28 31
21 25
25 27
3 6
36 39
22 26
8 12
27 31
27 29
32 36
14 18
16 20
22 26
10 14
17 21
13 17
15 19
37 40

20 5
715591101 817706977
777008847 930020190
379125190 717746290
308826535 651449374
799848635 899870053
173402733 393191194
565584335 789226348
291163241 758381981
249473019 374801668
294956234 880404922
451362750 913870571
98855617 246302398
339866606 382702111
293058132 409201146
478015003 708631705
377970105 957002219
588778390 752946205
265885640 799122807
848738346 862888689
216577014 930520748


*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 84 ms 18048 KB Output is correct
5 Correct 80 ms 18864 KB Output is correct
6 Correct 78 ms 17332 KB Output is correct
7 Correct 81 ms 17020 KB Output is correct
8 Correct 85 ms 17944 KB Output is correct
9 Correct 85 ms 17580 KB Output is correct
10 Correct 93 ms 17328 KB Output is correct
11 Correct 77 ms 16792 KB Output is correct
12 Correct 64 ms 16048 KB Output is correct
13 Correct 61 ms 15656 KB Output is correct
14 Correct 59 ms 15752 KB Output is correct
15 Correct 55 ms 15272 KB Output is correct
16 Correct 35 ms 13512 KB Output is correct
17 Correct 32 ms 13308 KB Output is correct
18 Correct 31 ms 13248 KB Output is correct
19 Correct 26 ms 12736 KB Output is correct
20 Correct 26 ms 12736 KB Output is correct
21 Correct 26 ms 12736 KB Output is correct
22 Correct 22 ms 12740 KB Output is correct
23 Correct 22 ms 12732 KB Output is correct
24 Correct 23 ms 13028 KB Output is correct
25 Correct 21 ms 12740 KB Output is correct
26 Correct 21 ms 12740 KB Output is correct
27 Correct 21 ms 12744 KB Output is correct
28 Correct 44 ms 12744 KB Output is correct
29 Correct 42 ms 12744 KB Output is correct
30 Correct 37 ms 12860 KB Output is correct
31 Correct 32 ms 12744 KB Output is correct
32 Correct 31 ms 12740 KB Output is correct
33 Correct 31 ms 12736 KB Output is correct
34 Correct 46 ms 15036 KB Output is correct
35 Correct 38 ms 14016 KB Output is correct
36 Correct 30 ms 13456 KB Output is correct
37 Correct 56 ms 15636 KB Output is correct
38 Correct 54 ms 15296 KB Output is correct
39 Correct 57 ms 15536 KB Output is correct
40 Correct 55 ms 15280 KB Output is correct
41 Correct 52 ms 15020 KB Output is correct
42 Correct 39 ms 12736 KB Output is correct
43 Correct 54 ms 15352 KB Output is correct
44 Correct 53 ms 15236 KB Output is correct
45 Correct 52 ms 15292 KB Output is correct
46 Correct 52 ms 15024 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 1 ms 12636 KB Output is correct
5 Correct 1 ms 12636 KB Output is correct
6 Correct 2 ms 12632 KB Output is correct
7 Correct 1 ms 12888 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12836 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12632 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 1 ms 12636 KB Output is correct
16 Correct 2 ms 12772 KB Output is correct
17 Correct 1 ms 12632 KB Output is correct
18 Correct 1 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12768 KB Output is correct
21 Correct 1 ms 12636 KB Output is correct
22 Correct 1 ms 12632 KB Output is correct
23 Correct 1 ms 12632 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 1 ms 12636 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 1 ms 12636 KB Output is correct
5 Correct 1 ms 12636 KB Output is correct
6 Correct 2 ms 12632 KB Output is correct
7 Correct 1 ms 12888 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12836 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12632 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 1 ms 12636 KB Output is correct
16 Correct 2 ms 12772 KB Output is correct
17 Correct 1 ms 12632 KB Output is correct
18 Correct 1 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12768 KB Output is correct
21 Correct 1 ms 12636 KB Output is correct
22 Correct 1 ms 12632 KB Output is correct
23 Correct 1 ms 12632 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 2 ms 12632 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 1 ms 12636 KB Output is correct
28 Correct 2 ms 12636 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12632 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 3 ms 12636 KB Output is correct
34 Correct 3 ms 12636 KB Output is correct
35 Correct 5 ms 12728 KB Output is correct
36 Correct 5 ms 12892 KB Output is correct
37 Correct 4 ms 12892 KB Output is correct
38 Correct 4 ms 12632 KB Output is correct
39 Correct 5 ms 12892 KB Output is correct
40 Correct 5 ms 12760 KB Output is correct
41 Correct 4 ms 12892 KB Output is correct
42 Correct 3 ms 12636 KB Output is correct
43 Correct 4 ms 12636 KB Output is correct
44 Correct 3 ms 12636 KB Output is correct
45 Correct 3 ms 12636 KB Output is correct
46 Correct 3 ms 12636 KB Output is correct
47 Correct 3 ms 12636 KB Output is correct
48 Correct 2 ms 12632 KB Output is correct
49 Correct 2 ms 12632 KB Output is correct
50 Correct 3 ms 12632 KB Output is correct
51 Correct 2 ms 12636 KB Output is correct
52 Correct 2 ms 12636 KB Output is correct
53 Correct 2 ms 12636 KB Output is correct
54 Correct 3 ms 12636 KB Output is correct
55 Correct 5 ms 12892 KB Output is correct
56 Correct 4 ms 12892 KB Output is correct
57 Correct 4 ms 12892 KB Output is correct
58 Correct 4 ms 12892 KB Output is correct
59 Correct 4 ms 12892 KB Output is correct
60 Correct 4 ms 12888 KB Output is correct
61 Correct 3 ms 12892 KB Output is correct
62 Correct 3 ms 12904 KB Output is correct
63 Correct 3 ms 12892 KB Output is correct
64 Correct 4 ms 12828 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 1 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 84 ms 18048 KB Output is correct
5 Correct 80 ms 18864 KB Output is correct
6 Correct 78 ms 17332 KB Output is correct
7 Correct 81 ms 17020 KB Output is correct
8 Correct 85 ms 17944 KB Output is correct
9 Correct 85 ms 17580 KB Output is correct
10 Correct 93 ms 17328 KB Output is correct
11 Correct 77 ms 16792 KB Output is correct
12 Correct 64 ms 16048 KB Output is correct
13 Correct 61 ms 15656 KB Output is correct
14 Correct 59 ms 15752 KB Output is correct
15 Correct 55 ms 15272 KB Output is correct
16 Correct 35 ms 13512 KB Output is correct
17 Correct 32 ms 13308 KB Output is correct
18 Correct 31 ms 13248 KB Output is correct
19 Correct 26 ms 12736 KB Output is correct
20 Correct 26 ms 12736 KB Output is correct
21 Correct 26 ms 12736 KB Output is correct
22 Correct 22 ms 12740 KB Output is correct
23 Correct 22 ms 12732 KB Output is correct
24 Correct 23 ms 13028 KB Output is correct
25 Correct 21 ms 12740 KB Output is correct
26 Correct 21 ms 12740 KB Output is correct
27 Correct 21 ms 12744 KB Output is correct
28 Correct 44 ms 12744 KB Output is correct
29 Correct 42 ms 12744 KB Output is correct
30 Correct 37 ms 12860 KB Output is correct
31 Correct 32 ms 12744 KB Output is correct
32 Correct 31 ms 12740 KB Output is correct
33 Correct 31 ms 12736 KB Output is correct
34 Correct 46 ms 15036 KB Output is correct
35 Correct 38 ms 14016 KB Output is correct
36 Correct 30 ms 13456 KB Output is correct
37 Correct 56 ms 15636 KB Output is correct
38 Correct 54 ms 15296 KB Output is correct
39 Correct 57 ms 15536 KB Output is correct
40 Correct 55 ms 15280 KB Output is correct
41 Correct 52 ms 15020 KB Output is correct
42 Correct 39 ms 12736 KB Output is correct
43 Correct 54 ms 15352 KB Output is correct
44 Correct 53 ms 15236 KB Output is correct
45 Correct 52 ms 15292 KB Output is correct
46 Correct 52 ms 15024 KB Output is correct
47 Correct 1 ms 12632 KB Output is correct
48 Correct 2 ms 12636 KB Output is correct
49 Correct 2 ms 12636 KB Output is correct
50 Correct 1 ms 12636 KB Output is correct
51 Correct 1 ms 12636 KB Output is correct
52 Correct 2 ms 12632 KB Output is correct
53 Correct 1 ms 12888 KB Output is correct
54 Correct 2 ms 12636 KB Output is correct
55 Correct 2 ms 12636 KB Output is correct
56 Correct 2 ms 12836 KB Output is correct
57 Correct 2 ms 12636 KB Output is correct
58 Correct 2 ms 12632 KB Output is correct
59 Correct 2 ms 12636 KB Output is correct
60 Correct 2 ms 12636 KB Output is correct
61 Correct 1 ms 12636 KB Output is correct
62 Correct 2 ms 12772 KB Output is correct
63 Correct 1 ms 12632 KB Output is correct
64 Correct 1 ms 12636 KB Output is correct
65 Correct 2 ms 12636 KB Output is correct
66 Correct 2 ms 12768 KB Output is correct
67 Correct 1 ms 12636 KB Output is correct
68 Correct 1 ms 12632 KB Output is correct
69 Correct 1 ms 12632 KB Output is correct
70 Correct 2 ms 12636 KB Output is correct
71 Correct 2 ms 12632 KB Output is correct
72 Correct 2 ms 12636 KB Output is correct
73 Correct 1 ms 12636 KB Output is correct
74 Correct 2 ms 12636 KB Output is correct
75 Correct 2 ms 12636 KB Output is correct
76 Correct 2 ms 12636 KB Output is correct
77 Correct 2 ms 12632 KB Output is correct
78 Correct 2 ms 12636 KB Output is correct
79 Correct 3 ms 12636 KB Output is correct
80 Correct 3 ms 12636 KB Output is correct
81 Correct 5 ms 12728 KB Output is correct
82 Correct 5 ms 12892 KB Output is correct
83 Correct 4 ms 12892 KB Output is correct
84 Correct 4 ms 12632 KB Output is correct
85 Correct 5 ms 12892 KB Output is correct
86 Correct 5 ms 12760 KB Output is correct
87 Correct 4 ms 12892 KB Output is correct
88 Correct 3 ms 12636 KB Output is correct
89 Correct 4 ms 12636 KB Output is correct
90 Correct 3 ms 12636 KB Output is correct
91 Correct 3 ms 12636 KB Output is correct
92 Correct 3 ms 12636 KB Output is correct
93 Correct 3 ms 12636 KB Output is correct
94 Correct 2 ms 12632 KB Output is correct
95 Correct 2 ms 12632 KB Output is correct
96 Correct 3 ms 12632 KB Output is correct
97 Correct 2 ms 12636 KB Output is correct
98 Correct 2 ms 12636 KB Output is correct
99 Correct 2 ms 12636 KB Output is correct
100 Correct 3 ms 12636 KB Output is correct
101 Correct 5 ms 12892 KB Output is correct
102 Correct 4 ms 12892 KB Output is correct
103 Correct 4 ms 12892 KB Output is correct
104 Correct 4 ms 12892 KB Output is correct
105 Correct 4 ms 12892 KB Output is correct
106 Correct 4 ms 12888 KB Output is correct
107 Correct 3 ms 12892 KB Output is correct
108 Correct 3 ms 12904 KB Output is correct
109 Correct 3 ms 12892 KB Output is correct
110 Correct 4 ms 12828 KB Output is correct
111 Correct 30 ms 14232 KB Output is correct
112 Correct 32 ms 14784 KB Output is correct
113 Correct 30 ms 14764 KB Output is correct
114 Correct 28 ms 14792 KB Output is correct
115 Correct 27 ms 14884 KB Output is correct
116 Correct 50 ms 14780 KB Output is correct
117 Correct 47 ms 14768 KB Output is correct
118 Correct 248 ms 20008 KB Output is correct
119 Correct 173 ms 19884 KB Output is correct
120 Correct 101 ms 17548 KB Output is correct
121 Correct 83 ms 14780 KB Output is correct
122 Correct 143 ms 17840 KB Output is correct
123 Correct 115 ms 17624 KB Output is correct
124 Correct 109 ms 17552 KB Output is correct
125 Correct 88 ms 14784 KB Output is correct
126 Correct 61 ms 15280 KB Output is correct
127 Correct 56 ms 15284 KB Output is correct
128 Correct 58 ms 15292 KB Output is correct
129 Correct 78 ms 14892 KB Output is correct
130 Correct 41 ms 14660 KB Output is correct
131 Correct 38 ms 14792 KB Output is correct
132 Correct 36 ms 14872 KB Output is correct
133 Correct 64 ms 14892 KB Output is correct
134 Correct 34 ms 14780 KB Output is correct
135 Correct 32 ms 14780 KB Output is correct
136 Correct 31 ms 14788 KB Output is correct
137 Correct 52 ms 14884 KB Output is correct
138 Correct 28 ms 14780 KB Output is correct
139 Correct 28 ms 14780 KB Output is correct
140 Correct 25 ms 14880 KB Output is correct
141 Correct 45 ms 14764 KB Output is correct
142 Correct 88 ms 20192 KB Output is correct
143 Correct 88 ms 20228 KB Output is correct
144 Correct 89 ms 20304 KB Output is correct
145 Correct 87 ms 20144 KB Output is correct
146 Correct 85 ms 20144 KB Output is correct
147 Correct 85 ms 20424 KB Output is correct
148 Correct 81 ms 19892 KB Output is correct
149 Correct 86 ms 19908 KB Output is correct
150 Correct 84 ms 19632 KB Output is correct
151 Correct 82 ms 19080 KB Output is correct
152 Correct 45 ms 14792 KB Output is correct
153 Correct 87 ms 20260 KB Output is correct
154 Correct 84 ms 20140 KB Output is correct
155 Correct 83 ms 20104 KB Output is correct
156 Correct 84 ms 19892 KB Output is correct
157 Correct 84 ms 19716 KB Output is correct
158 Correct 81 ms 19628 KB Output is correct
159 Correct 74 ms 19068 KB Output is correct
160 Correct 46 ms 14780 KB Output is correct
161 Correct 122 ms 17708 KB Output is correct
162 Correct 103 ms 17324 KB Output is correct
163 Correct 102 ms 17412 KB Output is correct
164 Correct 97 ms 17472 KB Output is correct
165 Correct 93 ms 17328 KB Output is correct
166 Correct 43 ms 14644 KB Output is correct
167 Correct 57 ms 17328 KB Output is correct
168 Correct 56 ms 17340 KB Output is correct
169 Correct 58 ms 17220 KB Output is correct
170 Correct 53 ms 17084 KB Output is correct
171 Correct 56 ms 16668 KB Output is correct
172 Correct 53 ms 17584 KB Output is correct
173 Correct 133 ms 17376 KB Output is correct
174 Correct 117 ms 17576 KB Output is correct
175 Correct 114 ms 17324 KB Output is correct
176 Correct 99 ms 17072 KB Output is correct