Submission #229507

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
229507	2020-05-04T20:43:03 Z	hanagasumi	Art Exhibition (JOI18_art)	C++17	100 / 100	705 ms	52964 KB

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <complex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <random>

#define ft first
#define sc second
#define pb push_back
#define len(v) (int)v.size()
#define int ll

using namespace std;
typedef long long ll;



signed main() {
	#ifdef PC
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);


	int n;
	cin >> n;
	int ans = 0, bal = 0, minn = 0;
	map<int, int> zer;
	for (int i = 0; i < n; i++) {
		int a, b;
		cin >> a >> b;
		zer[a] += b;
	}
	vector<pair<int, int>> have;
	for (auto x : zer) {
		have.pb(x);
		ans = max(ans, x.sc);
	}
	n = len(have);
	have.pb({100, 100});
	for (int i = 0; i < n; i++) {
		ans = max(ans, bal + have[i].sc - minn);
		bal += (have[i].sc - (have[i + 1].ft - have[i].ft));
		minn = min(minn, bal);
	}
	cout << ans << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	4 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	7 ms	1024 KB	Output is correct
28	Correct	8 ms	1024 KB	Output is correct
29	Correct	7 ms	1024 KB	Output is correct
30	Correct	8 ms	1024 KB	Output is correct
31	Correct	7 ms	1024 KB	Output is correct
32	Correct	8 ms	1024 KB	Output is correct
33	Correct	8 ms	1024 KB	Output is correct
34	Correct	8 ms	1024 KB	Output is correct
35	Correct	7 ms	1024 KB	Output is correct
36	Correct	7 ms	1024 KB	Output is correct
37	Correct	8 ms	1024 KB	Output is correct
38	Correct	8 ms	1024 KB	Output is correct
39	Correct	8 ms	1024 KB	Output is correct
40	Correct	8 ms	1024 KB	Output is correct
41	Correct	8 ms	1024 KB	Output is correct
42	Correct	8 ms	1152 KB	Output is correct
43	Correct	8 ms	1024 KB	Output is correct
44	Correct	8 ms	1024 KB	Output is correct
45	Correct	8 ms	1024 KB	Output is correct
46	Correct	8 ms	1024 KB	Output is correct
47	Correct	8 ms	1024 KB	Output is correct
48	Correct	7 ms	1024 KB	Output is correct
49	Correct	8 ms	1024 KB	Output is correct
50	Correct	7 ms	1024 KB	Output is correct
51	Correct	8 ms	1024 KB	Output is correct
52	Correct	678 ms	52656 KB	Output is correct
53	Correct	687 ms	52652 KB	Output is correct
54	Correct	649 ms	52708 KB	Output is correct
55	Correct	643 ms	52700 KB	Output is correct
56	Correct	647 ms	52576 KB	Output is correct
57	Correct	698 ms	52700 KB	Output is correct
58	Correct	705 ms	52716 KB	Output is correct
59	Correct	681 ms	52964 KB	Output is correct
60	Correct	645 ms	52700 KB	Output is correct
61	Correct	672 ms	52580 KB	Output is correct
62	Correct	687 ms	52704 KB	Output is correct
63	Correct	689 ms	52832 KB	Output is correct
64	Correct	698 ms	52704 KB	Output is correct
65	Correct	686 ms	52576 KB	Output is correct
66	Correct	665 ms	52704 KB	Output is correct
67	Correct	696 ms	52792 KB	Output is correct
68	Correct	676 ms	52704 KB	Output is correct

Submission #229507

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