Submission #341578

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
341578	2020-12-30T05:13:45 Z	Drew_	Art Exhibition (JOI18_art)	C++14	100 / 100	236 ms	24960 KB

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

#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second

#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x...) cerr << "[" << #x << "]: " << x << "\n";

using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using pl = pair<ll, ll>;

ld const PI = 4*atan((ld)1);
int const MAX = 5e5 + 7;

pl art[MAX];
ll pfx[MAX];

int main()
{
	fastio;

	int n;
	cin >> n;

	for (int i = 1; i <= n; ++i)
		cin >> art[i].f1 >> art[i].s2;
	sort(art+1, art+1+n);

	for (int i = 1; i <= n; ++i)
		pfx[i] = pfx[i-1] + art[i].s2;

	ll res = 0;
	for (int i = 1, j = 1; j <= n; ++j)
	{	
		// using art [i, j]
		if (pfx[j-1] - pfx[i-1] < art[j].f1 - art[i].f1)
			i = j;

		//cerr << i << " " << j << " " << pfx[j] - pfx[i-1] << " " << art[j].f1 << " " << art[j].s2 << '\n';

		res = max(res, pfx[j] - pfx[i-1] - (art[j].f1 - art[i].f1));
	}
	cout << res << '\n';

	return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 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	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 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	364 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	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 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	364 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	376 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	384 KB	Output is correct
19	Correct	1 ms	384 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	384 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 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	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 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	364 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	376 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	384 KB	Output is correct
19	Correct	1 ms	384 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	384 KB	Output is correct
27	Correct	2 ms	620 KB	Output is correct
28	Correct	3 ms	620 KB	Output is correct
29	Correct	2 ms	620 KB	Output is correct
30	Correct	3 ms	620 KB	Output is correct
31	Correct	3 ms	620 KB	Output is correct
32	Correct	3 ms	620 KB	Output is correct
33	Correct	2 ms	620 KB	Output is correct
34	Correct	2 ms	620 KB	Output is correct
35	Correct	2 ms	620 KB	Output is correct
36	Correct	2 ms	620 KB	Output is correct
37	Correct	3 ms	620 KB	Output is correct
38	Correct	3 ms	620 KB	Output is correct
39	Correct	3 ms	620 KB	Output is correct
40	Correct	3 ms	620 KB	Output is correct
41	Correct	2 ms	620 KB	Output is correct
42	Correct	3 ms	620 KB	Output is correct
43	Correct	3 ms	640 KB	Output is correct
44	Correct	4 ms	620 KB	Output is correct
45	Correct	3 ms	620 KB	Output is correct
46	Correct	2 ms	620 KB	Output is correct
47	Correct	3 ms	620 KB	Output is correct
48	Correct	3 ms	620 KB	Output is correct
49	Correct	2 ms	620 KB	Output is correct
50	Correct	3 ms	620 KB	Output is correct
51	Correct	3 ms	620 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 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	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 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	364 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	376 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	384 KB	Output is correct
19	Correct	1 ms	384 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	384 KB	Output is correct
27	Correct	2 ms	620 KB	Output is correct
28	Correct	3 ms	620 KB	Output is correct
29	Correct	2 ms	620 KB	Output is correct
30	Correct	3 ms	620 KB	Output is correct
31	Correct	3 ms	620 KB	Output is correct
32	Correct	3 ms	620 KB	Output is correct
33	Correct	2 ms	620 KB	Output is correct
34	Correct	2 ms	620 KB	Output is correct
35	Correct	2 ms	620 KB	Output is correct
36	Correct	2 ms	620 KB	Output is correct
37	Correct	3 ms	620 KB	Output is correct
38	Correct	3 ms	620 KB	Output is correct
39	Correct	3 ms	620 KB	Output is correct
40	Correct	3 ms	620 KB	Output is correct
41	Correct	2 ms	620 KB	Output is correct
42	Correct	3 ms	620 KB	Output is correct
43	Correct	3 ms	640 KB	Output is correct
44	Correct	4 ms	620 KB	Output is correct
45	Correct	3 ms	620 KB	Output is correct
46	Correct	2 ms	620 KB	Output is correct
47	Correct	3 ms	620 KB	Output is correct
48	Correct	3 ms	620 KB	Output is correct
49	Correct	2 ms	620 KB	Output is correct
50	Correct	3 ms	620 KB	Output is correct
51	Correct	3 ms	620 KB	Output is correct
52	Correct	202 ms	24684 KB	Output is correct
53	Correct	203 ms	24684 KB	Output is correct
54	Correct	204 ms	24940 KB	Output is correct
55	Correct	204 ms	24812 KB	Output is correct
56	Correct	202 ms	24684 KB	Output is correct
57	Correct	205 ms	24684 KB	Output is correct
58	Correct	210 ms	24812 KB	Output is correct
59	Correct	203 ms	24684 KB	Output is correct
60	Correct	202 ms	24960 KB	Output is correct
61	Correct	205 ms	24556 KB	Output is correct
62	Correct	199 ms	24812 KB	Output is correct
63	Correct	203 ms	24812 KB	Output is correct
64	Correct	206 ms	24812 KB	Output is correct
65	Correct	203 ms	24760 KB	Output is correct
66	Correct	236 ms	24812 KB	Output is correct
67	Correct	212 ms	24876 KB	Output is correct
68	Correct	201 ms	24684 KB	Output is correct

Submission #341578

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