Submission #1033818

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1033818	2024-07-25T06:43:09 Z	quannnguyen2009	Art Exhibition (JOI18_art)	C++14	100 / 100	154 ms	22216 KB

#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define ii pair<int, int>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
using namespace std;

const int N=1e5+5, mod = 1e9+7, inf = 1e18;

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n; cin >> n;
    ii a[n+1]; for (int i=1; i<=n; i++) cin >> a[i].fi >> a[i].se;
    sort(a+1, a+n+1);
    int p[n+1]; p[0] = 0; for (int i=1; i<=n; i++) p[i] = p[i-1] + a[i].se;
    int mx = -inf;
    int ans = -inf;
    for (int i=n; i>=1; i--) {
        mx = max(mx, p[i]-a[i].fi);
        ans = max(ans, mx-p[i-1]+a[i].fi);
    }
    cout << ans;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	456 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 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	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	456 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 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	0 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	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	456 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 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	0 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	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	604 KB	Output is correct
32	Correct	1 ms	644 KB	Output is correct
33	Correct	2 ms	600 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	2 ms	604 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	1 ms	468 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	2 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	2 ms	460 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	3 ms	604 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	1 ms	604 KB	Output is correct
51	Correct	2 ms	680 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	456 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 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	0 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	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	604 KB	Output is correct
32	Correct	1 ms	644 KB	Output is correct
33	Correct	2 ms	600 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	2 ms	604 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	1 ms	468 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	2 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	2 ms	460 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	1 ms	604 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	3 ms	604 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	1 ms	604 KB	Output is correct
51	Correct	2 ms	680 KB	Output is correct
52	Correct	134 ms	21956 KB	Output is correct
53	Correct	151 ms	21976 KB	Output is correct
54	Correct	123 ms	22216 KB	Output is correct
55	Correct	133 ms	22196 KB	Output is correct
56	Correct	119 ms	22084 KB	Output is correct
57	Correct	154 ms	21988 KB	Output is correct
58	Correct	123 ms	22136 KB	Output is correct
59	Correct	125 ms	22100 KB	Output is correct
60	Correct	119 ms	22092 KB	Output is correct
61	Correct	116 ms	21844 KB	Output is correct
62	Correct	119 ms	22044 KB	Output is correct
63	Correct	124 ms	22120 KB	Output is correct
64	Correct	118 ms	22124 KB	Output is correct
65	Correct	121 ms	22100 KB	Output is correct
66	Correct	133 ms	22096 KB	Output is correct
67	Correct	115 ms	22096 KB	Output is correct
68	Correct	116 ms	21924 KB	Output is correct

Submission #1033818

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