Submission #41102

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
41102	2018-02-12T18:18:13 Z	abeker	Art Exhibition (JOI18_art)	C++14	100 / 100	290 ms	8556 KB

art

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair <ll, ll> pii;

const int MAXN = 5e5 + 5;
const ll INF = 1e18;

int N;
pii p[MAXN];

void load() {
	scanf("%d", &N);
	for (int i = 1; i <= N; i++)
		scanf("%lld%lld", &p[i].first, &p[i].second);
}

ll solve() {
	sort(p + 1, p + N + 1);
	
	ll mini = INF, sol = -INF;
	for (int i = 1; i <= N; i++) {
		p[i].second += p[i - 1].second;
		mini = min(mini, p[i - 1].second - p[i].first);
		sol = max(sol, p[i].second - p[i].first - mini);
	}
	
	return sol;
}

int main() {
	load();
	printf("%lld\n", solve());
	return 0;
}

Compilation message

art.cpp: In function 'void load()':
art.cpp:14:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
art.cpp:16:47: 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	1 ms	248 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	424 KB	Output is correct
4	Correct	1 ms	440 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	2 ms	496 KB	Output is correct
7	Correct	2 ms	496 KB	Output is correct
8	Correct	1 ms	568 KB	Output is correct
9	Correct	1 ms	568 KB	Output is correct
10	Correct	2 ms	568 KB	Output is correct
11	Correct	1 ms	568 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	248 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	424 KB	Output is correct
4	Correct	1 ms	440 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	2 ms	496 KB	Output is correct
7	Correct	2 ms	496 KB	Output is correct
8	Correct	1 ms	568 KB	Output is correct
9	Correct	1 ms	568 KB	Output is correct
10	Correct	2 ms	568 KB	Output is correct
11	Correct	1 ms	568 KB	Output is correct
12	Correct	2 ms	604 KB	Output is correct
13	Correct	2 ms	604 KB	Output is correct
14	Correct	2 ms	604 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	2 ms	604 KB	Output is correct
17	Correct	2 ms	604 KB	Output is correct
18	Correct	2 ms	620 KB	Output is correct
19	Correct	1 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	620 KB	Output is correct
22	Correct	2 ms	620 KB	Output is correct
23	Correct	2 ms	620 KB	Output is correct
24	Correct	2 ms	620 KB	Output is correct
25	Correct	1 ms	620 KB	Output is correct
26	Correct	2 ms	620 KB	Output is correct

Subtask #3

20.0 / 20.0

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

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	248 KB	Output is correct
2	Correct	1 ms	352 KB	Output is correct
3	Correct	1 ms	424 KB	Output is correct
4	Correct	1 ms	440 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	2 ms	496 KB	Output is correct
7	Correct	2 ms	496 KB	Output is correct
8	Correct	1 ms	568 KB	Output is correct
9	Correct	1 ms	568 KB	Output is correct
10	Correct	2 ms	568 KB	Output is correct
11	Correct	1 ms	568 KB	Output is correct
12	Correct	2 ms	604 KB	Output is correct
13	Correct	2 ms	604 KB	Output is correct
14	Correct	2 ms	604 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	2 ms	604 KB	Output is correct
17	Correct	2 ms	604 KB	Output is correct
18	Correct	2 ms	620 KB	Output is correct
19	Correct	1 ms	620 KB	Output is correct
20	Correct	2 ms	620 KB	Output is correct
21	Correct	2 ms	620 KB	Output is correct
22	Correct	2 ms	620 KB	Output is correct
23	Correct	2 ms	620 KB	Output is correct
24	Correct	2 ms	620 KB	Output is correct
25	Correct	1 ms	620 KB	Output is correct
26	Correct	2 ms	620 KB	Output is correct
27	Correct	4 ms	624 KB	Output is correct
28	Correct	6 ms	624 KB	Output is correct
29	Correct	4 ms	624 KB	Output is correct
30	Correct	4 ms	624 KB	Output is correct
31	Correct	4 ms	624 KB	Output is correct
32	Correct	4 ms	664 KB	Output is correct
33	Correct	4 ms	664 KB	Output is correct
34	Correct	4 ms	664 KB	Output is correct
35	Correct	4 ms	664 KB	Output is correct
36	Correct	4 ms	664 KB	Output is correct
37	Correct	4 ms	664 KB	Output is correct
38	Correct	6 ms	664 KB	Output is correct
39	Correct	4 ms	664 KB	Output is correct
40	Correct	4 ms	664 KB	Output is correct
41	Correct	4 ms	664 KB	Output is correct
42	Correct	4 ms	664 KB	Output is correct
43	Correct	5 ms	668 KB	Output is correct
44	Correct	4 ms	668 KB	Output is correct
45	Correct	4 ms	668 KB	Output is correct
46	Correct	4 ms	668 KB	Output is correct
47	Correct	4 ms	668 KB	Output is correct
48	Correct	5 ms	668 KB	Output is correct
49	Correct	4 ms	668 KB	Output is correct
50	Correct	4 ms	668 KB	Output is correct
51	Correct	4 ms	668 KB	Output is correct
52	Correct	268 ms	8504 KB	Output is correct
53	Correct	263 ms	8504 KB	Output is correct
54	Correct	275 ms	8504 KB	Output is correct
55	Correct	278 ms	8548 KB	Output is correct
56	Correct	290 ms	8548 KB	Output is correct
57	Correct	258 ms	8548 KB	Output is correct
58	Correct	259 ms	8548 KB	Output is correct
59	Correct	278 ms	8548 KB	Output is correct
60	Correct	286 ms	8548 KB	Output is correct
61	Correct	280 ms	8548 KB	Output is correct
62	Correct	250 ms	8548 KB	Output is correct
63	Correct	251 ms	8548 KB	Output is correct
64	Correct	250 ms	8548 KB	Output is correct
65	Correct	248 ms	8548 KB	Output is correct
66	Correct	252 ms	8548 KB	Output is correct
67	Correct	257 ms	8556 KB	Output is correct
68	Correct	279 ms	8556 KB	Output is correct