Submission #64140

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
64140	2018-08-03T12:00:40 Z	keko37	Art Exhibition (JOI18_art)	C++14	100 / 100	366 ms	75784 KB

#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;

typedef long long llint;

const int MAXN = 500005;
const llint INF = 1000000000000000000LL;

llint n, sol = -INF, mx = -INF;
llint s[MAXN];
pair <llint, llint> p[MAXN];

int main () {
	cin >> n;
	for (int i=1; i<=n; i++) {
		scanf("%lld%lld", &p[i].first, &p[i].second);
	}
	sort(p+1, p+n+1);
	for (int i=1; i<=n; i++) {
		s[i] = p[i].second + s[i-1];
	}
	for (int i=n; i>=1; i--) {
		mx = max(mx, s[i] - p[i].first);
		sol = max(sol, mx + p[i].first - s[i-1]);
	}
	cout << sol;
	return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	3 ms	588 KB	Output is correct
7	Correct	2 ms	592 KB	Output is correct
8	Correct	3 ms	616 KB	Output is correct
9	Correct	3 ms	620 KB	Output is correct
10	Correct	2 ms	624 KB	Output is correct
11	Correct	4 ms	672 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	3 ms	588 KB	Output is correct
7	Correct	2 ms	592 KB	Output is correct
8	Correct	3 ms	616 KB	Output is correct
9	Correct	3 ms	620 KB	Output is correct
10	Correct	2 ms	624 KB	Output is correct
11	Correct	4 ms	672 KB	Output is correct
12	Correct	1 ms	672 KB	Output is correct
13	Correct	3 ms	684 KB	Output is correct
14	Correct	5 ms	692 KB	Output is correct
15	Correct	3 ms	700 KB	Output is correct
16	Correct	3 ms	708 KB	Output is correct
17	Correct	3 ms	716 KB	Output is correct
18	Correct	2 ms	716 KB	Output is correct
19	Correct	3 ms	732 KB	Output is correct
20	Correct	3 ms	740 KB	Output is correct
21	Correct	3 ms	748 KB	Output is correct
22	Correct	2 ms	756 KB	Output is correct
23	Correct	3 ms	756 KB	Output is correct
24	Correct	3 ms	772 KB	Output is correct
25	Correct	4 ms	780 KB	Output is correct
26	Correct	3 ms	788 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	3 ms	588 KB	Output is correct
7	Correct	2 ms	592 KB	Output is correct
8	Correct	3 ms	616 KB	Output is correct
9	Correct	3 ms	620 KB	Output is correct
10	Correct	2 ms	624 KB	Output is correct
11	Correct	4 ms	672 KB	Output is correct
12	Correct	1 ms	672 KB	Output is correct
13	Correct	3 ms	684 KB	Output is correct
14	Correct	5 ms	692 KB	Output is correct
15	Correct	3 ms	700 KB	Output is correct
16	Correct	3 ms	708 KB	Output is correct
17	Correct	3 ms	716 KB	Output is correct
18	Correct	2 ms	716 KB	Output is correct
19	Correct	3 ms	732 KB	Output is correct
20	Correct	3 ms	740 KB	Output is correct
21	Correct	3 ms	748 KB	Output is correct
22	Correct	2 ms	756 KB	Output is correct
23	Correct	3 ms	756 KB	Output is correct
24	Correct	3 ms	772 KB	Output is correct
25	Correct	4 ms	780 KB	Output is correct
26	Correct	3 ms	788 KB	Output is correct
27	Correct	8 ms	964 KB	Output is correct
28	Correct	5 ms	1052 KB	Output is correct
29	Correct	6 ms	1052 KB	Output is correct
30	Correct	5 ms	1052 KB	Output is correct
31	Correct	5 ms	1052 KB	Output is correct
32	Correct	5 ms	1052 KB	Output is correct
33	Correct	5 ms	1052 KB	Output is correct
34	Correct	7 ms	1052 KB	Output is correct
35	Correct	6 ms	1052 KB	Output is correct
36	Correct	5 ms	1052 KB	Output is correct
37	Correct	6 ms	1052 KB	Output is correct
38	Correct	7 ms	1052 KB	Output is correct
39	Correct	6 ms	1052 KB	Output is correct
40	Correct	6 ms	1052 KB	Output is correct
41	Correct	5 ms	1052 KB	Output is correct
42	Correct	7 ms	1052 KB	Output is correct
43	Correct	5 ms	1052 KB	Output is correct
44	Correct	6 ms	1052 KB	Output is correct
45	Correct	6 ms	1052 KB	Output is correct
46	Correct	5 ms	1052 KB	Output is correct
47	Correct	6 ms	1052 KB	Output is correct
48	Correct	5 ms	1052 KB	Output is correct
49	Correct	6 ms	1120 KB	Output is correct
50	Correct	6 ms	1120 KB	Output is correct
51	Correct	6 ms	1120 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	568 KB	Output is correct
4	Correct	2 ms	568 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	3 ms	588 KB	Output is correct
7	Correct	2 ms	592 KB	Output is correct
8	Correct	3 ms	616 KB	Output is correct
9	Correct	3 ms	620 KB	Output is correct
10	Correct	2 ms	624 KB	Output is correct
11	Correct	4 ms	672 KB	Output is correct
12	Correct	1 ms	672 KB	Output is correct
13	Correct	3 ms	684 KB	Output is correct
14	Correct	5 ms	692 KB	Output is correct
15	Correct	3 ms	700 KB	Output is correct
16	Correct	3 ms	708 KB	Output is correct
17	Correct	3 ms	716 KB	Output is correct
18	Correct	2 ms	716 KB	Output is correct
19	Correct	3 ms	732 KB	Output is correct
20	Correct	3 ms	740 KB	Output is correct
21	Correct	3 ms	748 KB	Output is correct
22	Correct	2 ms	756 KB	Output is correct
23	Correct	3 ms	756 KB	Output is correct
24	Correct	3 ms	772 KB	Output is correct
25	Correct	4 ms	780 KB	Output is correct
26	Correct	3 ms	788 KB	Output is correct
27	Correct	8 ms	964 KB	Output is correct
28	Correct	5 ms	1052 KB	Output is correct
29	Correct	6 ms	1052 KB	Output is correct
30	Correct	5 ms	1052 KB	Output is correct
31	Correct	5 ms	1052 KB	Output is correct
32	Correct	5 ms	1052 KB	Output is correct
33	Correct	5 ms	1052 KB	Output is correct
34	Correct	7 ms	1052 KB	Output is correct
35	Correct	6 ms	1052 KB	Output is correct
36	Correct	5 ms	1052 KB	Output is correct
37	Correct	6 ms	1052 KB	Output is correct
38	Correct	7 ms	1052 KB	Output is correct
39	Correct	6 ms	1052 KB	Output is correct
40	Correct	6 ms	1052 KB	Output is correct
41	Correct	5 ms	1052 KB	Output is correct
42	Correct	7 ms	1052 KB	Output is correct
43	Correct	5 ms	1052 KB	Output is correct
44	Correct	6 ms	1052 KB	Output is correct
45	Correct	6 ms	1052 KB	Output is correct
46	Correct	5 ms	1052 KB	Output is correct
47	Correct	6 ms	1052 KB	Output is correct
48	Correct	5 ms	1052 KB	Output is correct
49	Correct	6 ms	1120 KB	Output is correct
50	Correct	6 ms	1120 KB	Output is correct
51	Correct	6 ms	1120 KB	Output is correct
52	Correct	275 ms	12708 KB	Output is correct
53	Correct	317 ms	25488 KB	Output is correct
54	Correct	284 ms	38008 KB	Output is correct
55	Correct	315 ms	50640 KB	Output is correct
56	Correct	324 ms	63296 KB	Output is correct
57	Correct	360 ms	75716 KB	Output is correct
58	Correct	366 ms	75720 KB	Output is correct
59	Correct	365 ms	75720 KB	Output is correct
60	Correct	277 ms	75720 KB	Output is correct
61	Correct	265 ms	75720 KB	Output is correct
62	Correct	270 ms	75720 KB	Output is correct
63	Correct	295 ms	75720 KB	Output is correct
64	Correct	294 ms	75784 KB	Output is correct
65	Correct	297 ms	75784 KB	Output is correct
66	Correct	274 ms	75784 KB	Output is correct
67	Correct	295 ms	75784 KB	Output is correct
68	Correct	277 ms	75784 KB	Output is correct

Submission #64140

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