Submission #212594

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
212594	2020-03-23T18:05:39 Z	eggag32	Art Exhibition (JOI18_art)	C++17	50 / 100	1000 ms	24928 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;
	repn(i, 1, n + 1) repn(j, i, n + 1) ans = max(ans, (sum[j] - sum[i - 1]) - (a[j].fi - 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	5 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	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 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	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 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	512 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	5 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	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 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	512 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	20 ms	640 KB	Output is correct
28	Correct	14 ms	640 KB	Output is correct
29	Correct	14 ms	512 KB	Output is correct
30	Correct	13 ms	640 KB	Output is correct
31	Correct	15 ms	640 KB	Output is correct
32	Correct	14 ms	512 KB	Output is correct
33	Correct	14 ms	640 KB	Output is correct
34	Correct	14 ms	640 KB	Output is correct
35	Correct	15 ms	640 KB	Output is correct
36	Correct	14 ms	640 KB	Output is correct
37	Correct	14 ms	640 KB	Output is correct
38	Correct	14 ms	512 KB	Output is correct
39	Correct	14 ms	512 KB	Output is correct
40	Correct	16 ms	512 KB	Output is correct
41	Correct	14 ms	512 KB	Output is correct
42	Correct	15 ms	640 KB	Output is correct
43	Correct	14 ms	640 KB	Output is correct
44	Correct	15 ms	640 KB	Output is correct
45	Correct	14 ms	640 KB	Output is correct
46	Correct	14 ms	512 KB	Output is correct
47	Correct	15 ms	512 KB	Output is correct
48	Correct	14 ms	512 KB	Output is correct
49	Correct	14 ms	512 KB	Output is correct
50	Correct	14 ms	640 KB	Output is correct
51	Correct	14 ms	512 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 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	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 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	512 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	20 ms	640 KB	Output is correct
28	Correct	14 ms	640 KB	Output is correct
29	Correct	14 ms	512 KB	Output is correct
30	Correct	13 ms	640 KB	Output is correct
31	Correct	15 ms	640 KB	Output is correct
32	Correct	14 ms	512 KB	Output is correct
33	Correct	14 ms	640 KB	Output is correct
34	Correct	14 ms	640 KB	Output is correct
35	Correct	15 ms	640 KB	Output is correct
36	Correct	14 ms	640 KB	Output is correct
37	Correct	14 ms	640 KB	Output is correct
38	Correct	14 ms	512 KB	Output is correct
39	Correct	14 ms	512 KB	Output is correct
40	Correct	16 ms	512 KB	Output is correct
41	Correct	14 ms	512 KB	Output is correct
42	Correct	15 ms	640 KB	Output is correct
43	Correct	14 ms	640 KB	Output is correct
44	Correct	15 ms	640 KB	Output is correct
45	Correct	14 ms	640 KB	Output is correct
46	Correct	14 ms	512 KB	Output is correct
47	Correct	15 ms	512 KB	Output is correct
48	Correct	14 ms	512 KB	Output is correct
49	Correct	14 ms	512 KB	Output is correct
50	Correct	14 ms	640 KB	Output is correct
51	Correct	14 ms	512 KB	Output is correct
52	Execution timed out	1046 ms	24928 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #212594

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0