Submission #108156

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
108156	2019-04-27T17:58:56 Z	RockyB	Art Exhibition (JOI18_art)	C++17	100 / 100	255 ms	21008 KB

/// In The Name Of God

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n;
pair <ll, ll> a[N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n;
	rep(i, 1, n) cin >> a[i].f >> a[i].s;
	sort (a + 1, a + 1 + n);
	ll mx = -linf, ans = 0, s = 0;
	/*
	rep(i, 1, n) {
		s = 0;
		per(j, i, 1) {
			s += a[j].s;
			//ans = max(ans, s - (a[i].f - a[j].f));
		}
	}*/
	s = 0;
	/// s_i - af_i - s_j-1  + af_j
	//cout << ans;
	//ioi
	rep(i, 1, n) {
		mx = max(mx, a[i].f - s);
		s += a[i].s;
		ans = max(ans, s - a[i].f + mx);
	}
	cout << ans;
	ioi
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	2 ms	512 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	300 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	384 KB	Output is correct
27	Correct	6 ms	704 KB	Output is correct
28	Correct	6 ms	512 KB	Output is correct
29	Correct	4 ms	668 KB	Output is correct
30	Correct	5 ms	512 KB	Output is correct
31	Correct	6 ms	512 KB	Output is correct
32	Correct	4 ms	512 KB	Output is correct
33	Correct	4 ms	524 KB	Output is correct
34	Correct	4 ms	512 KB	Output is correct
35	Correct	6 ms	512 KB	Output is correct
36	Correct	4 ms	512 KB	Output is correct
37	Correct	5 ms	512 KB	Output is correct
38	Correct	6 ms	512 KB	Output is correct
39	Correct	6 ms	640 KB	Output is correct
40	Correct	5 ms	640 KB	Output is correct
41	Correct	6 ms	640 KB	Output is correct
42	Correct	5 ms	512 KB	Output is correct
43	Correct	5 ms	512 KB	Output is correct
44	Correct	5 ms	512 KB	Output is correct
45	Correct	5 ms	512 KB	Output is correct
46	Correct	7 ms	556 KB	Output is correct
47	Correct	5 ms	512 KB	Output is correct
48	Correct	6 ms	640 KB	Output is correct
49	Correct	6 ms	640 KB	Output is correct
50	Correct	4 ms	512 KB	Output is correct
51	Correct	5 ms	512 KB	Output is correct
52	Correct	224 ms	20852 KB	Output is correct
53	Correct	232 ms	20984 KB	Output is correct
54	Correct	224 ms	20836 KB	Output is correct
55	Correct	216 ms	21008 KB	Output is correct
56	Correct	223 ms	20856 KB	Output is correct
57	Correct	225 ms	20952 KB	Output is correct
58	Correct	193 ms	20856 KB	Output is correct
59	Correct	193 ms	20856 KB	Output is correct
60	Correct	229 ms	20900 KB	Output is correct
61	Correct	219 ms	20720 KB	Output is correct
62	Correct	192 ms	20856 KB	Output is correct
63	Correct	239 ms	20888 KB	Output is correct
64	Correct	225 ms	20984 KB	Output is correct
65	Correct	228 ms	20856 KB	Output is correct
66	Correct	240 ms	20984 KB	Output is correct
67	Correct	255 ms	20912 KB	Output is correct
68	Correct	252 ms	20856 KB	Output is correct

Submission #108156

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