Submission #330798

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
330798	2020-11-26T15:50:49 Z	M_W	Art Exhibition (JOI18_art)	C++14	100 / 100	268 ms	14572 KB

art

#include <bits/stdc++.h>
using namespace std;
#define ii pair<long long, long long>
ii aw[500500];
long long val[500500];
int main(){
	int N;
	scanf("%d", &N);
	for(int i = 0; i < N; i++)
		scanf("%lld %lld", &aw[i].first, &aw[i].second);
	sort(aw, aw + N);
	val[0] = aw[0].second;
	for(int i = 1; i < N; i++)
		val[i] = (aw[i].second - (aw[i].first - aw[i - 1].first));
	long long curmax = 0, maxmax = INT_MIN;
	for(int i = 0; i < N; i++){
		curmax = max(curmax + val[i], aw[i].second);
		maxmax = max(maxmax, curmax);
	}
	printf("%lld", maxmax);
}

Compilation message

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

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

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

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	3 ms	492 KB	Output is correct
28	Correct	3 ms	492 KB	Output is correct
29	Correct	3 ms	492 KB	Output is correct
30	Correct	2 ms	492 KB	Output is correct
31	Correct	3 ms	492 KB	Output is correct
32	Correct	3 ms	492 KB	Output is correct
33	Correct	2 ms	492 KB	Output is correct
34	Correct	3 ms	492 KB	Output is correct
35	Correct	3 ms	492 KB	Output is correct
36	Correct	3 ms	492 KB	Output is correct
37	Correct	3 ms	492 KB	Output is correct
38	Correct	3 ms	492 KB	Output is correct
39	Correct	2 ms	492 KB	Output is correct
40	Correct	3 ms	492 KB	Output is correct
41	Correct	3 ms	620 KB	Output is correct
42	Correct	3 ms	640 KB	Output is correct
43	Correct	3 ms	620 KB	Output is correct
44	Correct	3 ms	620 KB	Output is correct
45	Correct	3 ms	620 KB	Output is correct
46	Correct	3 ms	620 KB	Output is correct
47	Correct	3 ms	640 KB	Output is correct
48	Correct	3 ms	640 KB	Output is correct
49	Correct	3 ms	620 KB	Output is correct
50	Correct	3 ms	620 KB	Output is correct
51	Correct	3 ms	620 KB	Output is correct
52	Correct	213 ms	14444 KB	Output is correct
53	Correct	214 ms	14444 KB	Output is correct
54	Correct	215 ms	14572 KB	Output is correct
55	Correct	218 ms	14444 KB	Output is correct
56	Correct	214 ms	14444 KB	Output is correct
57	Correct	218 ms	14444 KB	Output is correct
58	Correct	226 ms	14444 KB	Output is correct
59	Correct	216 ms	14572 KB	Output is correct
60	Correct	223 ms	14452 KB	Output is correct
61	Correct	234 ms	14444 KB	Output is correct
62	Correct	215 ms	14444 KB	Output is correct
63	Correct	215 ms	14444 KB	Output is correct
64	Correct	268 ms	14444 KB	Output is correct
65	Correct	215 ms	14444 KB	Output is correct
66	Correct	217 ms	14480 KB	Output is correct
67	Correct	215 ms	14444 KB	Output is correct
68	Correct	220 ms	14572 KB	Output is correct