Submission #127285

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
127285	2019-07-09T07:49:10 Z	AuldLangSyne	Art Exhibition (JOI18_art)	C++14	100 / 100	485 ms	90560 KB

#include <bits/stdc++.h>
#define ll long long
#define f(i, a, b) for(ll i = a; i <= b; ++i)
#define ff(i, a, b) for(ll i = a; i < b; ++i)
#define F(i, a, b) for(ll i = a; i >= b; --i)
#define FF(i, a, b) for(ll i = a; i > b; --i)
#define x first
#define y second
#define X real()
#define Y imag()
using namespace std;
typedef complex<ll> P;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;

const int N = 5e5+7;
ll n, ans = 0, b[N], f[N], rmq[N][19];
ii a[N];

ll get_min(ll post){
	ll loga;
	if(post > 1) loga = log2(post-1);
	else loga = 0;
	return min(rmq[0][loga], rmq[post-(1<<loga)][loga]);
}

signed main(){
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n;
	f(i,1,n){
		cin >> a[i].x >> a[i].y;
	}
	sort(a+1, a+1+n);
	rmq[0][0] = -a[1].x;
	f[0] = 0;
	f(i,1,n){
		f[i] = f[i-1] + a[i].y;
		b[i] = f[i]-a[i].x;
		if(i != n){
			rmq[i][0] = f[i]-a[i+1].x;
		} 
	}
	
	f(j,1,18){
		ff(i,0,n){
			if(i + (1<<j) - 1 < n){
				rmq[i][j] = min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
			}
		}
	}
	
	f(i,1,n){
		ans = max(ans, b[i]-get_min(i));
	}
	cout << ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	380 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct
16	Correct	2 ms	504 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	508 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	508 KB	Output is correct
23	Correct	2 ms	504 KB	Output is correct
24	Correct	2 ms	504 KB	Output is correct
25	Correct	2 ms	504 KB	Output is correct
26	Correct	2 ms	504 KB	Output is correct
27	Correct	5 ms	1272 KB	Output is correct
28	Correct	5 ms	1272 KB	Output is correct
29	Correct	5 ms	1276 KB	Output is correct
30	Correct	5 ms	1272 KB	Output is correct
31	Correct	5 ms	1272 KB	Output is correct
32	Correct	5 ms	1272 KB	Output is correct
33	Correct	5 ms	1272 KB	Output is correct
34	Correct	5 ms	1272 KB	Output is correct
35	Correct	5 ms	1272 KB	Output is correct
36	Correct	5 ms	1272 KB	Output is correct
37	Correct	5 ms	1272 KB	Output is correct
38	Correct	5 ms	1272 KB	Output is correct
39	Correct	5 ms	1272 KB	Output is correct
40	Correct	6 ms	1272 KB	Output is correct
41	Correct	6 ms	1272 KB	Output is correct
42	Correct	6 ms	1272 KB	Output is correct
43	Correct	5 ms	1272 KB	Output is correct
44	Correct	5 ms	1272 KB	Output is correct
45	Correct	5 ms	1272 KB	Output is correct
46	Correct	5 ms	1272 KB	Output is correct
47	Correct	5 ms	1272 KB	Output is correct
48	Correct	5 ms	1268 KB	Output is correct
49	Correct	5 ms	1272 KB	Output is correct
50	Correct	5 ms	1276 KB	Output is correct
51	Correct	5 ms	1272 KB	Output is correct
52	Correct	475 ms	90560 KB	Output is correct
53	Correct	480 ms	90352 KB	Output is correct
54	Correct	480 ms	90424 KB	Output is correct
55	Correct	484 ms	90560 KB	Output is correct
56	Correct	474 ms	90396 KB	Output is correct
57	Correct	484 ms	90464 KB	Output is correct
58	Correct	476 ms	90460 KB	Output is correct
59	Correct	463 ms	90360 KB	Output is correct
60	Correct	467 ms	90468 KB	Output is correct
61	Correct	462 ms	90488 KB	Output is correct
62	Correct	468 ms	90424 KB	Output is correct
63	Correct	465 ms	90416 KB	Output is correct
64	Correct	468 ms	90344 KB	Output is correct
65	Correct	469 ms	90560 KB	Output is correct
66	Correct	485 ms	90464 KB	Output is correct
67	Correct	467 ms	90404 KB	Output is correct
68	Correct	467 ms	90360 KB	Output is correct

Submission #127285

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