Submission #110075

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
110075	2019-05-09T09:18:18 Z	maruii	Art Exhibition (JOI18_art)	C++14	100 / 100	331 ms	21000 KB

#include <bits/stdc++.h>
using namespace std;
int N;
pair<long long, int> p[500002];
int main(){
	scanf("%d",&N);
	long long ans = 0, mx = 0;
	for(int i=0; i<N; ++i) scanf("%lld%d",&p[i].first,&p[i].second);
	sort(p, p+N);
	for(int i=0; i<N; ++i){
		auto x = p[i].first;
		auto y = p[i].second;
		long long r = mx+y-x;
		r = max(r, 1ll*y);
		ans = max(ans, r);
		mx = max(mx, r+x);
	}
	printf("%lld",ans);
	return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	3 ms	256 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	3 ms	412 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	3 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	15 ms	384 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	4 ms	256 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	6 ms	512 KB	Output is correct
28	Correct	7 ms	640 KB	Output is correct
29	Correct	5 ms	512 KB	Output is correct
30	Correct	6 ms	512 KB	Output is correct
31	Correct	5 ms	512 KB	Output is correct
32	Correct	4 ms	512 KB	Output is correct
33	Correct	5 ms	512 KB	Output is correct
34	Correct	6 ms	544 KB	Output is correct
35	Correct	5 ms	512 KB	Output is correct
36	Correct	5 ms	512 KB	Output is correct
37	Correct	5 ms	512 KB	Output is correct
38	Correct	5 ms	512 KB	Output is correct
39	Correct	5 ms	512 KB	Output is correct
40	Correct	5 ms	512 KB	Output is correct
41	Correct	4 ms	512 KB	Output is correct
42	Correct	5 ms	512 KB	Output is correct
43	Correct	4 ms	512 KB	Output is correct
44	Correct	4 ms	512 KB	Output is correct
45	Correct	4 ms	512 KB	Output is correct
46	Correct	5 ms	512 KB	Output is correct
47	Correct	6 ms	572 KB	Output is correct
48	Correct	7 ms	512 KB	Output is correct
49	Correct	5 ms	536 KB	Output is correct
50	Correct	6 ms	512 KB	Output is correct
51	Correct	7 ms	512 KB	Output is correct
52	Correct	278 ms	20728 KB	Output is correct
53	Correct	264 ms	20976 KB	Output is correct
54	Correct	260 ms	20884 KB	Output is correct
55	Correct	258 ms	20856 KB	Output is correct
56	Correct	331 ms	20940 KB	Output is correct
57	Correct	289 ms	21000 KB	Output is correct
58	Correct	290 ms	20856 KB	Output is correct
59	Correct	232 ms	20968 KB	Output is correct
60	Correct	226 ms	20884 KB	Output is correct
61	Correct	266 ms	20728 KB	Output is correct
62	Correct	296 ms	20828 KB	Output is correct
63	Correct	244 ms	20856 KB	Output is correct
64	Correct	253 ms	20856 KB	Output is correct
65	Correct	232 ms	21000 KB	Output is correct
66	Correct	319 ms	20856 KB	Output is correct
67	Correct	258 ms	20768 KB	Output is correct
68	Correct	261 ms	20844 KB	Output is correct

Submission #110075

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