Submission #875952

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
875952	2023-11-20T20:44:49 Z	misu2005	Art Exhibition (JOI18_art)	C++11	100 / 100	437 ms	33432 KB

#include <iostream>
#include <algorithm>
#include <climits>

using namespace std;

struct ceva {
    long long sz, val;
} v[500002];

bool cmp(ceva x, ceva y) {
    return x.sz < y.sz;
}

long long n;
long long sp[500002], tree[2000005];

void build(long long node, long long st, long long dr) {
    if (st == dr) {
        tree[node] = sp[st] - v[st].sz;
        return ;
    }

    long long mij = (st + dr)/2;
    build(2*node, st, mij);
    build(2*node+1, mij+1, dr);
    tree[node] = max(tree[2*node], tree[2*node+1]);
}

long long query(long long node, long long st, long long dr, long long left, long long right) {
    if (left <= st and dr <= right) {
        return tree[node];
    }

    long long mij = (st + dr)/2;
    long long ans1 = LLONG_MIN, ans2 = LLONG_MIN;
    if (left <= mij)
        ans1 = query(2*node, st, mij, left, right);
    if (mij < right)
        ans2 = query(2*node+1, mij+1, dr, left, right);
    return max(ans1, ans2);
}

signed main()
{
    cin >> n;
    for (long long i = 1; i <= n; i++) {
        cin >> v[i].sz >> v[i].val;
    }
    sort(v+1, v+n+1, cmp);
    for (long long i = 1; i <= n; i++) {
        sp[i] = sp[i-1] + v[i].val;
    }

//    for (long long i = 1; i <= n; i++) {
//        cout << sp[i]-v[i].sz << endl;
//    }
//    return 0;

    build(1, 1, n);

//    for (long longi = 1; i <= 4*n; i++) {
//        cout << i << " " << tree[i] << endl;
//    }
//
//    cout << query(1, 1, n, 5, 6);

    long long maxim = LLONG_MIN;
    for (long long i = 1; i <= n; i++) {
        long long  x = sp[i-1] - v[i].sz;
        long long rezdr = query(1, 1, n, i, n);
        maxim = max(maxim, rezdr-x);
    }
    cout << maxim;
    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	2 ms	2392 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	2496 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	2 ms	2392 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	2496 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2492 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2500 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	2 ms	2392 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	2496 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2492 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2500 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	7 ms	2652 KB	Output is correct
28	Correct	4 ms	2648 KB	Output is correct
29	Correct	4 ms	2652 KB	Output is correct
30	Correct	5 ms	2760 KB	Output is correct
31	Correct	4 ms	2652 KB	Output is correct
32	Correct	5 ms	2652 KB	Output is correct
33	Correct	5 ms	2652 KB	Output is correct
34	Correct	5 ms	2616 KB	Output is correct
35	Correct	5 ms	2648 KB	Output is correct
36	Correct	5 ms	2652 KB	Output is correct
37	Correct	5 ms	2612 KB	Output is correct
38	Correct	4 ms	2652 KB	Output is correct
39	Correct	5 ms	2652 KB	Output is correct
40	Correct	4 ms	2616 KB	Output is correct
41	Correct	4 ms	2652 KB	Output is correct
42	Correct	4 ms	2652 KB	Output is correct
43	Correct	7 ms	2652 KB	Output is correct
44	Correct	4 ms	2652 KB	Output is correct
45	Correct	6 ms	2652 KB	Output is correct
46	Correct	4 ms	2652 KB	Output is correct
47	Correct	5 ms	2600 KB	Output is correct
48	Correct	4 ms	2652 KB	Output is correct
49	Correct	4 ms	2652 KB	Output is correct
50	Correct	4 ms	2600 KB	Output is correct
51	Correct	5 ms	2648 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	2 ms	2392 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	2496 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2492 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2500 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	7 ms	2652 KB	Output is correct
28	Correct	4 ms	2648 KB	Output is correct
29	Correct	4 ms	2652 KB	Output is correct
30	Correct	5 ms	2760 KB	Output is correct
31	Correct	4 ms	2652 KB	Output is correct
32	Correct	5 ms	2652 KB	Output is correct
33	Correct	5 ms	2652 KB	Output is correct
34	Correct	5 ms	2616 KB	Output is correct
35	Correct	5 ms	2648 KB	Output is correct
36	Correct	5 ms	2652 KB	Output is correct
37	Correct	5 ms	2612 KB	Output is correct
38	Correct	4 ms	2652 KB	Output is correct
39	Correct	5 ms	2652 KB	Output is correct
40	Correct	4 ms	2616 KB	Output is correct
41	Correct	4 ms	2652 KB	Output is correct
42	Correct	4 ms	2652 KB	Output is correct
43	Correct	7 ms	2652 KB	Output is correct
44	Correct	4 ms	2652 KB	Output is correct
45	Correct	6 ms	2652 KB	Output is correct
46	Correct	4 ms	2652 KB	Output is correct
47	Correct	5 ms	2600 KB	Output is correct
48	Correct	4 ms	2652 KB	Output is correct
49	Correct	4 ms	2652 KB	Output is correct
50	Correct	4 ms	2600 KB	Output is correct
51	Correct	5 ms	2648 KB	Output is correct
52	Correct	426 ms	33276 KB	Output is correct
53	Correct	424 ms	33108 KB	Output is correct
54	Correct	434 ms	33432 KB	Output is correct
55	Correct	421 ms	33108 KB	Output is correct
56	Correct	429 ms	33176 KB	Output is correct
57	Correct	421 ms	33188 KB	Output is correct
58	Correct	417 ms	33104 KB	Output is correct
59	Correct	434 ms	33328 KB	Output is correct
60	Correct	418 ms	33056 KB	Output is correct
61	Correct	430 ms	33056 KB	Output is correct
62	Correct	431 ms	33104 KB	Output is correct
63	Correct	426 ms	33360 KB	Output is correct
64	Correct	431 ms	33108 KB	Output is correct
65	Correct	430 ms	33108 KB	Output is correct
66	Correct	437 ms	33068 KB	Output is correct
67	Correct	432 ms	33108 KB	Output is correct
68	Correct	429 ms	33364 KB	Output is correct

Submission #875952

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0