oj.uz

Submission #852621

# Submission time Handle Problem Language Result Execution time Memory
852621 2023-09-22T08:30:10 Z danikoynov Food Court (JOI21_foodcourt) C++14
42 / 100
 1000 ms 57424 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 = 250010;
const ll inf = 1e18;
struct node
{
    ll min_val, min_lf, min_rf;

    node(ll  _min_val = inf, ll _min_lf = -1, ll _min_rf = -1)
    {
        min_val = _min_val;
        min_lf = _min_lf;
        min_rf = _min_rf;
    }
};

node merge_nodes(node lf, node rf)
{
    if (lf.min_val < rf.min_val)
        return lf;
    if (rf.min_val < lf.min_val)
    return rf;

    node cur = lf;
    if (lf.min_rf == rf.min_lf - 1)
    {
        cur.min_rf = rf.min_rf;
    }
    return cur;
}

struct segment_tree
{
    node tree[4 * maxn];
    ll lazy[4 * maxn];

    void push_lazy(int root, int left, int right)
    {
        tree[root].min_val += lazy[root];
        if (left != right)
        {
            lazy[root * 2] += lazy[root];
            lazy[root * 2 + 1] += lazy[root];
        }
        lazy[root] = 0;
    }

    void build(int root, int left, int right)
    {
        if (left == right)
        {
            tree[root].min_lf = left;
            tree[root].min_rf = right;
            tree[root].min_val = 0;
            return;
        }

        int mid = (left + right) / 2;
        build(root * 2, left, mid);
        build(root * 2 + 1, mid + 1, right);

        tree[root] = merge_nodes(tree[root * 2], tree[root * 2 + 1]);
    }
    void update(int root, int left, int right, int qleft, int qright, ll cur)
    {
        push_lazy(root, left, right);

        if (left > qright || right < qleft)
            return;

        if (left >= qleft && right <= qright)
        {
            lazy[root] = cur;
            push_lazy(root, left, right);
            return;
        }

        int mid = (left + right) / 2;
        update(root * 2, left, mid, qleft, qright, cur);
        update(root * 2 + 1, mid + 1, right, qleft, qright, cur);

        tree[root] = merge_nodes(tree[root * 2], tree[root * 2 + 1]);
    }

    node query(int root, int left, int right, int qleft, int qright)
    {
        push_lazy(root, left, right);
        if (left > qright || right < qleft)
            return node();
        if (left >= qleft && right <= qright)
            return tree[root];

        int mid = (left + right) / 2;
        return merge_nodes(query(root * 2, left, mid, qleft, qright),
                           query(root * 2 + 1, mid + 1, right, qleft, qright));
    }

};



int n, m, q;
void input()
{
    cin >> n >> m >> q;
}

struct task
{
    int idx;
    ll  pos;

    task(int _idx = 0, ll _pos = 0)
    {
        idx = _idx;

        pos = _pos;
    }
};

struct bit
{
    ll fen[maxn];

    void update(int pos, ll val)
    {
        for (int i = pos; i < maxn; i += (i & -i))
            fen[i] += val;
    }

    ll query(int pos)
    {
        ll sum = 0;
        for (int i = pos; i > 0; i -= (i & -i))
            sum += fen[i];
        return sum;
    }

    void range_update(int l, int r, ll v)
    {
        update(l, v);
        update(r + 1, - v);
    }

    int find_kth(ll to)
    {
        int pos = 0;
        ll sum = 0;
        for (int bit = 20; bit >= 0; bit --)
        {
            if (pos + (1 << bit) > maxn)
                continue;
            ll new_sum = sum + fen[pos + (1 << bit)];
            if (new_sum < to)
            {
                pos = pos + (1 << bit);
                sum = new_sum;
            }
        }
        return pos + 1;
    }
};

vector < task > ask[maxn];
segment_tree line_tree;
bit pass_tree;
int ans[maxn];


pair < int, ll > add[maxn];
vector < int > upd[maxn];
int query_cnt = 0;

