oj.uz

Submission #852622

# Submission time Handle Problem Language Result Execution time Memory
852622 2023-09-22T08:31:58 Z danikoynov Food Court (JOI21_foodcourt) C++14
42 / 100
 1000 ms 52304 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;
    int min_lf, min_rf;

    node(ll  _min_val = inf, int _min_lf = -1, int _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];
    int tag[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];
            tag[root * 2] = tag[root * 2 + 1] = 1;
        }
        tag[root] = 0;
        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)
    {
        if (tag[root])
        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)
    {
        if (tag[root])
        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 35928 KB Output is correct
2 Correct 8 ms 35928 KB Output is correct
3 Correct 7 ms 35928 KB Output is correct
4 Correct 8 ms 35932 KB Output is correct
5 Correct 8 ms 35928 KB Output is correct
6 Correct 6 ms 35928 KB Output is correct
7 Correct 7 ms 33880 KB Output is correct
8 Correct 8 ms 35932 KB Output is correct
9 Correct 9 ms 35928 KB Output is correct
10 Correct 8 ms 33880 KB Output is correct
11 Correct 8 ms 33880 KB Output is correct
12 Correct 8 ms 33880 KB Output is correct
13 Correct 6 ms 35928 KB Output is correct
14 Correct 7 ms 35928 KB Output is correct
15 Correct 7 ms 35928 KB Output is correct
16 Correct 8 ms 35928 KB Output is correct
17 Correct 8 ms 33880 KB Output is correct
18 Correct 8 ms 35932 KB Output is correct
19 Correct 8 ms 35928 KB Output is correct
20 Correct 7 ms 33884 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 41700 KB Output is correct
2 Correct 131 ms 42056 KB Output is correct
3 Correct 106 ms 41552 KB Output is correct
4 Correct 107 ms 41552 KB Output is correct
5 Correct 118 ms 41808 KB Output is correct
6 Correct 118 ms 41808 KB Output is correct
7 Correct 22 ms 38488 KB Output is correct
8 Correct 24 ms 38488 KB Output is correct
9 Correct 102 ms 40016 KB Output is correct
10 Correct 112 ms 41552 KB Output is correct
11 Correct 114 ms 41768 KB Output is correct
12 Correct 113 ms 41552 KB Output is correct
13 Correct 78 ms 40024 KB Output is correct
14 Correct 92 ms 42012 KB Output is correct
15 Correct 102 ms 41860 KB Output is correct
16 Correct 113 ms 41036 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 515 ms 49488 KB Output is correct
2 Correct 486 ms 48464 KB Output is correct
3 Correct 489 ms 49896 KB Output is correct
4 Correct 289 ms 49140 KB Output is correct
5 Correct 268 ms 49232 KB Output is correct
6 Correct 360 ms 51280 KB Output is correct
7 Correct 71 ms 40260 KB Output is correct
8 Correct 74 ms 38048 KB Output is correct
9 Correct 347 ms 51460 KB Output is correct
10 Correct 324 ms 52304 KB Output is correct
11 Correct 484 ms 49232 KB Output is correct
12 Correct 435 ms 49556 KB Output is correct
13 Correct 388 ms 49272 KB Output is correct
14 Correct 524 ms 49488 KB Output is correct
15 Correct 595 ms 49744 KB Output is correct
16 Correct 614 ms 49232 KB Output is correct
17 Correct 602 ms 50512 KB Output is correct
18 Correct 511 ms 49696 KB Output is correct
19 Correct 562 ms 49636 KB Output is correct
20 Correct 554 ms 49652 KB Output is correct
21 Correct 635 ms 49508 KB Output is correct
22 Correct 619 ms 50652 KB Output is correct
23 Correct 523 ms 49344 KB Output is correct
24 Correct 612 ms 49440 KB Output is correct
25 Correct 338 ms 45164 KB Output is correct
26 Correct 336 ms 47232 KB Output is correct
27 Execution timed out 1030 ms 49232 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 35928 KB Output is correct
2 Correct 8 ms 35928 KB Output is correct
3 Correct 7 ms 35928 KB Output is correct
4 Correct 8 ms 35932 KB Output is correct
5 Correct 8 ms 35928 KB Output is correct
6 Correct 6 ms 35928 KB Output is correct
7 Correct 7 ms 33880 KB Output is correct
8 Correct 8 ms 35932 KB Output is correct
9 Correct 9 ms 35928 KB Output is correct
10 Correct 8 ms 33880 KB Output is correct
11 Correct 8 ms 33880 KB Output is correct
12 Correct 8 ms 33880 KB Output is correct
13 Correct 6 ms 35928 KB Output is correct
14 Correct 7 ms 35928 KB Output is correct
15 Correct 7 ms 35928 KB Output is correct
16 Correct 8 ms 35928 KB Output is correct
17 Correct 8 ms 33880 KB Output is correct
18 Correct 8 ms 35932 KB Output is correct
19 Correct 8 ms 35928 KB Output is correct
20 Correct 7 ms 33884 KB Output is correct
21 Correct 118 ms 41700 KB Output is correct
22 Correct 131 ms 42056 KB Output is correct
23 Correct 106 ms 41552 KB Output is correct
24 Correct 107 ms 41552 KB Output is correct
25 Correct 118 ms 41808 KB Output is correct
26 Correct 118 ms 41808 KB Output is correct
27 Correct 22 ms 38488 KB Output is correct
28 Correct 24 ms 38488 KB Output is correct
29 Correct 102 ms 40016 KB Output is correct
30 Correct 112 ms 41552 KB Output is correct
31 Correct 114 ms 41768 KB Output is correct
32 Correct 113 ms 41552 KB Output is correct
33 Correct 78 ms 40024 KB Output is correct
34 Correct 92 ms 42012 KB Output is correct
35 Correct 102 ms 41860 KB Output is correct
36 Correct 113 ms 41036 KB Output is correct
37 Correct 78 ms 41960 KB Output is correct
38 Correct 70 ms 42092 KB Output is correct
39 Correct 18 ms 38616 KB Output is correct
40 Correct 22 ms 38860 KB Output is correct
41 Correct 81 ms 38480 KB Output is correct
42 Correct 94 ms 42064 KB Output is correct
43 Correct 97 ms 42068 KB Output is correct
44 Correct 96 ms 42320 KB Output is correct
45 Correct 82 ms 40480 KB Output is correct
46 Correct 97 ms 42064 KB Output is correct
47 Correct 32 ms 41296 KB Output is correct
48 Correct 73 ms 41432 KB Output is correct
49 Correct 84 ms 41552 KB Output is correct
50 Correct 119 ms 40296 KB Output is correct
51 Correct 124 ms 40528 KB Output is correct
52 Correct 116 ms 42080 KB Output is correct
53 Correct 71 ms 40272 KB Output is correct
54 Correct 90 ms 42320 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 40528 KB Output is correct
2 Correct 64 ms 40528 KB Output is correct
3 Correct 65 ms 40728 KB Output is correct
4 Correct 48 ms 40028 KB Output is correct
5 Correct 58 ms 40412 KB Output is correct
6 Correct 66 ms 40532 KB Output is correct
7 Correct 23 ms 36708 KB Output is correct
8 Correct 23 ms 36924 KB Output is correct
9 Correct 47 ms 39728 KB Output is correct
10 Correct 41 ms 39504 KB Output is correct
11 Correct 57 ms 39760 KB Output is correct
12 Correct 59 ms 39760 KB Output is correct

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 35928 KB Output is correct
2 Correct 8 ms 35928 KB Output is correct
3 Correct 7 ms 35928 KB Output is correct
4 Correct 8 ms 35932 KB Output is correct
5 Correct 8 ms 35928 KB Output is correct
6 Correct 6 ms 35928 KB Output is correct
7 Correct 7 ms 33880 KB Output is correct
8 Correct 8 ms 35932 KB Output is correct
9 Correct 9 ms 35928 KB Output is correct
10 Correct 8 ms 33880 KB Output is correct
11 Correct 8 ms 33880 KB Output is correct
12 Correct 8 ms 33880 KB Output is correct
13 Correct 6 ms 35928 KB Output is correct
14 Correct 7 ms 35928 KB Output is correct
15 Correct 7 ms 35928 KB Output is correct
16 Correct 8 ms 35928 KB Output is correct
17 Correct 8 ms 33880 KB Output is correct
18 Correct 8 ms 35932 KB Output is correct
19 Correct 8 ms 35928 KB Output is correct
20 Correct 7 ms 33884 KB Output is correct
21 Correct 8 ms 36184 KB Output is correct
22 Correct 8 ms 35928 KB Output is correct
23 Correct 8 ms 35928 KB Output is correct
24 Correct 8 ms 35928 KB Output is correct
25 Correct 6 ms 35928 KB Output is correct
26 Correct 7 ms 35928 KB Output is correct
27 Correct 10 ms 34292 KB Output is correct
28 Correct 8 ms 33880 KB Output is correct
29 Correct 8 ms 33880 KB Output is correct
30 Correct 8 ms 35932 KB Output is correct
31 Correct 9 ms 35928 KB Output is correct
32 Correct 9 ms 35928 KB Output is correct
33 Correct 7 ms 35928 KB Output is correct
34 Correct 7 ms 35928 KB Output is correct
35 Correct 7 ms 33880 KB Output is correct
36 Correct 8 ms 35928 KB Output is correct
37 Correct 7 ms 33880 KB Output is correct
38 Correct 8 ms 33880 KB Output is correct
39 Correct 118 ms 41700 KB Output is correct
40 Correct 131 ms 42056 KB Output is correct
41 Correct 106 ms 41552 KB Output is correct
42 Correct 107 ms 41552 KB Output is correct
43 Correct 118 ms 41808 KB Output is correct
44 Correct 118 ms 41808 KB Output is correct
45 Correct 22 ms 38488 KB Output is correct
46 Correct 24 ms 38488 KB Output is correct
47 Correct 102 ms 40016 KB Output is correct
48 Correct 112 ms 41552 KB Output is correct
49 Correct 114 ms 41768 KB Output is correct
50 Correct 113 ms 41552 KB Output is correct
51 Correct 78 ms 40024 KB Output is correct
52 Correct 92 ms 42012 KB Output is correct
53 Correct 102 ms 41860 KB Output is correct
54 Correct 113 ms 41036 KB Output is correct
55 Correct 78 ms 41960 KB Output is correct
56 Correct 70 ms 42092 KB Output is correct
57 Correct 18 ms 38616 KB Output is correct
58 Correct 22 ms 38860 KB Output is correct
59 Correct 81 ms 38480 KB Output is correct
60 Correct 94 ms 42064 KB Output is correct
61 Correct 97 ms 42068 KB Output is correct
62 Correct 96 ms 42320 KB Output is correct
63 Correct 82 ms 40480 KB Output is correct
64 Correct 97 ms 42064 KB Output is correct
65 Correct 32 ms 41296 KB Output is correct
66 Correct 73 ms 41432 KB Output is correct
67 Correct 84 ms 41552 KB Output is correct
68 Correct 119 ms 40296 KB Output is correct
69 Correct 124 ms 40528 KB Output is correct
70 Correct 116 ms 42080 KB Output is correct
71 Correct 71 ms 40272 KB Output is correct
72 Correct 90 ms 42320 KB Output is correct
73 Correct 69 ms 40528 KB Output is correct
74 Correct 64 ms 40528 KB Output is correct
75 Correct 65 ms 40728 KB Output is correct
76 Correct 48 ms 40028 KB Output is correct
77 Correct 58 ms 40412 KB Output is correct
78 Correct 66 ms 40532 KB Output is correct
79 Correct 23 ms 36708 KB Output is correct
80 Correct 23 ms 36924 KB Output is correct
81 Correct 47 ms 39728 KB Output is correct
82 Correct 41 ms 39504 KB Output is correct
83 Correct 57 ms 39760 KB Output is correct
84 Correct 59 ms 39760 KB Output is correct
85 Correct 107 ms 41928 KB Output is correct
86 Correct 93 ms 42320 KB Output is correct
87 Correct 67 ms 40528 KB Output is correct
88 Correct 76 ms 42320 KB Output is correct
89 Correct 81 ms 37968 KB Output is correct
90 Correct 81 ms 42056 KB Output is correct
91 Correct 96 ms 41600 KB Output is correct
92 Correct 95 ms 40204 KB Output is correct
93 Correct 109 ms 42132 KB Output is correct
94 Correct 83 ms 40528 KB Output is correct
95 Correct 92 ms 42052 KB Output is correct
96 Correct 96 ms 42064 KB Output is correct
97 Correct 147 ms 42064 KB Output is correct
98 Correct 98 ms 42060 KB Output is correct
99 Correct 37 ms 39212 KB Output is correct
100 Correct 65 ms 41296 KB Output is correct
101 Correct 82 ms 41360 KB Output is correct
102 Execution timed out 1027 ms 42360 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 35928 KB Output is correct
2 Correct 8 ms 35928 KB Output is correct
3 Correct 7 ms 35928 KB Output is correct
4 Correct 8 ms 35932 KB Output is correct
5 Correct 8 ms 35928 KB Output is correct
6 Correct 6 ms 35928 KB Output is correct
7 Correct 7 ms 33880 KB Output is correct
8 Correct 8 ms 35932 KB Output is correct
9 Correct 9 ms 35928 KB Output is correct
10 Correct 8 ms 33880 KB Output is correct
11 Correct 8 ms 33880 KB Output is correct
12 Correct 8 ms 33880 KB Output is correct
13 Correct 6 ms 35928 KB Output is correct
14 Correct 7 ms 35928 KB Output is correct
15 Correct 7 ms 35928 KB Output is correct
16 Correct 8 ms 35928 KB Output is correct
17 Correct 8 ms 33880 KB Output is correct
18 Correct 8 ms 35932 KB Output is correct
19 Correct 8 ms 35928 KB Output is correct
20 Correct 7 ms 33884 KB Output is correct
21 Correct 8 ms 36184 KB Output is correct
22 Correct 8 ms 35928 KB Output is correct
23 Correct 8 ms 35928 KB Output is correct
24 Correct 8 ms 35928 KB Output is correct
25 Correct 6 ms 35928 KB Output is correct
26 Correct 7 ms 35928 KB Output is correct
27 Correct 10 ms 34292 KB Output is correct
28 Correct 8 ms 33880 KB Output is correct
29 Correct 8 ms 33880 KB Output is correct
30 Correct 8 ms 35932 KB Output is correct
31 Correct 9 ms 35928 KB Output is correct
32 Correct 9 ms 35928 KB Output is correct
33 Correct 7 ms 35928 KB Output is correct
34 Correct 7 ms 35928 KB Output is correct
35 Correct 7 ms 33880 KB Output is correct
36 Correct 8 ms 35928 KB Output is correct
37 Correct 7 ms 33880 KB Output is correct
38 Correct 8 ms 33880 KB Output is correct
39 Correct 118 ms 41700 KB Output is correct
40 Correct 131 ms 42056 KB Output is correct
41 Correct 106 ms 41552 KB Output is correct
42 Correct 107 ms 41552 KB Output is correct
43 Correct 118 ms 41808 KB Output is correct
44 Correct 118 ms 41808 KB Output is correct
45 Correct 22 ms 38488 KB Output is correct
46 Correct 24 ms 38488 KB Output is correct
47 Correct 102 ms 40016 KB Output is correct
48 Correct 112 ms 41552 KB Output is correct
49 Correct 114 ms 41768 KB Output is correct
50 Correct 113 ms 41552 KB Output is correct
51 Correct 78 ms 40024 KB Output is correct
52 Correct 92 ms 42012 KB Output is correct
53 Correct 102 ms 41860 KB Output is correct
54 Correct 113 ms 41036 KB Output is correct
55 Correct 515 ms 49488 KB Output is correct
56 Correct 486 ms 48464 KB Output is correct
57 Correct 489 ms 49896 KB Output is correct
58 Correct 289 ms 49140 KB Output is correct
59 Correct 268 ms 49232 KB Output is correct
60 Correct 360 ms 51280 KB Output is correct
61 Correct 71 ms 40260 KB Output is correct
62 Correct 74 ms 38048 KB Output is correct
63 Correct 347 ms 51460 KB Output is correct
64 Correct 324 ms 52304 KB Output is correct
65 Correct 484 ms 49232 KB Output is correct
66 Correct 435 ms 49556 KB Output is correct
67 Correct 388 ms 49272 KB Output is correct
68 Correct 524 ms 49488 KB Output is correct
69 Correct 595 ms 49744 KB Output is correct
70 Correct 614 ms 49232 KB Output is correct
71 Correct 602 ms 50512 KB Output is correct
72 Correct 511 ms 49696 KB Output is correct
73 Correct 562 ms 49636 KB Output is correct
74 Correct 554 ms 49652 KB Output is correct
75 Correct 635 ms 49508 KB Output is correct
76 Correct 619 ms 50652 KB Output is correct
77 Correct 523 ms 49344 KB Output is correct
78 Correct 612 ms 49440 KB Output is correct
79 Correct 338 ms 45164 KB Output is correct
80 Correct 336 ms 47232 KB Output is correct
81 Execution timed out 1030 ms 49232 KB Time limit exceeded
82 Halted 0 ms 0 KB -