oj.uz

Submission #852618

# Submission time Handle Problem Language Result Execution time Memory
852618 2023-09-22T08:27:44 Z danikoynov Food Court (JOI21_foodcourt) C++14
42 / 100
 1000 ms 57688 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;
}

    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];
bit pass_tree;
int ans[maxn];


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

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


    for (int i = 1; i <= q; i ++)
    {
        cin >> t;
        if (t == 1)
        {
            cin >> l >> r >> c >> k;
            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;
            update(1, 1, n, l, r, -k);
            pass_tree.range_update(l, r, k);
            node cur;
            while(true)
            {
                cur = 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);
                update(1, 1, n, cur.min_lf, cur.min_rf, - cur.min_val);
            }
        }
        else
        {
            cin >> a >> b;
            query_cnt ++;
            if (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));
            }
        }
    }
}

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 10 ms 43864 KB Output is correct
3 Correct 7 ms 43864 KB Output is correct
4 Correct 8 ms 43864 KB Output is correct
5 Correct 7 ms 43864 KB Output is correct
6 Correct 7 ms 43864 KB Output is correct
7 Correct 8 ms 41820 KB Output is correct
8 Correct 11 ms 44124 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 8 ms 41816 KB Output is correct
11 Correct 8 ms 41816 KB Output is correct
12 Correct 8 ms 41816 KB Output is correct
13 Correct 9 ms 43864 KB Output is correct
14 Correct 7 ms 43864 KB Output is correct
15 Correct 7 ms 43864 KB Output is correct
16 Correct 8 ms 43868 KB Output is correct
17 Correct 8 ms 41816 KB Output is correct
18 Correct 11 ms 43864 KB Output is correct
19 Correct 8 ms 43864 KB Output is correct
20 Correct 8 ms 42016 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 10 ms 43864 KB Output is correct
3 Correct 7 ms 43864 KB Output is correct
4 Correct 8 ms 43864 KB Output is correct
5 Correct 7 ms 43864 KB Output is correct
6 Correct 7 ms 43864 KB Output is correct
7 Correct 8 ms 41820 KB Output is correct
8 Correct 11 ms 44124 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 8 ms 41816 KB Output is correct
11 Correct 8 ms 41816 KB Output is correct
12 Correct 8 ms 41816 KB Output is correct
13 Correct 9 ms 43864 KB Output is correct
14 Correct 7 ms 43864 KB Output is correct
15 Correct 7 ms 43864 KB Output is correct
16 Correct 8 ms 43868 KB Output is correct
17 Correct 8 ms 41816 KB Output is correct
18 Correct 11 ms 43864 KB Output is correct
19 Correct 8 ms 43864 KB Output is correct
20 Correct 8 ms 42016 KB Output is correct
21 Correct 11 ms 43864 KB Output is correct
22 Correct 11 ms 43872 KB Output is correct
23 Correct 8 ms 43864 KB Output is correct
24 Correct 8 ms 43864 KB Output is correct
25 Correct 7 ms 43864 KB Output is correct
26 Correct 7 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 8 ms 43868 KB Output is correct
31 Correct 11 ms 43864 KB Output is correct
32 Correct 10 ms 43864 KB Output is correct
33 Correct 7 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 9 ms 43864 KB Output is correct
37 Correct 8 ms 41816 KB Output is correct
38 Correct 9 ms 41816 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 49036 KB Output is correct
2 Correct 168 ms 49488 KB Output is correct
3 Correct 137 ms 49208 KB Output is correct
4 Correct 123 ms 49232 KB Output is correct
5 Correct 148 ms 49488 KB Output is correct
6 Correct 139 ms 49488 KB Output is correct
7 Correct 24 ms 46680 KB Output is correct
8 Correct 25 ms 46416 KB Output is correct
9 Correct 132 ms 47696 KB Output is correct
10 Correct 137 ms 49236 KB Output is correct
11 Correct 159 ms 49176 KB Output is correct
12 Correct 140 ms 49180 KB Output is correct
13 Correct 86 ms 47696 KB Output is correct
14 Correct 101 ms 49488 KB Output is correct
15 Correct 116 ms 49392 KB Output is correct
16 Correct 125 ms 48228 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 553 ms 55376 KB Output is correct
2 Correct 581 ms 54576 KB Output is correct
3 Correct 536 ms 55900 KB Output is correct
4 Correct 280 ms 55124 KB Output is correct
5 Correct 275 ms 54212 KB Output is correct
6 Correct 430 ms 56488 KB Output is correct
7 Correct 91 ms 48236 KB Output is correct
8 Correct 79 ms 46012 KB Output is correct
9 Correct 342 ms 57428 KB Output is correct
10 Correct 346 ms 57688 KB Output is correct
11 Correct 519 ms 55376 KB Output is correct
12 Correct 489 ms 55496 KB Output is correct
13 Correct 408 ms 55232 KB Output is correct
14 Correct 585 ms 55376 KB Output is correct
15 Correct 727 ms 55784 KB Output is correct
16 Correct 743 ms 55508 KB Output is correct
17 Correct 674 ms 55632 KB Output is correct
18 Correct 577 ms 55596 KB Output is correct
19 Correct 684 ms 55632 KB Output is correct
20 Correct 621 ms 55632 KB Output is correct
21 Correct 700 ms 55632 KB Output is correct
22 Correct 724 ms 55632 KB Output is correct
23 Correct 565 ms 55300 KB Output is correct
24 Correct 632 ms 55376 KB Output is correct
25 Correct 370 ms 50976 KB Output is correct
26 Correct 329 ms 53072 KB Output is correct
27 Execution timed out 1056 ms 54268 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 10 ms 43864 KB Output is correct
3 Correct 7 ms 43864 KB Output is correct
4 Correct 8 ms 43864 KB Output is correct
5 Correct 7 ms 43864 KB Output is correct
6 Correct 7 ms 43864 KB Output is correct
7 Correct 8 ms 41820 KB Output is correct
8 Correct 11 ms 44124 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 8 ms 41816 KB Output is correct
11 Correct 8 ms 41816 KB Output is correct
12 Correct 8 ms 41816 KB Output is correct
13 Correct 9 ms 43864 KB Output is correct
14 Correct 7 ms 43864 KB Output is correct
15 Correct 7 ms 43864 KB Output is correct
16 Correct 8 ms 43868 KB Output is correct
17 Correct 8 ms 41816 KB Output is correct
18 Correct 11 ms 43864 KB Output is correct
19 Correct 8 ms 43864 KB Output is correct
20 Correct 8 ms 42016 KB Output is correct
21 Correct 123 ms 49036 KB Output is correct
22 Correct 168 ms 49488 KB Output is correct
23 Correct 137 ms 49208 KB Output is correct
24 Correct 123 ms 49232 KB Output is correct
25 Correct 148 ms 49488 KB Output is correct
26 Correct 139 ms 49488 KB Output is correct
27 Correct 24 ms 46680 KB Output is correct
28 Correct 25 ms 46416 KB Output is correct
29 Correct 132 ms 47696 KB Output is correct
30 Correct 137 ms 49236 KB Output is correct
31 Correct 159 ms 49176 KB Output is correct
32 Correct 140 ms 49180 KB Output is correct
33 Correct 86 ms 47696 KB Output is correct
34 Correct 101 ms 49488 KB Output is correct
35 Correct 116 ms 49392 KB Output is correct
36 Correct 125 ms 48228 KB Output is correct
37 Correct 87 ms 49488 KB Output is correct
38 Correct 60 ms 49488 KB Output is correct
39 Correct 23 ms 46552 KB Output is correct
40 Correct 24 ms 46672 KB Output is correct
41 Correct 89 ms 45904 KB Output is correct
42 Correct 96 ms 49488 KB Output is correct
43 Correct 105 ms 49636 KB Output is correct
44 Correct 107 ms 49508 KB Output is correct
45 Correct 85 ms 48112 KB Output is correct
46 Correct 116 ms 49784 KB Output is correct
47 Correct 32 ms 48924 KB Output is correct
48 Correct 76 ms 48976 KB Output is correct
49 Correct 101 ms 48976 KB Output is correct
50 Correct 110 ms 47696 KB Output is correct
51 Correct 133 ms 47992 KB Output is correct
52 Correct 133 ms 49388 KB Output is correct
53 Correct 82 ms 47956 KB Output is correct
54 Correct 100 ms 49744 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 47900 KB Output is correct
2 Correct 65 ms 47952 KB Output is correct
3 Correct 68 ms 48028 KB Output is correct
4 Correct 46 ms 47696 KB Output is correct
5 Correct 64 ms 47768 KB Output is correct
6 Correct 63 ms 48204 KB Output is correct
7 Correct 24 ms 44864 KB Output is correct
8 Correct 24 ms 44856 KB Output is correct
9 Correct 40 ms 47184 KB Output is correct
10 Correct 41 ms 46928 KB Output is correct
11 Correct 63 ms 47516 KB Output is correct
12 Correct 60 ms 47208 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 10 ms 43864 KB Output is correct
3 Correct 7 ms 43864 KB Output is correct
4 Correct 8 ms 43864 KB Output is correct
5 Correct 7 ms 43864 KB Output is correct
6 Correct 7 ms 43864 KB Output is correct
7 Correct 8 ms 41820 KB Output is correct
8 Correct 11 ms 44124 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 8 ms 41816 KB Output is correct
11 Correct 8 ms 41816 KB Output is correct
12 Correct 8 ms 41816 KB Output is correct
13 Correct 9 ms 43864 KB Output is correct
14 Correct 7 ms 43864 KB Output is correct
15 Correct 7 ms 43864 KB Output is correct
16 Correct 8 ms 43868 KB Output is correct
17 Correct 8 ms 41816 KB Output is correct
18 Correct 11 ms 43864 KB Output is correct
19 Correct 8 ms 43864 KB Output is correct
20 Correct 8 ms 42016 KB Output is correct
21 Correct 11 ms 43864 KB Output is correct
22 Correct 11 ms 43872 KB Output is correct
23 Correct 8 ms 43864 KB Output is correct
24 Correct 8 ms 43864 KB Output is correct
25 Correct 7 ms 43864 KB Output is correct
26 Correct 7 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 8 ms 43868 KB Output is correct
31 Correct 11 ms 43864 KB Output is correct
32 Correct 10 ms 43864 KB Output is correct
33 Correct 7 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 9 ms 43864 KB Output is correct
37 Correct 8 ms 41816 KB Output is correct
38 Correct 9 ms 41816 KB Output is correct
39 Correct 123 ms 49036 KB Output is correct
40 Correct 168 ms 49488 KB Output is correct
41 Correct 137 ms 49208 KB Output is correct
42 Correct 123 ms 49232 KB Output is correct
43 Correct 148 ms 49488 KB Output is correct
44 Correct 139 ms 49488 KB Output is correct
45 Correct 24 ms 46680 KB Output is correct
46 Correct 25 ms 46416 KB Output is correct
47 Correct 132 ms 47696 KB Output is correct
48 Correct 137 ms 49236 KB Output is correct
49 Correct 159 ms 49176 KB Output is correct
50 Correct 140 ms 49180 KB Output is correct
51 Correct 86 ms 47696 KB Output is correct
52 Correct 101 ms 49488 KB Output is correct
53 Correct 116 ms 49392 KB Output is correct
54 Correct 125 ms 48228 KB Output is correct
55 Correct 87 ms 49488 KB Output is correct
56 Correct 60 ms 49488 KB Output is correct
57 Correct 23 ms 46552 KB Output is correct
58 Correct 24 ms 46672 KB Output is correct
59 Correct 89 ms 45904 KB Output is correct
60 Correct 96 ms 49488 KB Output is correct
61 Correct 105 ms 49636 KB Output is correct
62 Correct 107 ms 49508 KB Output is correct
63 Correct 85 ms 48112 KB Output is correct
64 Correct 116 ms 49784 KB Output is correct
65 Correct 32 ms 48924 KB Output is correct
66 Correct 76 ms 48976 KB Output is correct
67 Correct 101 ms 48976 KB Output is correct
68 Correct 110 ms 47696 KB Output is correct
69 Correct 133 ms 47992 KB Output is correct
70 Correct 133 ms 49388 KB Output is correct
71 Correct 82 ms 47956 KB Output is correct
72 Correct 100 ms 49744 KB Output is correct
73 Correct 58 ms 47900 KB Output is correct
74 Correct 65 ms 47952 KB Output is correct
75 Correct 68 ms 48028 KB Output is correct
76 Correct 46 ms 47696 KB Output is correct
77 Correct 64 ms 47768 KB Output is correct
78 Correct 63 ms 48204 KB Output is correct
79 Correct 24 ms 44864 KB Output is correct
80 Correct 24 ms 44856 KB Output is correct
81 Correct 40 ms 47184 KB Output is correct
82 Correct 41 ms 46928 KB Output is correct
83 Correct 63 ms 47516 KB Output is correct
84 Correct 60 ms 47208 KB Output is correct
85 Correct 130 ms 49488 KB Output is correct
86 Correct 98 ms 49620 KB Output is correct
87 Correct 77 ms 48204 KB Output is correct
88 Correct 85 ms 49744 KB Output is correct
89 Correct 102 ms 45392 KB Output is correct
90 Correct 89 ms 49492 KB Output is correct
91 Correct 112 ms 49232 KB Output is correct
92 Correct 102 ms 47440 KB Output is correct
93 Correct 116 ms 49488 KB Output is correct
94 Correct 91 ms 47952 KB Output is correct
95 Correct 92 ms 49580 KB Output is correct
96 Correct 104 ms 49744 KB Output is correct
97 Correct 165 ms 49560 KB Output is correct
98 Correct 110 ms 49228 KB Output is correct
99 Correct 34 ms 46928 KB Output is correct
100 Correct 77 ms 48724 KB Output is correct
101 Correct 96 ms 48896 KB Output is correct
102 Execution timed out 1039 ms 50112 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 10 ms 43864 KB Output is correct
3 Correct 7 ms 43864 KB Output is correct
4 Correct 8 ms 43864 KB Output is correct
5 Correct 7 ms 43864 KB Output is correct
6 Correct 7 ms 43864 KB Output is correct
7 Correct 8 ms 41820 KB Output is correct
8 Correct 11 ms 44124 KB Output is correct
9 Correct 9 ms 43864 KB Output is correct
10 Correct 8 ms 41816 KB Output is correct
11 Correct 8 ms 41816 KB Output is correct
12 Correct 8 ms 41816 KB Output is correct
13 Correct 9 ms 43864 KB Output is correct
14 Correct 7 ms 43864 KB Output is correct
15 Correct 7 ms 43864 KB Output is correct
16 Correct 8 ms 43868 KB Output is correct
17 Correct 8 ms 41816 KB Output is correct
18 Correct 11 ms 43864 KB Output is correct
19 Correct 8 ms 43864 KB Output is correct
20 Correct 8 ms 42016 KB Output is correct
21 Correct 11 ms 43864 KB Output is correct
22 Correct 11 ms 43872 KB Output is correct
23 Correct 8 ms 43864 KB Output is correct
24 Correct 8 ms 43864 KB Output is correct
25 Correct 7 ms 43864 KB Output is correct
26 Correct 7 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 8 ms 43868 KB Output is correct
31 Correct 11 ms 43864 KB Output is correct
32 Correct 10 ms 43864 KB Output is correct
33 Correct 7 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 9 ms 43864 KB Output is correct
37 Correct 8 ms 41816 KB Output is correct
38 Correct 9 ms 41816 KB Output is correct
39 Correct 123 ms 49036 KB Output is correct
40 Correct 168 ms 49488 KB Output is correct
41 Correct 137 ms 49208 KB Output is correct
42 Correct 123 ms 49232 KB Output is correct
43 Correct 148 ms 49488 KB Output is correct
44 Correct 139 ms 49488 KB Output is correct
45 Correct 24 ms 46680 KB Output is correct
46 Correct 25 ms 46416 KB Output is correct
47 Correct 132 ms 47696 KB Output is correct
48 Correct 137 ms 49236 KB Output is correct
49 Correct 159 ms 49176 KB Output is correct
50 Correct 140 ms 49180 KB Output is correct
51 Correct 86 ms 47696 KB Output is correct
52 Correct 101 ms 49488 KB Output is correct
53 Correct 116 ms 49392 KB Output is correct
54 Correct 125 ms 48228 KB Output is correct
55 Correct 553 ms 55376 KB Output is correct
56 Correct 581 ms 54576 KB Output is correct
57 Correct 536 ms 55900 KB Output is correct
58 Correct 280 ms 55124 KB Output is correct
59 Correct 275 ms 54212 KB Output is correct
60 Correct 430 ms 56488 KB Output is correct
61 Correct 91 ms 48236 KB Output is correct
62 Correct 79 ms 46012 KB Output is correct
63 Correct 342 ms 57428 KB Output is correct
64 Correct 346 ms 57688 KB Output is correct
65 Correct 519 ms 55376 KB Output is correct
66 Correct 489 ms 55496 KB Output is correct
67 Correct 408 ms 55232 KB Output is correct
68 Correct 585 ms 55376 KB Output is correct
69 Correct 727 ms 55784 KB Output is correct
70 Correct 743 ms 55508 KB Output is correct
71 Correct 674 ms 55632 KB Output is correct
72 Correct 577 ms 55596 KB Output is correct
73 Correct 684 ms 55632 KB Output is correct
74 Correct 621 ms 55632 KB Output is correct
75 Correct 700 ms 55632 KB Output is correct
76 Correct 724 ms 55632 KB Output is correct
77 Correct 565 ms 55300 KB Output is correct
78 Correct 632 ms 55376 KB Output is correct
79 Correct 370 ms 50976 KB Output is correct
80 Correct 329 ms 53072 KB Output is correct
81 Execution timed out 1056 ms 54268 KB Time limit exceeded
82 Halted 0 ms 0 KB -