답안 #852616

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
852616	2023-09-22T08:23:33 Z	danikoynov	푸드 코트 (JOI21_foodcourt)	C++14	42 / 100	1000 ms	63972 KB

foodcourt

/**
 ____ ____ ____ ____ ____ ____
||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 ll 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(ll root, ll left, ll 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(ll root, ll left, ll right)
    {
        if (left == right)
        {
            tree[root].min_lf = left;
            tree[root].min_rf = right;
            tree[root].min_val = 0;
            return;
        }

        ll 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(ll root, ll left, ll right, ll qleft, ll 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;
        }

        ll 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(ll root, ll left, ll right, ll qleft, ll qright)
    {
        push_lazy(root, left, right);
        if (left > qright || right < qleft)
            return node();
        if (left >= qleft && right <= qright)
            return tree[root];

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

};



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

struct task
{
    ll idx, pos;

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

        pos = _pos;
    }
};

struct bit
{
    ll fen[maxn];

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

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

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

    ll find_kth(ll to)
    {
        ll pos = 0;
        ll sum = 0;
        for (ll 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;
ll ans[maxn];


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

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


    for (ll 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);
            }
        }
        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));
            }
        }
    }
}

bit active;
void answer_tasks()
{
    for (ll i = 1; i <= n; i ++)
    {
        for (ll 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 (ll 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

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	46940 KB	Output is correct
2	Correct	9 ms	46940 KB	Output is correct
3	Correct	9 ms	46916 KB	Output is correct
4	Correct	9 ms	46936 KB	Output is correct
5	Correct	8 ms	44892 KB	Output is correct
6	Correct	9 ms	44888 KB	Output is correct
7	Correct	9 ms	44892 KB	Output is correct
8	Correct	9 ms	46936 KB	Output is correct
9	Correct	9 ms	46940 KB	Output is correct
10	Correct	9 ms	44892 KB	Output is correct
11	Correct	9 ms	44892 KB	Output is correct
12	Correct	10 ms	44888 KB	Output is correct
13	Correct	8 ms	46940 KB	Output is correct
14	Correct	8 ms	46936 KB	Output is correct
15	Correct	8 ms	46940 KB	Output is correct
16	Correct	10 ms	46936 KB	Output is correct
17	Correct	9 ms	44892 KB	Output is correct
18	Correct	10 ms	46936 KB	Output is correct
19	Correct	9 ms	46940 KB	Output is correct
20	Correct	11 ms	44892 KB	Output is correct

Subtask #2
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	46940 KB	Output is correct
2	Correct	9 ms	46940 KB	Output is correct
3	Correct	9 ms	46916 KB	Output is correct
4	Correct	9 ms	46936 KB	Output is correct
5	Correct	8 ms	44892 KB	Output is correct
6	Correct	9 ms	44888 KB	Output is correct
7	Correct	9 ms	44892 KB	Output is correct
8	Correct	9 ms	46936 KB	Output is correct
9	Correct	9 ms	46940 KB	Output is correct
10	Correct	9 ms	44892 KB	Output is correct
11	Correct	9 ms	44892 KB	Output is correct
12	Correct	10 ms	44888 KB	Output is correct
13	Correct	8 ms	46940 KB	Output is correct
14	Correct	8 ms	46936 KB	Output is correct
15	Correct	8 ms	46940 KB	Output is correct
16	Correct	10 ms	46936 KB	Output is correct
17	Correct	9 ms	44892 KB	Output is correct
18	Correct	10 ms	46936 KB	Output is correct
19	Correct	9 ms	46940 KB	Output is correct
20	Correct	11 ms	44892 KB	Output is correct
21	Correct	12 ms	46940 KB	Output is correct
22	Correct	10 ms	46940 KB	Output is correct
23	Correct	9 ms	46936 KB	Output is correct
24	Correct	9 ms	46940 KB	Output is correct
25	Correct	9 ms	44892 KB	Output is correct
26	Correct	8 ms	44888 KB	Output is correct
27	Correct	10 ms	44936 KB	Output is correct
28	Correct	9 ms	45080 KB	Output is correct
29	Correct	10 ms	44892 KB	Output is correct
30	Correct	9 ms	47036 KB	Output is correct
31	Correct	10 ms	46980 KB	Output is correct
32	Correct	11 ms	47196 KB	Output is correct
33	Correct	8 ms	47080 KB	Output is correct
34	Correct	8 ms	46940 KB	Output is correct
35	Correct	10 ms	44888 KB	Output is correct
36	Correct	12 ms	46936 KB	Output is correct
37	Correct	9 ms	44888 KB	Output is correct
38	Correct	9 ms	44888 KB	Output is correct

Subtask #3
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	113 ms	49988 KB	Output is correct
2	Correct	117 ms	50512 KB	Output is correct
3	Correct	107 ms	50000 KB	Output is correct
4	Correct	109 ms	50144 KB	Output is correct
5	Correct	119 ms	50512 KB	Output is correct
6	Correct	122 ms	50532 KB	Output is correct
7	Correct	22 ms	47816 KB	Output is correct
8	Correct	26 ms	47944 KB	Output is correct
9	Correct	108 ms	48720 KB	Output is correct
10	Correct	119 ms	50084 KB	Output is correct
11	Correct	118 ms	50212 KB	Output is correct
12	Correct	125 ms	50520 KB	Output is correct
13	Correct	76 ms	48720 KB	Output is correct
14	Correct	96 ms	50768 KB	Output is correct
15	Correct	110 ms	51124 KB	Output is correct
16	Correct	108 ms	49488 KB	Output is correct

Subtask #4
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	478 ms	56324 KB	Output is correct
2	Correct	484 ms	59700 KB	Output is correct
3	Correct	484 ms	63000 KB	Output is correct
4	Correct	253 ms	60752 KB	Output is correct
5	Correct	266 ms	59384 KB	Output is correct
6	Correct	355 ms	63824 KB	Output is correct
7	Correct	84 ms	53680 KB	Output is correct
8	Correct	95 ms	51868 KB	Output is correct
9	Correct	318 ms	63884 KB	Output is correct
10	Correct	318 ms	63972 KB	Output is correct
11	Correct	459 ms	61524 KB	Output is correct
12	Correct	454 ms	62716 KB	Output is correct
13	Correct	381 ms	61520 KB	Output is correct
14	Correct	522 ms	62772 KB	Output is correct
15	Correct	612 ms	62892 KB	Output is correct
16	Correct	653 ms	61700 KB	Output is correct
17	Correct	606 ms	62656 KB	Output is correct
18	Correct	519 ms	62896 KB	Output is correct
19	Correct	539 ms	62692 KB	Output is correct
20	Correct	542 ms	62800 KB	Output is correct
21	Correct	648 ms	62744 KB	Output is correct
22	Correct	577 ms	62800 KB	Output is correct
23	Correct	493 ms	61540 KB	Output is correct
24	Correct	564 ms	61448 KB	Output is correct
25	Correct	325 ms	58604 KB	Output is correct
26	Correct	313 ms	60872 KB	Output is correct
27	Execution timed out	1028 ms	58236 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-

Subtask #5
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	46940 KB	Output is correct
2	Correct	9 ms	46940 KB	Output is correct
3	Correct	9 ms	46916 KB	Output is correct
4	Correct	9 ms	46936 KB	Output is correct
5	Correct	8 ms	44892 KB	Output is correct
6	Correct	9 ms	44888 KB	Output is correct
7	Correct	9 ms	44892 KB	Output is correct
8	Correct	9 ms	46936 KB	Output is correct
9	Correct	9 ms	46940 KB	Output is correct
10	Correct	9 ms	44892 KB	Output is correct
11	Correct	9 ms	44892 KB	Output is correct
12	Correct	10 ms	44888 KB	Output is correct
13	Correct	8 ms	46940 KB	Output is correct
14	Correct	8 ms	46936 KB	Output is correct
15	Correct	8 ms	46940 KB	Output is correct
16	Correct	10 ms	46936 KB	Output is correct
17	Correct	9 ms	44892 KB	Output is correct
18	Correct	10 ms	46936 KB	Output is correct
19	Correct	9 ms	46940 KB	Output is correct
20	Correct	11 ms	44892 KB	Output is correct
21	Correct	113 ms	49988 KB	Output is correct
22	Correct	117 ms	50512 KB	Output is correct
23	Correct	107 ms	50000 KB	Output is correct
24	Correct	109 ms	50144 KB	Output is correct
25	Correct	119 ms	50512 KB	Output is correct
26	Correct	122 ms	50532 KB	Output is correct
27	Correct	22 ms	47816 KB	Output is correct
28	Correct	26 ms	47944 KB	Output is correct
29	Correct	108 ms	48720 KB	Output is correct
30	Correct	119 ms	50084 KB	Output is correct
31	Correct	118 ms	50212 KB	Output is correct
32	Correct	125 ms	50520 KB	Output is correct
33	Correct	76 ms	48720 KB	Output is correct
34	Correct	96 ms	50768 KB	Output is correct
35	Correct	110 ms	51124 KB	Output is correct
36	Correct	108 ms	49488 KB	Output is correct
37	Correct	87 ms	50420 KB	Output is correct
38	Correct	55 ms	50512 KB	Output is correct
39	Correct	21 ms	47708 KB	Output is correct
40	Correct	22 ms	47896 KB	Output is correct
41	Correct	97 ms	47196 KB	Output is correct
42	Correct	87 ms	50448 KB	Output is correct
43	Correct	101 ms	50596 KB	Output is correct
44	Correct	117 ms	50468 KB	Output is correct
45	Correct	83 ms	48976 KB	Output is correct
46	Correct	96 ms	50516 KB	Output is correct
47	Correct	31 ms	49992 KB	Output is correct
48	Correct	71 ms	50064 KB	Output is correct
49	Correct	88 ms	50000 KB	Output is correct
50	Correct	99 ms	48844 KB	Output is correct
51	Correct	110 ms	49080 KB	Output is correct
52	Correct	113 ms	50768 KB	Output is correct
53	Correct	89 ms	48976 KB	Output is correct
54	Correct	89 ms	51024 KB	Output is correct

Subtask #6
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	59 ms	48980 KB	Output is correct
2	Correct	61 ms	50616 KB	Output is correct
3	Correct	74 ms	50768 KB	Output is correct
4	Correct	47 ms	49744 KB	Output is correct
5	Correct	54 ms	50300 KB	Output is correct
6	Correct	71 ms	50768 KB	Output is correct
7	Correct	30 ms	47400 KB	Output is correct
8	Correct	24 ms	47040 KB	Output is correct
9	Correct	40 ms	49992 KB	Output is correct
10	Correct	41 ms	49232 KB	Output is correct
11	Correct	67 ms	50032 KB	Output is correct
12	Correct	71 ms	50256 KB	Output is correct

Subtask #7
0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	46940 KB	Output is correct
2	Correct	9 ms	46940 KB	Output is correct
3	Correct	9 ms	46916 KB	Output is correct
4	Correct	9 ms	46936 KB	Output is correct
5	Correct	8 ms	44892 KB	Output is correct
6	Correct	9 ms	44888 KB	Output is correct
7	Correct	9 ms	44892 KB	Output is correct
8	Correct	9 ms	46936 KB	Output is correct
9	Correct	9 ms	46940 KB	Output is correct
10	Correct	9 ms	44892 KB	Output is correct
11	Correct	9 ms	44892 KB	Output is correct
12	Correct	10 ms	44888 KB	Output is correct
13	Correct	8 ms	46940 KB	Output is correct
14	Correct	8 ms	46936 KB	Output is correct
15	Correct	8 ms	46940 KB	Output is correct
16	Correct	10 ms	46936 KB	Output is correct
17	Correct	9 ms	44892 KB	Output is correct
18	Correct	10 ms	46936 KB	Output is correct
19	Correct	9 ms	46940 KB	Output is correct
20	Correct	11 ms	44892 KB	Output is correct
21	Correct	12 ms	46940 KB	Output is correct
22	Correct	10 ms	46940 KB	Output is correct
23	Correct	9 ms	46936 KB	Output is correct
24	Correct	9 ms	46940 KB	Output is correct
25	Correct	9 ms	44892 KB	Output is correct
26	Correct	8 ms	44888 KB	Output is correct
27	Correct	10 ms	44936 KB	Output is correct
28	Correct	9 ms	45080 KB	Output is correct
29	Correct	10 ms	44892 KB	Output is correct
30	Correct	9 ms	47036 KB	Output is correct
31	Correct	10 ms	46980 KB	Output is correct
32	Correct	11 ms	47196 KB	Output is correct
33	Correct	8 ms	47080 KB	Output is correct
34	Correct	8 ms	46940 KB	Output is correct
35	Correct	10 ms	44888 KB	Output is correct
36	Correct	12 ms	46936 KB	Output is correct
37	Correct	9 ms	44888 KB	Output is correct
38	Correct	9 ms	44888 KB	Output is correct
39	Correct	113 ms	49988 KB	Output is correct
40	Correct	117 ms	50512 KB	Output is correct
41	Correct	107 ms	50000 KB	Output is correct
42	Correct	109 ms	50144 KB	Output is correct
43	Correct	119 ms	50512 KB	Output is correct
44	Correct	122 ms	50532 KB	Output is correct
45	Correct	22 ms	47816 KB	Output is correct
46	Correct	26 ms	47944 KB	Output is correct
47	Correct	108 ms	48720 KB	Output is correct
48	Correct	119 ms	50084 KB	Output is correct
49	Correct	118 ms	50212 KB	Output is correct
50	Correct	125 ms	50520 KB	Output is correct
51	Correct	76 ms	48720 KB	Output is correct
52	Correct	96 ms	50768 KB	Output is correct
53	Correct	110 ms	51124 KB	Output is correct
54	Correct	108 ms	49488 KB	Output is correct
55	Correct	87 ms	50420 KB	Output is correct
56	Correct	55 ms	50512 KB	Output is correct
57	Correct	21 ms	47708 KB	Output is correct
58	Correct	22 ms	47896 KB	Output is correct
59	Correct	97 ms	47196 KB	Output is correct
60	Correct	87 ms	50448 KB	Output is correct
61	Correct	101 ms	50596 KB	Output is correct
62	Correct	117 ms	50468 KB	Output is correct
63	Correct	83 ms	48976 KB	Output is correct
64	Correct	96 ms	50516 KB	Output is correct
65	Correct	31 ms	49992 KB	Output is correct
66	Correct	71 ms	50064 KB	Output is correct
67	Correct	88 ms	50000 KB	Output is correct
68	Correct	99 ms	48844 KB	Output is correct
69	Correct	110 ms	49080 KB	Output is correct
70	Correct	113 ms	50768 KB	Output is correct
71	Correct	89 ms	48976 KB	Output is correct
72	Correct	89 ms	51024 KB	Output is correct
73	Correct	59 ms	48980 KB	Output is correct
74	Correct	61 ms	50616 KB	Output is correct
75	Correct	74 ms	50768 KB	Output is correct
76	Correct	47 ms	49744 KB	Output is correct
77	Correct	54 ms	50300 KB	Output is correct
78	Correct	71 ms	50768 KB	Output is correct
79	Correct	30 ms	47400 KB	Output is correct
80	Correct	24 ms	47040 KB	Output is correct
81	Correct	40 ms	49992 KB	Output is correct
82	Correct	41 ms	49232 KB	Output is correct
83	Correct	67 ms	50032 KB	Output is correct
84	Correct	71 ms	50256 KB	Output is correct
85	Correct	123 ms	52024 KB	Output is correct
86	Correct	92 ms	52068 KB	Output is correct
87	Correct	63 ms	50512 KB	Output is correct
88	Correct	78 ms	52480 KB	Output is correct
89	Correct	102 ms	47528 KB	Output is correct
90	Correct	86 ms	52048 KB	Output is correct
91	Correct	94 ms	51536 KB	Output is correct
92	Correct	88 ms	49652 KB	Output is correct
93	Correct	104 ms	52084 KB	Output is correct
94	Correct	94 ms	50512 KB	Output is correct
95	Correct	87 ms	52096 KB	Output is correct
96	Correct	86 ms	52048 KB	Output is correct
97	Correct	149 ms	52092 KB	Output is correct
98	Correct	102 ms	51540 KB	Output is correct
99	Correct	47 ms	49656 KB	Output is correct
100	Correct	66 ms	51280 KB	Output is correct
101	Correct	92 ms	51572 KB	Output is correct
102	Execution timed out	1038 ms	52244 KB	Time limit exceeded
103	Halted	0 ms	0 KB	-

Subtask #8
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	46940 KB	Output is correct
2	Correct	9 ms	46940 KB	Output is correct
3	Correct	9 ms	46916 KB	Output is correct
4	Correct	9 ms	46936 KB	Output is correct
5	Correct	8 ms	44892 KB	Output is correct
6	Correct	9 ms	44888 KB	Output is correct
7	Correct	9 ms	44892 KB	Output is correct
8	Correct	9 ms	46936 KB	Output is correct
9	Correct	9 ms	46940 KB	Output is correct
10	Correct	9 ms	44892 KB	Output is correct
11	Correct	9 ms	44892 KB	Output is correct
12	Correct	10 ms	44888 KB	Output is correct
13	Correct	8 ms	46940 KB	Output is correct
14	Correct	8 ms	46936 KB	Output is correct
15	Correct	8 ms	46940 KB	Output is correct
16	Correct	10 ms	46936 KB	Output is correct
17	Correct	9 ms	44892 KB	Output is correct
18	Correct	10 ms	46936 KB	Output is correct
19	Correct	9 ms	46940 KB	Output is correct
20	Correct	11 ms	44892 KB	Output is correct
21	Correct	12 ms	46940 KB	Output is correct
22	Correct	10 ms	46940 KB	Output is correct
23	Correct	9 ms	46936 KB	Output is correct
24	Correct	9 ms	46940 KB	Output is correct
25	Correct	9 ms	44892 KB	Output is correct
26	Correct	8 ms	44888 KB	Output is correct
27	Correct	10 ms	44936 KB	Output is correct
28	Correct	9 ms	45080 KB	Output is correct
29	Correct	10 ms	44892 KB	Output is correct
30	Correct	9 ms	47036 KB	Output is correct
31	Correct	10 ms	46980 KB	Output is correct
32	Correct	11 ms	47196 KB	Output is correct
33	Correct	8 ms	47080 KB	Output is correct
34	Correct	8 ms	46940 KB	Output is correct
35	Correct	10 ms	44888 KB	Output is correct
36	Correct	12 ms	46936 KB	Output is correct
37	Correct	9 ms	44888 KB	Output is correct
38	Correct	9 ms	44888 KB	Output is correct
39	Correct	113 ms	49988 KB	Output is correct
40	Correct	117 ms	50512 KB	Output is correct
41	Correct	107 ms	50000 KB	Output is correct
42	Correct	109 ms	50144 KB	Output is correct
43	Correct	119 ms	50512 KB	Output is correct
44	Correct	122 ms	50532 KB	Output is correct
45	Correct	22 ms	47816 KB	Output is correct
46	Correct	26 ms	47944 KB	Output is correct
47	Correct	108 ms	48720 KB	Output is correct
48	Correct	119 ms	50084 KB	Output is correct
49	Correct	118 ms	50212 KB	Output is correct
50	Correct	125 ms	50520 KB	Output is correct
51	Correct	76 ms	48720 KB	Output is correct
52	Correct	96 ms	50768 KB	Output is correct
53	Correct	110 ms	51124 KB	Output is correct
54	Correct	108 ms	49488 KB	Output is correct
55	Correct	478 ms	56324 KB	Output is correct
56	Correct	484 ms	59700 KB	Output is correct
57	Correct	484 ms	63000 KB	Output is correct
58	Correct	253 ms	60752 KB	Output is correct
59	Correct	266 ms	59384 KB	Output is correct
60	Correct	355 ms	63824 KB	Output is correct
61	Correct	84 ms	53680 KB	Output is correct
62	Correct	95 ms	51868 KB	Output is correct
63	Correct	318 ms	63884 KB	Output is correct
64	Correct	318 ms	63972 KB	Output is correct
65	Correct	459 ms	61524 KB	Output is correct
66	Correct	454 ms	62716 KB	Output is correct
67	Correct	381 ms	61520 KB	Output is correct
68	Correct	522 ms	62772 KB	Output is correct
69	Correct	612 ms	62892 KB	Output is correct
70	Correct	653 ms	61700 KB	Output is correct
71	Correct	606 ms	62656 KB	Output is correct
72	Correct	519 ms	62896 KB	Output is correct
73	Correct	539 ms	62692 KB	Output is correct
74	Correct	542 ms	62800 KB	Output is correct
75	Correct	648 ms	62744 KB	Output is correct
76	Correct	577 ms	62800 KB	Output is correct
77	Correct	493 ms	61540 KB	Output is correct
78	Correct	564 ms	61448 KB	Output is correct
79	Correct	325 ms	58604 KB	Output is correct
80	Correct	313 ms	60872 KB	Output is correct
81	Execution timed out	1028 ms	58236 KB	Time limit exceeded
82	Halted	0 ms	0 KB	-

답안 #852616

Compilation message