Submission #493283

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
493283	2021-12-10T17:28:23 Z	aris12345678	Art Exhibition (JOI18_art)	C++14	100 / 100	226 ms	24772 KB

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pii;
#define X first
#define Y second

const int mxN = 500005;
pii art[mxN];
ll pref[mxN];

int main() {
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
        scanf("%lld %lld", &art[i].X, &art[i].Y);
    sort(art+1, art+n+1);
    for(int i = 1; i <= n; i++)
        pref[i] = pref[i-1]+art[i].Y;
    ll ans = art[1].Y-art[1].X, mn = pref[0]-art[1].X;
    for(int i = 2; i <= n; i++) {
        mn = min(mn, pref[i-1]-art[i].X);
        ans = max(ans, pref[i]-art[i].X-mn);
    }
    printf("%lld\n", ans);
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
art.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         scanf("%lld %lld", &art[i].X, &art[i].Y);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	300 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	216 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	284 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	2 ms	488 KB	Output is correct
28	Correct	3 ms	440 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	440 KB	Output is correct
31	Correct	2 ms	460 KB	Output is correct
32	Correct	2 ms	460 KB	Output is correct
33	Correct	2 ms	460 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	2 ms	460 KB	Output is correct
36	Correct	2 ms	552 KB	Output is correct
37	Correct	2 ms	460 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	460 KB	Output is correct
40	Correct	2 ms	448 KB	Output is correct
41	Correct	2 ms	460 KB	Output is correct
42	Correct	2 ms	460 KB	Output is correct
43	Correct	3 ms	460 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	3 ms	460 KB	Output is correct
46	Correct	2 ms	460 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	2 ms	552 KB	Output is correct
49	Correct	2 ms	460 KB	Output is correct
50	Correct	2 ms	460 KB	Output is correct
51	Correct	2 ms	460 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	300 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	216 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	284 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	2 ms	488 KB	Output is correct
28	Correct	3 ms	440 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	440 KB	Output is correct
31	Correct	2 ms	460 KB	Output is correct
32	Correct	2 ms	460 KB	Output is correct
33	Correct	2 ms	460 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	2 ms	460 KB	Output is correct
36	Correct	2 ms	552 KB	Output is correct
37	Correct	2 ms	460 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	460 KB	Output is correct
40	Correct	2 ms	448 KB	Output is correct
41	Correct	2 ms	460 KB	Output is correct
42	Correct	2 ms	460 KB	Output is correct
43	Correct	3 ms	460 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	3 ms	460 KB	Output is correct
46	Correct	2 ms	460 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	2 ms	552 KB	Output is correct
49	Correct	2 ms	460 KB	Output is correct
50	Correct	2 ms	460 KB	Output is correct
51	Correct	2 ms	460 KB	Output is correct
52	Correct	192 ms	22720 KB	Output is correct
53	Correct	193 ms	23016 KB	Output is correct
54	Correct	191 ms	23108 KB	Output is correct
55	Correct	199 ms	22932 KB	Output is correct
56	Correct	223 ms	22980 KB	Output is correct
57	Correct	179 ms	22948 KB	Output is correct
58	Correct	190 ms	22944 KB	Output is correct
59	Correct	177 ms	24700 KB	Output is correct
60	Correct	172 ms	24588 KB	Output is correct
61	Correct	194 ms	24512 KB	Output is correct
62	Correct	186 ms	24536 KB	Output is correct
63	Correct	183 ms	24644 KB	Output is correct
64	Correct	189 ms	24644 KB	Output is correct
65	Correct	226 ms	24668 KB	Output is correct
66	Correct	178 ms	24584 KB	Output is correct
67	Correct	186 ms	24632 KB	Output is correct
68	Correct	189 ms	24772 KB	Output is correct

Submission #493283

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