Submission #212600

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
212600	2020-03-23T18:20:32 Z	eggag32	Art Exhibition (JOI18_art)	C++17	100 / 100	237 ms	19236 KB

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	int n;
	cin >> n;
	vector<pair<ll, ll>> a(n + 1);
	repn(i, 1, n + 1) cin >> a[i].fi >> a[i].se;
	sort(1 + all(a));
	vector<ll> sum(n + 1, 0);
	repn(i, 1, n + 1) sum[i] += sum[i - 1] + a[i].se;
	ll ans = 0;
	vector<ll> maxQ(n + 2, -1e18);
	for(int i = n; i >= 1; i--) maxQ[i] = max(maxQ[i + 1], sum[i] - a[i].fi);
	repn(i, 1, n + 1){
		ll mxScore = maxQ[i];
		ans = max(ans, mxScore - sum[i - 1] + a[i].fi);
	}
	cout << ans << endl;
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 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	5 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 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	4 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	4 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	5 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 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	4 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	4 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	7 ms	640 KB	Output is correct
28	Correct	6 ms	768 KB	Output is correct
29	Correct	7 ms	640 KB	Output is correct
30	Correct	7 ms	640 KB	Output is correct
31	Correct	7 ms	640 KB	Output is correct
32	Correct	6 ms	640 KB	Output is correct
33	Correct	7 ms	640 KB	Output is correct
34	Correct	6 ms	640 KB	Output is correct
35	Correct	6 ms	640 KB	Output is correct
36	Correct	7 ms	640 KB	Output is correct
37	Correct	7 ms	640 KB	Output is correct
38	Correct	6 ms	640 KB	Output is correct
39	Correct	7 ms	640 KB	Output is correct
40	Correct	6 ms	640 KB	Output is correct
41	Correct	6 ms	640 KB	Output is correct
42	Correct	6 ms	640 KB	Output is correct
43	Correct	7 ms	640 KB	Output is correct
44	Correct	6 ms	640 KB	Output is correct
45	Correct	7 ms	640 KB	Output is correct
46	Correct	7 ms	640 KB	Output is correct
47	Correct	8 ms	640 KB	Output is correct
48	Correct	7 ms	640 KB	Output is correct
49	Correct	7 ms	640 KB	Output is correct
50	Correct	6 ms	640 KB	Output is correct
51	Correct	7 ms	560 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	5 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 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	4 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	4 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	7 ms	640 KB	Output is correct
28	Correct	6 ms	768 KB	Output is correct
29	Correct	7 ms	640 KB	Output is correct
30	Correct	7 ms	640 KB	Output is correct
31	Correct	7 ms	640 KB	Output is correct
32	Correct	6 ms	640 KB	Output is correct
33	Correct	7 ms	640 KB	Output is correct
34	Correct	6 ms	640 KB	Output is correct
35	Correct	6 ms	640 KB	Output is correct
36	Correct	7 ms	640 KB	Output is correct
37	Correct	7 ms	640 KB	Output is correct
38	Correct	6 ms	640 KB	Output is correct
39	Correct	7 ms	640 KB	Output is correct
40	Correct	6 ms	640 KB	Output is correct
41	Correct	6 ms	640 KB	Output is correct
42	Correct	6 ms	640 KB	Output is correct
43	Correct	7 ms	640 KB	Output is correct
44	Correct	6 ms	640 KB	Output is correct
45	Correct	7 ms	640 KB	Output is correct
46	Correct	7 ms	640 KB	Output is correct
47	Correct	8 ms	640 KB	Output is correct
48	Correct	7 ms	640 KB	Output is correct
49	Correct	7 ms	640 KB	Output is correct
50	Correct	6 ms	640 KB	Output is correct
51	Correct	7 ms	560 KB	Output is correct
52	Correct	221 ms	19064 KB	Output is correct
53	Correct	225 ms	19192 KB	Output is correct
54	Correct	221 ms	19064 KB	Output is correct
55	Correct	224 ms	19136 KB	Output is correct
56	Correct	225 ms	19192 KB	Output is correct
57	Correct	218 ms	19068 KB	Output is correct
58	Correct	221 ms	19064 KB	Output is correct
59	Correct	227 ms	19064 KB	Output is correct
60	Correct	224 ms	19192 KB	Output is correct
61	Correct	220 ms	19064 KB	Output is correct
62	Correct	222 ms	19064 KB	Output is correct
63	Correct	230 ms	19236 KB	Output is correct
64	Correct	237 ms	19112 KB	Output is correct
65	Correct	219 ms	19068 KB	Output is correct
66	Correct	223 ms	18788 KB	Output is correct
67	Correct	222 ms	18680 KB	Output is correct
68	Correct	225 ms	18808 KB	Output is correct

Submission #212600

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