Submission #1093111

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1093111	2024-09-26T01:13:56 Z	DucNguyen2007	Art Exhibition (JOI18_art)	C++14	100 / 100	141 ms	20892 KB

art

#include <cstdio>
#include <algorithm>
using namespace std;

int N;
pair<long long, int> X[505050];

int main()
{
	scanf("%d", &N);
	for (int i = 0; i < N; ++i) {
		long long A; int B;
		scanf("%lld%d", &A, &B);
		X[i] = make_pair(A, B);
	}
	sort(X, X + N);
	long long ret = 0, acc = 0, lo = 0;
	for (int i = 0; i < N; ++i) {
		lo = min(lo, acc - X[i].first);
		acc += X[i].second;
		ret = max(ret, acc - X[i].first - lo);
	}
	printf("%lld\n", ret);
	return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
art.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |   scanf("%lld%d", &A, &B);
      |   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	352 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	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	428 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	352 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	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	428 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	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 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	0 ms	348 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	352 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	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	428 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	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 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	0 ms	348 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	1 ms	604 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	604 KB	Output is correct
33	Correct	1 ms	604 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	1 ms	624 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	436 KB	Output is correct
42	Correct	2 ms	600 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	1 ms	628 KB	Output is correct
45	Correct	2 ms	604 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	1 ms	600 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	2 ms	604 KB	Output is correct
50	Correct	1 ms	548 KB	Output is correct
51	Correct	1 ms	604 KB	Output is correct

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	352 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	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	428 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	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 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	0 ms	348 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	1 ms	604 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	604 KB	Output is correct
33	Correct	1 ms	604 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	1 ms	624 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	436 KB	Output is correct
42	Correct	2 ms	600 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	1 ms	628 KB	Output is correct
45	Correct	2 ms	604 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	1 ms	600 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	2 ms	604 KB	Output is correct
50	Correct	1 ms	548 KB	Output is correct
51	Correct	1 ms	604 KB	Output is correct
52	Correct	125 ms	20820 KB	Output is correct
53	Correct	130 ms	20696 KB	Output is correct
54	Correct	119 ms	20816 KB	Output is correct
55	Correct	123 ms	20868 KB	Output is correct
56	Correct	121 ms	20816 KB	Output is correct
57	Correct	122 ms	20892 KB	Output is correct
58	Correct	141 ms	20820 KB	Output is correct
59	Correct	124 ms	20704 KB	Output is correct
60	Correct	120 ms	20816 KB	Output is correct
61	Correct	124 ms	20680 KB	Output is correct
62	Correct	128 ms	20712 KB	Output is correct
63	Correct	115 ms	20820 KB	Output is correct
64	Correct	124 ms	20812 KB	Output is correct
65	Correct	119 ms	20820 KB	Output is correct
66	Correct	130 ms	20692 KB	Output is correct
67	Correct	121 ms	20800 KB	Output is correct
68	Correct	121 ms	20816 KB	Output is correct