Submission #1086263

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1086263	2024-09-09T21:58:27 Z	codexistent	Art Exhibition (JOI18_art)	C++14	100 / 100	370 ms	24912 KB

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 500005
#define FOR(i, a, b) for(ll i = a; i <= b; i++)

ll n, pfx[MAXN], r = 0;
pair<ll, ll> w[MAXN];

int main(){
    cin >> n;
    FOR(i, 1, n) cin >> w[i].first >> w[i].second;
    sort(w + 1, w + 1 + n);

    pfx[0] = 0;
    FOR(i, 1, n) pfx[i] = pfx[i - 1] + w[i].second;

    ll mx = LLONG_MIN;
    FOR(i, 1, n){
        mx = max(mx, -pfx[i - 1] + w[i].first);

        r = max(r, (pfx[i] - w[i].first) + mx);
    }

    cout << r << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	448 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	600 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	4 ms	600 KB	Output is correct
28	Correct	3 ms	604 KB	Output is correct
29	Correct	4 ms	604 KB	Output is correct
30	Correct	4 ms	604 KB	Output is correct
31	Correct	4 ms	608 KB	Output is correct
32	Correct	4 ms	604 KB	Output is correct
33	Correct	4 ms	604 KB	Output is correct
34	Correct	7 ms	572 KB	Output is correct
35	Correct	4 ms	604 KB	Output is correct
36	Correct	4 ms	684 KB	Output is correct
37	Correct	4 ms	604 KB	Output is correct
38	Correct	4 ms	604 KB	Output is correct
39	Correct	4 ms	556 KB	Output is correct
40	Correct	4 ms	604 KB	Output is correct
41	Correct	4 ms	496 KB	Output is correct
42	Correct	4 ms	604 KB	Output is correct
43	Correct	4 ms	604 KB	Output is correct
44	Correct	4 ms	580 KB	Output is correct
45	Correct	4 ms	604 KB	Output is correct
46	Correct	4 ms	644 KB	Output is correct
47	Correct	4 ms	604 KB	Output is correct
48	Correct	3 ms	604 KB	Output is correct
49	Correct	4 ms	604 KB	Output is correct
50	Correct	3 ms	604 KB	Output is correct
51	Correct	4 ms	580 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	448 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	600 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	4 ms	600 KB	Output is correct
28	Correct	3 ms	604 KB	Output is correct
29	Correct	4 ms	604 KB	Output is correct
30	Correct	4 ms	604 KB	Output is correct
31	Correct	4 ms	608 KB	Output is correct
32	Correct	4 ms	604 KB	Output is correct
33	Correct	4 ms	604 KB	Output is correct
34	Correct	7 ms	572 KB	Output is correct
35	Correct	4 ms	604 KB	Output is correct
36	Correct	4 ms	684 KB	Output is correct
37	Correct	4 ms	604 KB	Output is correct
38	Correct	4 ms	604 KB	Output is correct
39	Correct	4 ms	556 KB	Output is correct
40	Correct	4 ms	604 KB	Output is correct
41	Correct	4 ms	496 KB	Output is correct
42	Correct	4 ms	604 KB	Output is correct
43	Correct	4 ms	604 KB	Output is correct
44	Correct	4 ms	580 KB	Output is correct
45	Correct	4 ms	604 KB	Output is correct
46	Correct	4 ms	644 KB	Output is correct
47	Correct	4 ms	604 KB	Output is correct
48	Correct	3 ms	604 KB	Output is correct
49	Correct	4 ms	604 KB	Output is correct
50	Correct	3 ms	604 KB	Output is correct
51	Correct	4 ms	580 KB	Output is correct
52	Correct	343 ms	24656 KB	Output is correct
53	Correct	346 ms	24740 KB	Output is correct
54	Correct	337 ms	24656 KB	Output is correct
55	Correct	341 ms	24568 KB	Output is correct
56	Correct	344 ms	24552 KB	Output is correct
57	Correct	370 ms	24752 KB	Output is correct
58	Correct	338 ms	24616 KB	Output is correct
59	Correct	337 ms	24728 KB	Output is correct
60	Correct	342 ms	24784 KB	Output is correct
61	Correct	334 ms	24656 KB	Output is correct
62	Correct	343 ms	24656 KB	Output is correct
63	Correct	333 ms	24912 KB	Output is correct
64	Correct	343 ms	24700 KB	Output is correct
65	Correct	348 ms	24660 KB	Output is correct
66	Correct	361 ms	24656 KB	Output is correct
67	Correct	333 ms	24668 KB	Output is correct
68	Correct	346 ms	24804 KB	Output is correct

Submission #1086263

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