Submission #259834

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
259834	2020-08-08T16:03:06 Z	shivensinha4	Art Exhibition (JOI18_art)	C++17	100 / 100	254 ms	24864 KB

#include <bits/stdc++.h> 
using namespace std; 
#define for_(i, s, e) for (int i = s; i < e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
#define SSTR(x) static_cast<std::ostringstream&>((std::ostringstream() << std::dec << x)).str()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'


int main() {
	#ifndef ONLINE_JUDGE
	//freopen("test.in", "r", stdin);
	#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n; cin >> n;
	vector<pair<ll, ll>> nums(n); // size, val
	for_(i, 0, n) cin >> nums[i].first >> nums[i].second;
	sort(nums.begin(), nums.end());
	
	vector<ll> dp(n);
	dp[n-1] = nums[n-1].second - nums[n-1].first;
	for (int i = n-2; i >= 0; i--) {
		dp[i] = max(nums[i].second - nums[i].first, nums[i].second + dp[i+1]);
	}
	
	ll ans = 0;
	for_(i, 0, n) ans = max(ans, dp[i]+nums[i].first);
	cout << ans << endl;

	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 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	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 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	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 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	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	3 ms	512 KB	Output is correct
28	Correct	3 ms	512 KB	Output is correct
29	Correct	3 ms	640 KB	Output is correct
30	Correct	3 ms	636 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	512 KB	Output is correct
34	Correct	3 ms	512 KB	Output is correct
35	Correct	3 ms	640 KB	Output is correct
36	Correct	3 ms	512 KB	Output is correct
37	Correct	3 ms	512 KB	Output is correct
38	Correct	3 ms	512 KB	Output is correct
39	Correct	3 ms	512 KB	Output is correct
40	Correct	3 ms	640 KB	Output is correct
41	Correct	3 ms	512 KB	Output is correct
42	Correct	3 ms	640 KB	Output is correct
43	Correct	3 ms	528 KB	Output is correct
44	Correct	3 ms	512 KB	Output is correct
45	Correct	3 ms	512 KB	Output is correct
46	Correct	3 ms	512 KB	Output is correct
47	Correct	3 ms	512 KB	Output is correct
48	Correct	3 ms	512 KB	Output is correct
49	Correct	3 ms	512 KB	Output is correct
50	Correct	3 ms	512 KB	Output is correct
51	Correct	3 ms	512 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 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	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	3 ms	512 KB	Output is correct
28	Correct	3 ms	512 KB	Output is correct
29	Correct	3 ms	640 KB	Output is correct
30	Correct	3 ms	636 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	512 KB	Output is correct
34	Correct	3 ms	512 KB	Output is correct
35	Correct	3 ms	640 KB	Output is correct
36	Correct	3 ms	512 KB	Output is correct
37	Correct	3 ms	512 KB	Output is correct
38	Correct	3 ms	512 KB	Output is correct
39	Correct	3 ms	512 KB	Output is correct
40	Correct	3 ms	640 KB	Output is correct
41	Correct	3 ms	512 KB	Output is correct
42	Correct	3 ms	640 KB	Output is correct
43	Correct	3 ms	528 KB	Output is correct
44	Correct	3 ms	512 KB	Output is correct
45	Correct	3 ms	512 KB	Output is correct
46	Correct	3 ms	512 KB	Output is correct
47	Correct	3 ms	512 KB	Output is correct
48	Correct	3 ms	512 KB	Output is correct
49	Correct	3 ms	512 KB	Output is correct
50	Correct	3 ms	512 KB	Output is correct
51	Correct	3 ms	512 KB	Output is correct
52	Correct	246 ms	24864 KB	Output is correct
53	Correct	240 ms	24696 KB	Output is correct
54	Correct	243 ms	24696 KB	Output is correct
55	Correct	249 ms	24824 KB	Output is correct
56	Correct	239 ms	24696 KB	Output is correct
57	Correct	240 ms	24824 KB	Output is correct
58	Correct	246 ms	24696 KB	Output is correct
59	Correct	249 ms	24696 KB	Output is correct
60	Correct	244 ms	24824 KB	Output is correct
61	Correct	246 ms	24696 KB	Output is correct
62	Correct	242 ms	24824 KB	Output is correct
63	Correct	246 ms	24744 KB	Output is correct
64	Correct	253 ms	24736 KB	Output is correct
65	Correct	254 ms	24772 KB	Output is correct
66	Correct	248 ms	24824 KB	Output is correct
67	Correct	248 ms	24700 KB	Output is correct
68	Correct	245 ms	24864 KB	Output is correct

Submission #259834

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