void simulate()
{
    line_tree.build(1, 1, n);
    int t, l, r, c, a; /// careful overflow
    ll k, b;

    int cnt = 0;
    for (int i = 1; i <= q; i ++)
    {
        cin >> t;
        if (t == 1)
        {
            cin >> l >> r >> c >> k;
            line_tree.update(1, 1, n, l, r, k);
            add[i] = {c, k};
            upd[l].push_back(i);
            upd[r + 1].push_back(-i);
        }
        else
        if (t == 2)
        {
            cin >> l >> r >> k;
            line_tree.update(1, 1, n, l, r, -k);
            pass_tree.range_update(l, r, k);
            node cur;
            while(true)
            {
                cur = line_tree.query(1, 1, n, l, r);
                if (cur.min_val >= 0)
                    break;
                pass_tree.range_update(cur.min_lf, cur.min_rf, cur.min_val);
                line_tree.update(1, 1, n, cur.min_lf, cur.min_rf, - cur.min_val);
                cnt ++;
            }
        }
        else
        {
            cin >> a >> b;
            query_cnt ++;
            if (line_tree.query(1, 1, n, a, a).min_val < b)
            {
                ans[query_cnt] = 0;
            }
            else
            {
                ///cout << "here " << query_cnt << " " << pass_tree.query(a) << " " << line_tree.query(1, 1, n, a, a).min_val << endl;
                ask[a].push_back(task(query_cnt, pass_tree.query(a) + b));
            }
        }
    }
    assert(cnt <= 4 * q);
}

bit active;
void answer_tasks()
{
    for (int i = 1; i <= n; i ++)
    {
        for (int cur : upd[i])
        {
            if (cur > 0)
            {
                active.update(cur, add[cur].second);
            }
            else
            {
                active.update(-cur, - add[-cur].second);
            }
        }

        for (task cur : ask[i])
        {
            ans[cur.idx] = add[active.find_kth(cur.pos)].first;
            ///cout << cur.idx << " : " << cur.shop << " " << cur.pos << endl;
        }
    }
    for (int i = 1; i <= query_cnt; i ++)
    {
        cout << ans[i] << endl;
    }
}

