Submission #355019

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
355019	2021-01-22T08:14:24 Z	SeDunion	Art Exhibition (JOI18_art)	C++17	100 / 100	235 ms	14316 KB

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 66;

// a[i]<a[i+1]
// max(p[i] - p[j - 1] - (a[i] - a[j]))
// max(p[i] - p[j - 1] - a[i] + a[j])
// max(-a[i] + p[i] + a[j] - p[j - 1])

using pll = pair<ll,ll>;
pll a[N];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int n;
	cin >> n;
	for (int i = 1 ; i <= n ; ++ i) {
		cin >> a[i].first >> a[i].second;
	}
	sort(a + 1, a + 1 + n);
	ll pref = 0;
	ll mx = -(ll(1e18));
	ll Ans = -(ll(1e18));
	for (int i = 1 ; i <= n ; ++ i) {
		mx = max(mx, a[i].first - pref);
		pref += a[i].second;
		Ans = max(Ans, -a[i].first + pref + mx);
	}
	cout << Ans;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 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	492 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 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	512 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	512 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	364 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	364 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	492 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 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	512 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	512 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	364 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	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	2 ms	492 KB	Output is correct
28	Correct	2 ms	492 KB	Output is correct
29	Correct	2 ms	492 KB	Output is correct
30	Correct	2 ms	492 KB	Output is correct
31	Correct	3 ms	512 KB	Output is correct
32	Correct	3 ms	640 KB	Output is correct
33	Correct	3 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	4 ms	492 KB	Output is correct
40	Correct	3 ms	492 KB	Output is correct
41	Correct	4 ms	492 KB	Output is correct
42	Correct	3 ms	492 KB	Output is correct
43	Correct	3 ms	492 KB	Output is correct
44	Correct	3 ms	492 KB	Output is correct
45	Correct	3 ms	492 KB	Output is correct
46	Correct	3 ms	492 KB	Output is correct
47	Correct	3 ms	492 KB	Output is correct
48	Correct	3 ms	492 KB	Output is correct
49	Correct	3 ms	492 KB	Output is correct
50	Correct	4 ms	492 KB	Output is correct
51	Correct	3 ms	492 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 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	512 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	512 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	364 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	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	2 ms	492 KB	Output is correct
28	Correct	2 ms	492 KB	Output is correct
29	Correct	2 ms	492 KB	Output is correct
30	Correct	2 ms	492 KB	Output is correct
31	Correct	3 ms	512 KB	Output is correct
32	Correct	3 ms	640 KB	Output is correct
33	Correct	3 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	4 ms	492 KB	Output is correct
40	Correct	3 ms	492 KB	Output is correct
41	Correct	4 ms	492 KB	Output is correct
42	Correct	3 ms	492 KB	Output is correct
43	Correct	3 ms	492 KB	Output is correct
44	Correct	3 ms	492 KB	Output is correct
45	Correct	3 ms	492 KB	Output is correct
46	Correct	3 ms	492 KB	Output is correct
47	Correct	3 ms	492 KB	Output is correct
48	Correct	3 ms	492 KB	Output is correct
49	Correct	3 ms	492 KB	Output is correct
50	Correct	4 ms	492 KB	Output is correct
51	Correct	3 ms	492 KB	Output is correct
52	Correct	203 ms	14060 KB	Output is correct
53	Correct	205 ms	14060 KB	Output is correct
54	Correct	206 ms	14060 KB	Output is correct
55	Correct	199 ms	14060 KB	Output is correct
56	Correct	216 ms	14188 KB	Output is correct
57	Correct	198 ms	14060 KB	Output is correct
58	Correct	235 ms	14188 KB	Output is correct
59	Correct	203 ms	14188 KB	Output is correct
60	Correct	197 ms	14188 KB	Output is correct
61	Correct	198 ms	14188 KB	Output is correct
62	Correct	202 ms	14188 KB	Output is correct
63	Correct	199 ms	14060 KB	Output is correct
64	Correct	234 ms	14188 KB	Output is correct
65	Correct	198 ms	14188 KB	Output is correct
66	Correct	208 ms	14188 KB	Output is correct
67	Correct	215 ms	14044 KB	Output is correct
68	Correct	204 ms	14316 KB	Output is correct

Submission #355019

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