oj.uz

답안 #852625

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852625 2023-09-22T08:45:18 Z danikoynov 푸드 코트 (JOI21_foodcourt) C++14
42 / 100
 1000 ms 52228 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 readInt () {
	bool minus = false;
	int result = 0;
	char ch;
	ch = getchar();
	while (true) {
		if (ch == '-') break;
		if (ch >= '0' && ch <= '9') break;
		ch = getchar();
	}
	if (ch == '-') minus = true; else result = ch-'0';
	while (true) {
		ch = getchar();
		if (ch < '0' || ch > '9') break;
		result = result*10 + (ch - '0');
	}
	if (minus)
		return -result;
	else
		return result;
}


long long int read_int(){
	char r;
	bool start=false,neg=false;
	long long int ret=0;
	while(true){
		r=getchar();
		if((r-'0'<0 || r-'0'>9) && r!='-' && !start){
			continue;
		}
		if((r-'0'<0 || r-'0'>9) && r!='-' && start){
			break;
		}
		if(start)ret*=10;
		start=true;
		if(r=='-')neg=true;
		else ret+=r-'0';
	}
	if(!neg)
		return ret;
	else
		return -ret;
}

int n, m, q;
void input()
{
    n = readInt();
    m = readInt();
    q = readInt();
    //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;
        t = readInt();
        if (t == 1)
        {
            ///cin >> l >> r >> c >> k;
            l = readInt();
            r = readInt();
            c = readInt();
            k = read_int();
            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;
                        l = readInt();
            r = readInt();
            k = read_int();
            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;
            a = readInt();
            b = read_int();
            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()
{
    ///freopen("test.txt", "r", stdin);
    speed();
    solve();
    return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35928 KB Output is correct
2 Correct 9 ms 35928 KB Output is correct
3 Correct 7 ms 36088 KB Output is correct
4 Correct 7 ms 35928 KB Output is correct
5 Correct 6 ms 35928 KB Output is correct
6 Correct 7 ms 35928 KB Output is correct
7 Correct 8 ms 33880 KB Output is correct
8 Correct 7 ms 35932 KB Output is correct
9 Correct 8 ms 35928 KB Output is correct
10 Correct 8 ms 33880 KB Output is correct
11 Correct 7 ms 33968 KB Output is correct
12 Correct 7 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 35932 KB Output is correct
16 Correct 8 ms 35932 KB Output is correct
17 Correct 7 ms 33880 KB Output is correct
18 Correct 8 ms 35928 KB Output is correct
19 Correct 7 ms 35928 KB Output is correct
20 Correct 8 ms 33880 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35928 KB Output is correct
2 Correct 9 ms 35928 KB Output is correct
3 Correct 7 ms 36088 KB Output is correct
4 Correct 7 ms 35928 KB Output is correct
5 Correct 6 ms 35928 KB Output is correct
6 Correct 7 ms 35928 KB Output is correct
7 Correct 8 ms 33880 KB Output is correct
8 Correct 7 ms 35932 KB Output is correct
9 Correct 8 ms 35928 KB Output is correct
10 Correct 8 ms 33880 KB Output is correct
11 Correct 7 ms 33968 KB Output is correct
12 Correct 7 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 35932 KB Output is correct
16 Correct 8 ms 35932 KB Output is correct
17 Correct 7 ms 33880 KB Output is correct
18 Correct 8 ms 35928 KB Output is correct
19 Correct 7 ms 35928 KB Output is correct
20 Correct 8 ms 33880 KB Output is correct
21 Correct 8 ms 35928 KB Output is correct
22 Correct 8 ms 35928 KB Output is correct
23 Correct 7 ms 35928 KB Output is correct
24 Correct 7 ms 35932 KB Output is correct
25 Correct 6 ms 35928 KB Output is correct
26 Correct 6 ms 35932 KB Output is correct
27 Correct 8 ms 33880 KB Output is correct
28 Correct 7 ms 33880 KB Output is correct
29 Correct 9 ms 33880 KB Output is correct
30 Correct 8 ms 35928 KB Output is correct
31 Correct 9 ms 35932 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 35768 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 7 ms 33880 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 41652 KB Output is correct
2 Correct 131 ms 41808 KB Output is correct
3 Correct 95 ms 41552 KB Output is correct
4 Correct 97 ms 41560 KB Output is correct
5 Correct 104 ms 41808 KB Output is correct
6 Correct 110 ms 41808 KB Output is correct
7 Correct 15 ms 38488 KB Output is correct
8 Correct 15 ms 38488 KB Output is correct
9 Correct 94 ms 40016 KB Output is correct
10 Correct 117 ms 41808 KB Output is correct
11 Correct 100 ms 41552 KB Output is correct
12 Correct 103 ms 41552 KB Output is correct
13 Correct 81 ms 40016 KB Output is correct
14 Correct 77 ms 42064 KB Output is correct
15 Correct 87 ms 41808 KB Output is correct
16 Correct 90 ms 40592 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 492 ms 49312 KB Output is correct
2 Correct 444 ms 48416 KB Output is correct
3 Correct 429 ms 49956 KB Output is correct
4 Correct 251 ms 49488 KB Output is correct
5 Correct 236 ms 49232 KB Output is correct
6 Correct 362 ms 51360 KB Output is correct
7 Correct 40 ms 40384 KB Output is correct
8 Correct 47 ms 37820 KB Output is correct
9 Correct 297 ms 51540 KB Output is correct
10 Correct 321 ms 52228 KB Output is correct
11 Correct 424 ms 49232 KB Output is correct
12 Correct 389 ms 49772 KB Output is correct
13 Correct 352 ms 49260 KB Output is correct
14 Correct 472 ms 49368 KB Output is correct
15 Correct 586 ms 49604 KB Output is correct
16 Correct 560 ms 49324 KB Output is correct
17 Correct 518 ms 50444 KB Output is correct
18 Correct 482 ms 49572 KB Output is correct
19 Correct 509 ms 49668 KB Output is correct
20 Correct 501 ms 49496 KB Output is correct
21 Correct 609 ms 49976 KB Output is correct
22 Correct 593 ms 50748 KB Output is correct
23 Correct 452 ms 49232 KB Output is correct
24 Correct 565 ms 49248 KB Output is correct
25 Correct 271 ms 45136 KB Output is correct
26 Correct 258 ms 47184 KB Output is correct
27 Execution timed out 1018 ms 49336 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35928 KB Output is correct
2 Correct 9 ms 35928 KB Output is correct
3 Correct 7 ms 36088 KB Output is correct
4 Correct 7 ms 35928 KB Output is correct
5 Correct 6 ms 35928 KB Output is correct
6 Correct 7 ms 35928 KB Output is correct
7 Correct 8 ms 33880 KB Output is correct
8 Correct 7 ms 35932 KB Output is correct
9 Correct 8 ms 35928 KB Output is correct
10 Correct 8 ms 33880 KB Output is correct
11 Correct 7 ms 33968 KB Output is correct
12 Correct 7 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 35932 KB Output is correct
16 Correct 8 ms 35932 KB Output is correct
17 Correct 7 ms 33880 KB Output is correct
18 Correct 8 ms 35928 KB Output is correct
19 Correct 7 ms 35928 KB Output is correct
20 Correct 8 ms 33880 KB Output is correct
21 Correct 102 ms 41652 KB Output is correct
22 Correct 131 ms 41808 KB Output is correct
23 Correct 95 ms 41552 KB Output is correct
24 Correct 97 ms 41560 KB Output is correct
25 Correct 104 ms 41808 KB Output is correct
26 Correct 110 ms 41808 KB Output is correct
27 Correct 15 ms 38488 KB Output is correct
28 Correct 15 ms 38488 KB Output is correct
29 Correct 94 ms 40016 KB Output is correct
30 Correct 117 ms 41808 KB Output is correct
31 Correct 100 ms 41552 KB Output is correct
32 Correct 103 ms 41552 KB Output is correct
33 Correct 81 ms 40016 KB Output is correct
34 Correct 77 ms 42064 KB Output is correct
35 Correct 87 ms 41808 KB Output is correct
36 Correct 90 ms 40592 KB Output is correct
37 Correct 67 ms 42056 KB Output is correct
38 Correct 64 ms 42164 KB Output is correct
39 Correct 12 ms 38616 KB Output is correct
40 Correct 13 ms 38736 KB Output is correct
41 Correct 69 ms 38476 KB Output is correct
42 Correct 71 ms 42064 KB Output is correct
43 Correct 86 ms 41960 KB Output is correct
44 Correct 76 ms 42064 KB Output is correct
45 Correct 66 ms 40620 KB Output is correct
46 Correct 86 ms 41936 KB Output is correct
47 Correct 23 ms 41304 KB Output is correct
48 Correct 63 ms 41300 KB Output is correct
49 Correct 70 ms 41596 KB Output is correct
50 Correct 111 ms 40300 KB Output is correct
51 Correct 101 ms 40784 KB Output is correct
52 Correct 99 ms 41892 KB Output is correct
53 Correct 63 ms 40300 KB Output is correct
54 Correct 74 ms 42320 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 40560 KB Output is correct
2 Correct 53 ms 40420 KB Output is correct
3 Correct 52 ms 40556 KB Output is correct
4 Correct 40 ms 40016 KB Output is correct
5 Correct 47 ms 40272 KB Output is correct
6 Correct 55 ms 40524 KB Output is correct
7 Correct 16 ms 36820 KB Output is correct
8 Correct 15 ms 36928 KB Output is correct
9 Correct 30 ms 39504 KB Output is correct
10 Correct 35 ms 39504 KB Output is correct
11 Correct 47 ms 39764 KB Output is correct
12 Correct 45 ms 39760 KB Output is correct

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35928 KB Output is correct
2 Correct 9 ms 35928 KB Output is correct
3 Correct 7 ms 36088 KB Output is correct
4 Correct 7 ms 35928 KB Output is correct
5 Correct 6 ms 35928 KB Output is correct
6 Correct 7 ms 35928 KB Output is correct
7 Correct 8 ms 33880 KB Output is correct
8 Correct 7 ms 35932 KB Output is correct
9 Correct 8 ms 35928 KB Output is correct
10 Correct 8 ms 33880 KB Output is correct
11 Correct 7 ms 33968 KB Output is correct
12 Correct 7 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 35932 KB Output is correct
16 Correct 8 ms 35932 KB Output is correct
17 Correct 7 ms 33880 KB Output is correct
18 Correct 8 ms 35928 KB Output is correct
19 Correct 7 ms 35928 KB Output is correct
20 Correct 8 ms 33880 KB Output is correct
21 Correct 8 ms 35928 KB Output is correct
22 Correct 8 ms 35928 KB Output is correct
23 Correct 7 ms 35928 KB Output is correct
24 Correct 7 ms 35932 KB Output is correct
25 Correct 6 ms 35928 KB Output is correct
26 Correct 6 ms 35932 KB Output is correct
27 Correct 8 ms 33880 KB Output is correct
28 Correct 7 ms 33880 KB Output is correct
29 Correct 9 ms 33880 KB Output is correct
30 Correct 8 ms 35928 KB Output is correct
31 Correct 9 ms 35932 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 35768 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 7 ms 33880 KB Output is correct
39 Correct 102 ms 41652 KB Output is correct
40 Correct 131 ms 41808 KB Output is correct
41 Correct 95 ms 41552 KB Output is correct
42 Correct 97 ms 41560 KB Output is correct
43 Correct 104 ms 41808 KB Output is correct
44 Correct 110 ms 41808 KB Output is correct
45 Correct 15 ms 38488 KB Output is correct
46 Correct 15 ms 38488 KB Output is correct
47 Correct 94 ms 40016 KB Output is correct
48 Correct 117 ms 41808 KB Output is correct
49 Correct 100 ms 41552 KB Output is correct
50 Correct 103 ms 41552 KB Output is correct
51 Correct 81 ms 40016 KB Output is correct
52 Correct 77 ms 42064 KB Output is correct
53 Correct 87 ms 41808 KB Output is correct
54 Correct 90 ms 40592 KB Output is correct
55 Correct 67 ms 42056 KB Output is correct
56 Correct 64 ms 42164 KB Output is correct
57 Correct 12 ms 38616 KB Output is correct
58 Correct 13 ms 38736 KB Output is correct
59 Correct 69 ms 38476 KB Output is correct
60 Correct 71 ms 42064 KB Output is correct
61 Correct 86 ms 41960 KB Output is correct
62 Correct 76 ms 42064 KB Output is correct
63 Correct 66 ms 40620 KB Output is correct
64 Correct 86 ms 41936 KB Output is correct
65 Correct 23 ms 41304 KB Output is correct
66 Correct 63 ms 41300 KB Output is correct
67 Correct 70 ms 41596 KB Output is correct
68 Correct 111 ms 40300 KB Output is correct
69 Correct 101 ms 40784 KB Output is correct
70 Correct 99 ms 41892 KB Output is correct
71 Correct 63 ms 40300 KB Output is correct
72 Correct 74 ms 42320 KB Output is correct
73 Correct 48 ms 40560 KB Output is correct
74 Correct 53 ms 40420 KB Output is correct
75 Correct 52 ms 40556 KB Output is correct
76 Correct 40 ms 40016 KB Output is correct
77 Correct 47 ms 40272 KB Output is correct
78 Correct 55 ms 40524 KB Output is correct
79 Correct 16 ms 36820 KB Output is correct
80 Correct 15 ms 36928 KB Output is correct
81 Correct 30 ms 39504 KB Output is correct
82 Correct 35 ms 39504 KB Output is correct
83 Correct 47 ms 39764 KB Output is correct
84 Correct 45 ms 39760 KB Output is correct
85 Correct 97 ms 41808 KB Output is correct
86 Correct 76 ms 42064 KB Output is correct
87 Correct 63 ms 40624 KB Output is correct
88 Correct 71 ms 42320 KB Output is correct
89 Correct 76 ms 37968 KB Output is correct
90 Correct 68 ms 42152 KB Output is correct
91 Correct 81 ms 41636 KB Output is correct
92 Correct 80 ms 39880 KB Output is correct
93 Correct 92 ms 41932 KB Output is correct
94 Correct 73 ms 40448 KB Output is correct
95 Correct 66 ms 42064 KB Output is correct
96 Correct 74 ms 42064 KB Output is correct
97 Correct 130 ms 42064 KB Output is correct
98 Correct 88 ms 41808 KB Output is correct
99 Correct 26 ms 39256 KB Output is correct
100 Correct 57 ms 41320 KB Output is correct
101 Correct 67 ms 41448 KB Output is correct
102 Execution timed out 1033 ms 42320 KB Time limit exceeded
103 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 35928 KB Output is correct
2 Correct 9 ms 35928 KB Output is correct
3 Correct 7 ms 36088 KB Output is correct
4 Correct 7 ms 35928 KB Output is correct
5 Correct 6 ms 35928 KB Output is correct
6 Correct 7 ms 35928 KB Output is correct
7 Correct 8 ms 33880 KB Output is correct
8 Correct 7 ms 35932 KB Output is correct
9 Correct 8 ms 35928 KB Output is correct
10 Correct 8 ms 33880 KB Output is correct
11 Correct 7 ms 33968 KB Output is correct
12 Correct 7 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 35932 KB Output is correct
16 Correct 8 ms 35932 KB Output is correct
17 Correct 7 ms 33880 KB Output is correct
18 Correct 8 ms 35928 KB Output is correct
19 Correct 7 ms 35928 KB Output is correct
20 Correct 8 ms 33880 KB Output is correct
21 Correct 8 ms 35928 KB Output is correct
22 Correct 8 ms 35928 KB Output is correct
23 Correct 7 ms 35928 KB Output is correct
24 Correct 7 ms 35932 KB Output is correct
25 Correct 6 ms 35928 KB Output is correct
26 Correct 6 ms 35932 KB Output is correct
27 Correct 8 ms 33880 KB Output is correct
28 Correct 7 ms 33880 KB Output is correct
29 Correct 9 ms 33880 KB Output is correct
30 Correct 8 ms 35928 KB Output is correct
31 Correct 9 ms 35932 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 35768 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 7 ms 33880 KB Output is correct
39 Correct 102 ms 41652 KB Output is correct
40 Correct 131 ms 41808 KB Output is correct
41 Correct 95 ms 41552 KB Output is correct
42 Correct 97 ms 41560 KB Output is correct
43 Correct 104 ms 41808 KB Output is correct
44 Correct 110 ms 41808 KB Output is correct
45 Correct 15 ms 38488 KB Output is correct
46 Correct 15 ms 38488 KB Output is correct
47 Correct 94 ms 40016 KB Output is correct
48 Correct 117 ms 41808 KB Output is correct
49 Correct 100 ms 41552 KB Output is correct
50 Correct 103 ms 41552 KB Output is correct
51 Correct 81 ms 40016 KB Output is correct
52 Correct 77 ms 42064 KB Output is correct
53 Correct 87 ms 41808 KB Output is correct
54 Correct 90 ms 40592 KB Output is correct
55 Correct 492 ms 49312 KB Output is correct
56 Correct 444 ms 48416 KB Output is correct
57 Correct 429 ms 49956 KB Output is correct
58 Correct 251 ms 49488 KB Output is correct
59 Correct 236 ms 49232 KB Output is correct
60 Correct 362 ms 51360 KB Output is correct
61 Correct 40 ms 40384 KB Output is correct
62 Correct 47 ms 37820 KB Output is correct
63 Correct 297 ms 51540 KB Output is correct
64 Correct 321 ms 52228 KB Output is correct
65 Correct 424 ms 49232 KB Output is correct
66 Correct 389 ms 49772 KB Output is correct
67 Correct 352 ms 49260 KB Output is correct
68 Correct 472 ms 49368 KB Output is correct
69 Correct 586 ms 49604 KB Output is correct
70 Correct 560 ms 49324 KB Output is correct
71 Correct 518 ms 50444 KB Output is correct
72 Correct 482 ms 49572 KB Output is correct
73 Correct 509 ms 49668 KB Output is correct
74 Correct 501 ms 49496 KB Output is correct
75 Correct 609 ms 49976 KB Output is correct
76 Correct 593 ms 50748 KB Output is correct
77 Correct 452 ms 49232 KB Output is correct
78 Correct 565 ms 49248 KB Output is correct
79 Correct 271 ms 45136 KB Output is correct
80 Correct 258 ms 47184 KB Output is correct
81 Execution timed out 1018 ms 49336 KB Time limit exceeded
82 Halted 0 ms 0 KB -