void solve()
{
    input();
    simulate();
    answer_tasks();
}

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

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 43864 KB Output is correct
2 Correct 8 ms 43864 KB Output is correct
3 Correct 8 ms 43868 KB Output is correct
4 Correct 8 ms 43864 KB Output is correct
5 Correct 7 ms 43864 KB Output is correct
6 Correct 8 ms 43864 KB Output is correct
7 Correct 8 ms 42072 KB Output is correct
8 Correct 9 ms 43864 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 8 ms 41816 KB Output is correct
11 Correct 9 ms 41816 KB Output is correct
12 Correct 9 ms 41820 KB Output is correct
13 Correct 7 ms 43868 KB Output is correct
14 Correct 8 ms 43864 KB Output is correct
15 Correct 8 ms 43864 KB Output is correct
16 Correct 8 ms 43864 KB Output is correct
17 Correct 9 ms 41816 KB Output is correct
18 Correct 10 ms 43864 KB Output is correct
19 Correct 8 ms 43868 KB Output is correct
20 Correct 8 ms 41816 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 43864 KB Output is correct
2 Correct 8 ms 43864 KB Output is correct
3 Correct 8 ms 43868 KB Output is correct
4 Correct 8 ms 43864 KB Output is correct
5 Correct 7 ms 43864 KB Output is correct
6 Correct 8 ms 43864 KB Output is correct
7 Correct 8 ms 42072 KB Output is correct
8 Correct 9 ms 43864 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 8 ms 41816 KB Output is correct
11 Correct 9 ms 41816 KB Output is correct
12 Correct 9 ms 41820 KB Output is correct
13 Correct 7 ms 43868 KB Output is correct
14 Correct 8 ms 43864 KB Output is correct
15 Correct 8 ms 43864 KB Output is correct
16 Correct 8 ms 43864 KB Output is correct
17 Correct 9 ms 41816 KB Output is correct
18 Correct 10 ms 43864 KB Output is correct
19 Correct 8 ms 43868 KB Output is correct
20 Correct 8 ms 41816 KB Output is correct
21 Correct 9 ms 43864 KB Output is correct
22 Correct 9 ms 43868 KB Output is correct
23 Correct 8 ms 43864 KB Output is correct
24 Correct 9 ms 43864 KB Output is correct
25 Correct 7 ms 43864 KB Output is correct
26 Correct 8 ms 43864 KB Output is correct
27 Correct 8 ms 41820 KB Output is correct
28 Correct 8 ms 41816 KB Output is correct
29 Correct 9 ms 41816 KB Output is correct
30 Correct 9 ms 43864 KB Output is correct
31 Correct 11 ms 43864 KB Output is correct
32 Correct 10 ms 43864 KB Output is correct
33 Correct 8 ms 43864 KB Output is correct
34 Correct 8 ms 43864 KB Output is correct
35 Correct 8 ms 41816 KB Output is correct
36 Correct 8 ms 43864 KB Output is correct
37 Correct 8 ms 41816 KB Output is correct
38 Correct 9 ms 41820 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 48976 KB Output is correct
2 Correct 131 ms 49332 KB Output is correct
3 Correct 108 ms 48976 KB Output is correct
4 Correct 121 ms 48980 KB Output is correct
5 Correct 143 ms 49488 KB Output is correct
6 Correct 116 ms 49488 KB Output is correct
7 Correct 23 ms 46424 KB Output is correct
8 Correct 24 ms 46424 KB Output is correct
9 Correct 112 ms 47696 KB Output is correct
10 Correct 144 ms 49204 KB Output is correct
11 Correct 116 ms 49128 KB Output is correct
12 Correct 118 ms 49228 KB Output is correct
13 Correct 85 ms 47652 KB Output is correct
14 Correct 100 ms 49744 KB Output is correct
15 Correct 99 ms 49340 KB Output is correct
16 Correct 103 ms 48208 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 512 ms 55404 KB Output is correct
2 Correct 508 ms 54292 KB Output is correct
3 Correct 457 ms 55888 KB Output is correct
4 Correct 282 ms 55040 KB Output is correct
5 Correct 240 ms 54096 KB Output is correct
6 Correct 354 ms 56344 KB Output is correct
7 Correct 73 ms 48412 KB Output is correct
8 Correct 75 ms 46100 KB Output is correct
9 Correct 304 ms 57424 KB Output is correct
10 Correct 365 ms 57316 KB Output is correct
11 Correct 498 ms 55376 KB Output is correct
12 Correct 402 ms 55632 KB Output is correct
13 Correct 366 ms 55124 KB Output is correct
14 Correct 537 ms 55232 KB Output is correct
15 Correct 644 ms 55632 KB Output is correct
16 Correct 619 ms 55196 KB Output is correct
17 Correct 641 ms 55604 KB Output is correct
18 Correct 524 ms 55408 KB Output is correct
19 Correct 574 ms 55632 KB Output is correct
20 Correct 575 ms 55880 KB Output is correct
21 Correct 656 ms 56004 KB Output is correct
22 Correct 643 ms 55444 KB Output is correct
23 Correct 511 ms 55376 KB Output is correct
24 Correct 582 ms 55272 KB Output is correct
25 Correct 322 ms 51176 KB Output is correct
26 Correct 308 ms 53136 KB Output is correct
27 Execution timed out 1046 ms 54320 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 43864 KB Output is correct
2 Correct 8 ms 43864 KB Output is correct
3 Correct 8 ms 43868 KB Output is correct
4 Correct 8 ms 43864 KB Output is correct
5 Correct 7 ms 43864 KB Output is correct
6 Correct 8 ms 43864 KB Output is correct
7 Correct 8 ms 42072 KB Output is correct
8 Correct 9 ms 43864 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 8 ms 41816 KB Output is correct
11 Correct 9 ms 41816 KB Output is correct
12 Correct 9 ms 41820 KB Output is correct
13 Correct 7 ms 43868 KB Output is correct
14 Correct 8 ms 43864 KB Output is correct
15 Correct 8 ms 43864 KB Output is correct
16 Correct 8 ms 43864 KB Output is correct
17 Correct 9 ms 41816 KB Output is correct
18 Correct 10 ms 43864 KB Output is correct
19 Correct 8 ms 43868 KB Output is correct
20 Correct 8 ms 41816 KB Output is correct
21 Correct 129 ms 48976 KB Output is correct
22 Correct 131 ms 49332 KB Output is correct
23 Correct 108 ms 48976 KB Output is correct
24 Correct 121 ms 48980 KB Output is correct
25 Correct 143 ms 49488 KB Output is correct
26 Correct 116 ms 49488 KB Output is correct
27 Correct 23 ms 46424 KB Output is correct
28 Correct 24 ms 46424 KB Output is correct
29 Correct 112 ms 47696 KB Output is correct
30 Correct 144 ms 49204 KB Output is correct
31 Correct 116 ms 49128 KB Output is correct
32 Correct 118 ms 49228 KB Output is correct
33 Correct 85 ms 47652 KB Output is correct
34 Correct 100 ms 49744 KB Output is correct
35 Correct 99 ms 49340 KB Output is correct
36 Correct 103 ms 48208 KB Output is correct
37 Correct 81 ms 49488 KB Output is correct
38 Correct 57 ms 49492 KB Output is correct
39 Correct 19 ms 46556 KB Output is correct
40 Correct 22 ms 46672 KB Output is correct
41 Correct 87 ms 45904 KB Output is correct
42 Correct 91 ms 49588 KB Output is correct
43 Correct 98 ms 49580 KB Output is correct
44 Correct 105 ms 49744 KB Output is correct
45 Correct 81 ms 47952 KB Output is correct
46 Correct 98 ms 49488 KB Output is correct
47 Correct 37 ms 48844 KB Output is correct
48 Correct 75 ms 49004 KB Output is correct
49 Correct 81 ms 48952 KB Output is correct
50 Correct 105 ms 47696 KB Output is correct
51 Correct 114 ms 47864 KB Output is correct
52 Correct 116 ms 49488 KB Output is correct
53 Correct 79 ms 48112 KB Output is correct
54 Correct 92 ms 49832 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 48208 KB Output is correct
2 Correct 63 ms 47952 KB Output is correct
3 Correct 73 ms 48208 KB Output is correct
4 Correct 54 ms 47692 KB Output is correct
5 Correct 56 ms 47952 KB Output is correct
6 Correct 66 ms 48024 KB Output is correct
7 Correct 24 ms 44756 KB Output is correct
8 Correct 28 ms 44864 KB Output is correct
9 Correct 43 ms 47164 KB Output is correct
10 Correct 43 ms 46900 KB Output is correct
11 Correct 58 ms 47184 KB Output is correct
12 Correct 57 ms 47188 KB Output is correct

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 43864 KB Output is correct
2 Correct 8 ms 43864 KB Output is correct
3 Correct 8 ms 43868 KB Output is correct
4 Correct 8 ms 43864 KB Output is correct
5 Correct 7 ms 43864 KB Output is correct
6 Correct 8 ms 43864 KB Output is correct
7 Correct 8 ms 42072 KB Output is correct
8 Correct 9 ms 43864 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 8 ms 41816 KB Output is correct
11 Correct 9 ms 41816 KB Output is correct
12 Correct 9 ms 41820 KB Output is correct
13 Correct 7 ms 43868 KB Output is correct
14 Correct 8 ms 43864 KB Output is correct
15 Correct 8 ms 43864 KB Output is correct
16 Correct 8 ms 43864 KB Output is correct
17 Correct 9 ms 41816 KB Output is correct
18 Correct 10 ms 43864 KB Output is correct
19 Correct 8 ms 43868 KB Output is correct
20 Correct 8 ms 41816 KB Output is correct
21 Correct 9 ms 43864 KB Output is correct
22 Correct 9 ms 43868 KB Output is correct
23 Correct 8 ms 43864 KB Output is correct
24 Correct 9 ms 43864 KB Output is correct
25 Correct 7 ms 43864 KB Output is correct
26 Correct 8 ms 43864 KB Output is correct
27 Correct 8 ms 41820 KB Output is correct
28 Correct 8 ms 41816 KB Output is correct
29 Correct 9 ms 41816 KB Output is correct
30 Correct 9 ms 43864 KB Output is correct
31 Correct 11 ms 43864 KB Output is correct
32 Correct 10 ms 43864 KB Output is correct
33 Correct 8 ms 43864 KB Output is correct
34 Correct 8 ms 43864 KB Output is correct
35 Correct 8 ms 41816 KB Output is correct
36 Correct 8 ms 43864 KB Output is correct
37 Correct 8 ms 41816 KB Output is correct
38 Correct 9 ms 41820 KB Output is correct
39 Correct 129 ms 48976 KB Output is correct
40 Correct 131 ms 49332 KB Output is correct
41 Correct 108 ms 48976 KB Output is correct
42 Correct 121 ms 48980 KB Output is correct
43 Correct 143 ms 49488 KB Output is correct
44 Correct 116 ms 49488 KB Output is correct
45 Correct 23 ms 46424 KB Output is correct
46 Correct 24 ms 46424 KB Output is correct
47 Correct 112 ms 47696 KB Output is correct
48 Correct 144 ms 49204 KB Output is correct
49 Correct 116 ms 49128 KB Output is correct
50 Correct 118 ms 49228 KB Output is correct
51 Correct 85 ms 47652 KB Output is correct
52 Correct 100 ms 49744 KB Output is correct
53 Correct 99 ms 49340 KB Output is correct
54 Correct 103 ms 48208 KB Output is correct
55 Correct 81 ms 49488 KB Output is correct
56 Correct 57 ms 49492 KB Output is correct
57 Correct 19 ms 46556 KB Output is correct
58 Correct 22 ms 46672 KB Output is correct
59 Correct 87 ms 45904 KB Output is correct
60 Correct 91 ms 49588 KB Output is correct
61 Correct 98 ms 49580 KB Output is correct
62 Correct 105 ms 49744 KB Output is correct
63 Correct 81 ms 47952 KB Output is correct
64 Correct 98 ms 49488 KB Output is correct
65 Correct 37 ms 48844 KB Output is correct
66 Correct 75 ms 49004 KB Output is correct
67 Correct 81 ms 48952 KB Output is correct
68 Correct 105 ms 47696 KB Output is correct
69 Correct 114 ms 47864 KB Output is correct
70 Correct 116 ms 49488 KB Output is correct
71 Correct 79 ms 48112 KB Output is correct
72 Correct 92 ms 49832 KB Output is correct
73 Correct 68 ms 48208 KB Output is correct
74 Correct 63 ms 47952 KB Output is correct
75 Correct 73 ms 48208 KB Output is correct
76 Correct 54 ms 47692 KB Output is correct
77 Correct 56 ms 47952 KB Output is correct
78 Correct 66 ms 48024 KB Output is correct
79 Correct 24 ms 44756 KB Output is correct
80 Correct 28 ms 44864 KB Output is correct
81 Correct 43 ms 47164 KB Output is correct
82 Correct 43 ms 46900 KB Output is correct
83 Correct 58 ms 47184 KB Output is correct
84 Correct 57 ms 47188 KB Output is correct
85 Correct 115 ms 49464 KB Output is correct
86 Correct 91 ms 49736 KB Output is correct
87 Correct 75 ms 47952 KB Output is correct
88 Correct 81 ms 49684 KB Output is correct
89 Correct 88 ms 45392 KB Output is correct
90 Correct 75 ms 49572 KB Output is correct
91 Correct 122 ms 49144 KB Output is correct
92 Correct 91 ms 47444 KB Output is correct
93 Correct 107 ms 49488 KB Output is correct
94 Correct 88 ms 47948 KB Output is correct
95 Correct 85 ms 49396 KB Output is correct
96 Correct 86 ms 49488 KB Output is correct
97 Correct 158 ms 49496 KB Output is correct
98 Correct 116 ms 49212 KB Output is correct
99 Correct 35 ms 46932 KB Output is correct
100 Correct 75 ms 48768 KB Output is correct
101 Correct 79 ms 49108 KB Output is correct
102 Execution timed out 1044 ms 49808 KB Time limit exceeded
103 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 43864 KB Output is correct
2 Correct 8 ms 43864 KB Output is correct
3 Correct 8 ms 43868 KB Output is correct
4 Correct 8 ms 43864 KB Output is correct
5 Correct 7 ms 43864 KB Output is correct
6 Correct 8 ms 43864 KB Output is correct
7 Correct 8 ms 42072 KB Output is correct
8 Correct 9 ms 43864 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 8 ms 41816 KB Output is correct
11 Correct 9 ms 41816 KB Output is correct
12 Correct 9 ms 41820 KB Output is correct
13 Correct 7 ms 43868 KB Output is correct
14 Correct 8 ms 43864 KB Output is correct
15 Correct 8 ms 43864 KB Output is correct
16 Correct 8 ms 43864 KB Output is correct
17 Correct 9 ms 41816 KB Output is correct
18 Correct 10 ms 43864 KB Output is correct
19 Correct 8 ms 43868 KB Output is correct
20 Correct 8 ms 41816 KB Output is correct
21 Correct 9 ms 43864 KB Output is correct
22 Correct 9 ms 43868 KB Output is correct
23 Correct 8 ms 43864 KB Output is correct
24 Correct 9 ms 43864 KB Output is correct
25 Correct 7 ms 43864 KB Output is correct
26 Correct 8 ms 43864 KB Output is correct
27 Correct 8 ms 41820 KB Output is correct
28 Correct 8 ms 41816 KB Output is correct
29 Correct 9 ms 41816 KB Output is correct
30 Correct 9 ms 43864 KB Output is correct
31 Correct 11 ms 43864 KB Output is correct
32 Correct 10 ms 43864 KB Output is correct
33 Correct 8 ms 43864 KB Output is correct
34 Correct 8 ms 43864 KB Output is correct
35 Correct 8 ms 41816 KB Output is correct
36 Correct 8 ms 43864 KB Output is correct
37 Correct 8 ms 41816 KB Output is correct
38 Correct 9 ms 41820 KB Output is correct
39 Correct 129 ms 48976 KB Output is correct
40 Correct 131 ms 49332 KB Output is correct
41 Correct 108 ms 48976 KB Output is correct
42 Correct 121 ms 48980 KB Output is correct
43 Correct 143 ms 49488 KB Output is correct
44 Correct 116 ms 49488 KB Output is correct
45 Correct 23 ms 46424 KB Output is correct
46 Correct 24 ms 46424 KB Output is correct
47 Correct 112 ms 47696 KB Output is correct
48 Correct 144 ms 49204 KB Output is correct
49 Correct 116 ms 49128 KB Output is correct
50 Correct 118 ms 49228 KB Output is correct
51 Correct 85 ms 47652 KB Output is correct
52 Correct 100 ms 49744 KB Output is correct
53 Correct 99 ms 49340 KB Output is correct
54 Correct 103 ms 48208 KB Output is correct
55 Correct 512 ms 55404 KB Output is correct
56 Correct 508 ms 54292 KB Output is correct
57 Correct 457 ms 55888 KB Output is correct
58 Correct 282 ms 55040 KB Output is correct
59 Correct 240 ms 54096 KB Output is correct
60 Correct 354 ms 56344 KB Output is correct
61 Correct 73 ms 48412 KB Output is correct
62 Correct 75 ms 46100 KB Output is correct
63 Correct 304 ms 57424 KB Output is correct
64 Correct 365 ms 57316 KB Output is correct
65 Correct 498 ms 55376 KB Output is correct
66 Correct 402 ms 55632 KB Output is correct
67 Correct 366 ms 55124 KB Output is correct
68 Correct 537 ms 55232 KB Output is correct
69 Correct 644 ms 55632 KB Output is correct
70 Correct 619 ms 55196 KB Output is correct
71 Correct 641 ms 55604 KB Output is correct
72 Correct 524 ms 55408 KB Output is correct
73 Correct 574 ms 55632 KB Output is correct
74 Correct 575 ms 55880 KB Output is correct
75 Correct 656 ms 56004 KB Output is correct
76 Correct 643 ms 55444 KB Output is correct
77 Correct 511 ms 55376 KB Output is correct
78 Correct 582 ms 55272 KB Output is correct
79 Correct 322 ms 51176 KB Output is correct
80 Correct 308 ms 53136 KB Output is correct
81 Execution timed out 1046 ms 54320 KB Time limit exceeded
82 Halted 0 ms 0 KB -