Submission #252621

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
252621	2020-07-26T00:09:47 Z	ChrisT	Art Exhibition (JOI18_art)	C++17	100 / 100	288 ms	21112 KB

art

#include<bits/stdc++.h>
using namespace std;
int main () {
	int n;
	scanf ("%d",&n);
	vector<pair<long long, long long>> v(n+1);
	for (int i = 1; i <= n; i++) scanf ("%lld %lld",&v[i].first,&v[i].second);
	sort(v.begin()+1,v.end());
	long long mx = -1e18, ret = -1e18;
	for (int i = 1; i <= n; i++) {
		v[i].second += v[i-1].second;
		mx = max(mx,v[i].first - v[i-1].second);
		ret = max(ret,v[i].second - v[i].first + mx);
	}
	printf ("%lld\n",ret);
    return 0;
}

Compilation message

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

Subtask #1

10.0 / 10.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

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

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	0 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	0 ms	256 KB	Output is correct
27	Correct	3 ms	512 KB	Output is correct
28	Correct	3 ms	512 KB	Output is correct
29	Correct	3 ms	512 KB	Output is correct
30	Correct	3 ms	512 KB	Output is correct
31	Correct	3 ms	512 KB	Output is correct
32	Correct	3 ms	512 KB	Output is correct
33	Correct	3 ms	512 KB	Output is correct
34	Correct	3 ms	512 KB	Output is correct
35	Correct	3 ms	512 KB	Output is correct
36	Correct	3 ms	512 KB	Output is correct
37	Correct	3 ms	512 KB	Output is correct
38	Correct	3 ms	564 KB	Output is correct
39	Correct	3 ms	512 KB	Output is correct
40	Correct	3 ms	512 KB	Output is correct
41	Correct	3 ms	512 KB	Output is correct
42	Correct	3 ms	512 KB	Output is correct
43	Correct	3 ms	512 KB	Output is correct
44	Correct	3 ms	512 KB	Output is correct
45	Correct	3 ms	512 KB	Output is correct
46	Correct	3 ms	512 KB	Output is correct
47	Correct	3 ms	512 KB	Output is correct
48	Correct	3 ms	512 KB	Output is correct
49	Correct	3 ms	512 KB	Output is correct
50	Correct	3 ms	512 KB	Output is correct
51	Correct	3 ms	512 KB	Output is correct
52	Correct	278 ms	20732 KB	Output is correct
53	Correct	288 ms	20984 KB	Output is correct
54	Correct	276 ms	20856 KB	Output is correct
55	Correct	280 ms	21112 KB	Output is correct
56	Correct	282 ms	20856 KB	Output is correct
57	Correct	276 ms	20984 KB	Output is correct
58	Correct	274 ms	20856 KB	Output is correct
59	Correct	287 ms	21112 KB	Output is correct
60	Correct	273 ms	20984 KB	Output is correct
61	Correct	277 ms	20728 KB	Output is correct
62	Correct	273 ms	20856 KB	Output is correct
63	Correct	274 ms	20856 KB	Output is correct
64	Correct	273 ms	20856 KB	Output is correct
65	Correct	279 ms	20856 KB	Output is correct
66	Correct	277 ms	20984 KB	Output is correct
67	Correct	286 ms	21008 KB	Output is correct
68	Correct	268 ms	20984 KB	Output is correct