답안 #212596

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
212596	2020-03-23T18:12:33 Z	eggag32	Art Exhibition (JOI18_art)	C++17	100 / 100	285 ms	37128 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))
const int MAXN = 5e5 + 5;

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

int n;
ll b[MAXN], s1[4 * MAXN];

void build(int id = 1, int l = 1, int r = n + 1){
	if(r - l < 2){
		s1[id] = b[l];
		return;
	}
	int mid = (l + r) / 2;
	build(id * 2, l, mid);
	build(id * 2 + 1, mid, r);
	s1[id] = max(s1[id * 2], s1[id * 2 + 1]);
}

ll maxQ(int x, int y, int id = 1, int l = 1, int r = n + 1){
	if(x >= r || l >= y) return -1e18;
	if(x <= l && r <= y) return s1[id];
	int mid = (l + r) / 2;
	return max(maxQ(x, y, id * 2, l, mid), maxQ(x, y, id * 2 + 1, mid, r));
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	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) b[i] = sum[i] - a[i].fi;
	build();
	repn(i, 1, n + 1){
		//we need to have the maximum valueSum - 
		ll mxScore = maxQ(i, n + 1);
		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

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	4 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	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	4 ms	384 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	4 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	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	4 ms	384 KB	Output is correct
12	Correct	4 ms	256 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	4 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	5 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	4 ms	384 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	4 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	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	4 ms	384 KB	Output is correct
12	Correct	4 ms	256 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	4 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	5 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	4 ms	384 KB	Output is correct
27	Correct	7 ms	640 KB	Output is correct
28	Correct	7 ms	640 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	8 ms	640 KB	Output is correct
33	Correct	7 ms	640 KB	Output is correct
34	Correct	7 ms	640 KB	Output is correct
35	Correct	7 ms	640 KB	Output is correct
36	Correct	9 ms	640 KB	Output is correct
37	Correct	7 ms	640 KB	Output is correct
38	Correct	7 ms	640 KB	Output is correct
39	Correct	7 ms	640 KB	Output is correct
40	Correct	8 ms	640 KB	Output is correct
41	Correct	7 ms	640 KB	Output is correct
42	Correct	8 ms	640 KB	Output is correct
43	Correct	7 ms	640 KB	Output is correct
44	Correct	7 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	7 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	8 ms	768 KB	Output is correct
51	Correct	7 ms	640 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	4 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	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	4 ms	384 KB	Output is correct
12	Correct	4 ms	256 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	4 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	5 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	4 ms	384 KB	Output is correct
27	Correct	7 ms	640 KB	Output is correct
28	Correct	7 ms	640 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	8 ms	640 KB	Output is correct
33	Correct	7 ms	640 KB	Output is correct
34	Correct	7 ms	640 KB	Output is correct
35	Correct	7 ms	640 KB	Output is correct
36	Correct	9 ms	640 KB	Output is correct
37	Correct	7 ms	640 KB	Output is correct
38	Correct	7 ms	640 KB	Output is correct
39	Correct	7 ms	640 KB	Output is correct
40	Correct	8 ms	640 KB	Output is correct
41	Correct	7 ms	640 KB	Output is correct
42	Correct	8 ms	640 KB	Output is correct
43	Correct	7 ms	640 KB	Output is correct
44	Correct	7 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	7 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	8 ms	768 KB	Output is correct
51	Correct	7 ms	640 KB	Output is correct
52	Correct	271 ms	24264 KB	Output is correct
53	Correct	281 ms	36856 KB	Output is correct
54	Correct	274 ms	36832 KB	Output is correct
55	Correct	276 ms	36944 KB	Output is correct
56	Correct	275 ms	37128 KB	Output is correct
57	Correct	275 ms	36856 KB	Output is correct
58	Correct	264 ms	36856 KB	Output is correct
59	Correct	271 ms	36856 KB	Output is correct
60	Correct	266 ms	36856 KB	Output is correct
61	Correct	277 ms	36984 KB	Output is correct
62	Correct	268 ms	36856 KB	Output is correct
63	Correct	268 ms	36832 KB	Output is correct
64	Correct	283 ms	36856 KB	Output is correct
65	Correct	272 ms	36856 KB	Output is correct
66	Correct	285 ms	37112 KB	Output is correct
67	Correct	277 ms	36856 KB	Output is correct
68	Correct	278 ms	36856 KB	Output is correct

답안 #212596

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