답안 #684627

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
684627	2023-01-22T07:26:51 Z	pragmatist	Art Exhibition (JOI18_art)	C++17	100 / 100	184 ms	24744 KB

art

/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/

#include<bits/stdc++.h>
 
#define sz(v) (int)v.size()
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl "\n"

using namespace std;

const int N = (int)5e5 + 7; // make sure this is right
const int M = (int)1e3 + 7;
const int inf = (int)2e9 + 7;
const ll INF = (ll)3e18 + 7; 
const ll MOD = (ll)1e9 + 7; // make sure this is right

bool bit(int x, int i) {
	return x >> i & 1;
}

int sum(int x, int y) {
	x += y;
	if(x >= MOD) x -= MOD;
	return x;
}

int n;
pair<ll, int> a[N];
ll p[N];

void solve() {
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i].x >> a[i].y;
	}
	sort(a + 1, a + 1 + n);
	for(int i = 1; i <= n; ++i) {
		p[i] = p[i - 1] + a[i].y;
	}
	ll ans = 0, cur = -INF;
	for(int i = 1; i <= n; ++i) {
		cur = max(cur, a[i].x - p[i - 1]);
	    ans = max(ans, p[i] - a[i].x + cur);
	}
	cout << ans << "\n";
}

signed main() {	
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	int test = 1;
	//cin >> test;
	for(int i = 1; i <= test; ++i) {
	 	//cout << "Case #" << i << ": ";
		solve();
	}
	return 0;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	280 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	280 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	280 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	2 ms	340 KB	Output is correct
28	Correct	2 ms	340 KB	Output is correct
29	Correct	2 ms	340 KB	Output is correct
30	Correct	2 ms	340 KB	Output is correct
31	Correct	2 ms	340 KB	Output is correct
32	Correct	2 ms	340 KB	Output is correct
33	Correct	2 ms	340 KB	Output is correct
34	Correct	2 ms	340 KB	Output is correct
35	Correct	2 ms	420 KB	Output is correct
36	Correct	3 ms	340 KB	Output is correct
37	Correct	3 ms	340 KB	Output is correct
38	Correct	2 ms	340 KB	Output is correct
39	Correct	2 ms	340 KB	Output is correct
40	Correct	2 ms	360 KB	Output is correct
41	Correct	2 ms	340 KB	Output is correct
42	Correct	2 ms	444 KB	Output is correct
43	Correct	2 ms	340 KB	Output is correct
44	Correct	2 ms	340 KB	Output is correct
45	Correct	2 ms	340 KB	Output is correct
46	Correct	2 ms	340 KB	Output is correct
47	Correct	2 ms	408 KB	Output is correct
48	Correct	2 ms	340 KB	Output is correct
49	Correct	2 ms	340 KB	Output is correct
50	Correct	2 ms	340 KB	Output is correct
51	Correct	2 ms	340 KB	Output is correct

Subtask #4

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	280 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	0 ms	340 KB	Output is correct
26	Correct	0 ms	340 KB	Output is correct
27	Correct	2 ms	340 KB	Output is correct
28	Correct	2 ms	340 KB	Output is correct
29	Correct	2 ms	340 KB	Output is correct
30	Correct	2 ms	340 KB	Output is correct
31	Correct	2 ms	340 KB	Output is correct
32	Correct	2 ms	340 KB	Output is correct
33	Correct	2 ms	340 KB	Output is correct
34	Correct	2 ms	340 KB	Output is correct
35	Correct	2 ms	420 KB	Output is correct
36	Correct	3 ms	340 KB	Output is correct
37	Correct	3 ms	340 KB	Output is correct
38	Correct	2 ms	340 KB	Output is correct
39	Correct	2 ms	340 KB	Output is correct
40	Correct	2 ms	360 KB	Output is correct
41	Correct	2 ms	340 KB	Output is correct
42	Correct	2 ms	444 KB	Output is correct
43	Correct	2 ms	340 KB	Output is correct
44	Correct	2 ms	340 KB	Output is correct
45	Correct	2 ms	340 KB	Output is correct
46	Correct	2 ms	340 KB	Output is correct
47	Correct	2 ms	408 KB	Output is correct
48	Correct	2 ms	340 KB	Output is correct
49	Correct	2 ms	340 KB	Output is correct
50	Correct	2 ms	340 KB	Output is correct
51	Correct	2 ms	340 KB	Output is correct
52	Correct	159 ms	11948 KB	Output is correct
53	Correct	167 ms	24600 KB	Output is correct
54	Correct	184 ms	24684 KB	Output is correct
55	Correct	164 ms	24624 KB	Output is correct
56	Correct	161 ms	24676 KB	Output is correct
57	Correct	160 ms	24620 KB	Output is correct
58	Correct	167 ms	24652 KB	Output is correct
59	Correct	162 ms	24664 KB	Output is correct
60	Correct	162 ms	24632 KB	Output is correct
61	Correct	165 ms	24744 KB	Output is correct
62	Correct	180 ms	24676 KB	Output is correct
63	Correct	171 ms	24624 KB	Output is correct
64	Correct	170 ms	24620 KB	Output is correct
65	Correct	162 ms	24628 KB	Output is correct
66	Correct	161 ms	24576 KB	Output is correct
67	Correct	165 ms	24684 KB	Output is correct
68	Correct	159 ms	24568 KB	Output is correct