답안 #46281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
46281 2018-04-18T17:31:37 Z fredbr Art Exhibition (JOI18_art) C++17
100 / 100
128 ms 24204 KB
#include <bits/stdc++.h>

#define ff first
#define ss second

using namespace std;

typedef long long ll;
typedef pair<ll, ll> ii;

const int maxn = 500010;
const ll inf = 0x3f3f3f3f3f3f3f3f;

ll p[maxn];
ii v[maxn];

ll a[maxn];
ll b[maxn];

ll s[maxn];

inline ll scan () {
	ll result = 0;
	char ch;
	ch = getchar_unlocked();
	while (true) {
		if (ch >= '0' && ch <= '9') break;
		ch = getchar_unlocked();
	}
	result = ch-'0';
	while (true) {
		ch = getchar_unlocked();
		if (ch < '0' || ch > '9') break;
		result = result*10ll + (ch - '0');
	}
	return result;
}

int main()
{
	int n = scan();

	for (int i = 1; i <= n; i++) v[i].ff = scan(), v[i].ss = scan();

	sort(v+1, v+1+n);

	for (int i = 1; i <= n; i++) p[i] = p[i-1] + v[i].ss;

	for (int i = 1; i <= n; i++) a[i] = -p[i-1] + v[i].ff;

	for (int i = 1; i <= n; i++) b[i] = p[i]-v[i].ff;

	s[n+1] = -inf;
	for (int i = n; i >= 1; i--) s[i] = max(s[i+1], b[i]);

	ll ans = -inf;

	for (int i = 1; i <= n; i++) ans = max(ans, a[i]+s[i]);

	printf("%lld\n", ans);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 520 KB Output is correct
6 Correct 1 ms 520 KB Output is correct
7 Correct 2 ms 616 KB Output is correct
8 Correct 2 ms 616 KB Output is correct
9 Correct 2 ms 616 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 2 ms 616 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 520 KB Output is correct
6 Correct 1 ms 520 KB Output is correct
7 Correct 2 ms 616 KB Output is correct
8 Correct 2 ms 616 KB Output is correct
9 Correct 2 ms 616 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 2 ms 616 KB Output is correct
12 Correct 2 ms 616 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 520 KB Output is correct
6 Correct 1 ms 520 KB Output is correct
7 Correct 2 ms 616 KB Output is correct
8 Correct 2 ms 616 KB Output is correct
9 Correct 2 ms 616 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 2 ms 616 KB Output is correct
12 Correct 2 ms 616 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 3 ms 868 KB Output is correct
28 Correct 3 ms 868 KB Output is correct
29 Correct 3 ms 868 KB Output is correct
30 Correct 3 ms 868 KB Output is correct
31 Correct 3 ms 868 KB Output is correct
32 Correct 3 ms 948 KB Output is correct
33 Correct 3 ms 948 KB Output is correct
34 Correct 4 ms 948 KB Output is correct
35 Correct 3 ms 948 KB Output is correct
36 Correct 3 ms 948 KB Output is correct
37 Correct 3 ms 948 KB Output is correct
38 Correct 3 ms 992 KB Output is correct
39 Correct 3 ms 992 KB Output is correct
40 Correct 4 ms 992 KB Output is correct
41 Correct 3 ms 992 KB Output is correct
42 Correct 3 ms 992 KB Output is correct
43 Correct 3 ms 992 KB Output is correct
44 Correct 3 ms 992 KB Output is correct
45 Correct 3 ms 992 KB Output is correct
46 Correct 3 ms 992 KB Output is correct
47 Correct 3 ms 992 KB Output is correct
48 Correct 3 ms 992 KB Output is correct
49 Correct 3 ms 992 KB Output is correct
50 Correct 3 ms 992 KB Output is correct
51 Correct 3 ms 992 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 2 ms 480 KB Output is correct
5 Correct 2 ms 520 KB Output is correct
6 Correct 1 ms 520 KB Output is correct
7 Correct 2 ms 616 KB Output is correct
8 Correct 2 ms 616 KB Output is correct
9 Correct 2 ms 616 KB Output is correct
10 Correct 2 ms 616 KB Output is correct
11 Correct 2 ms 616 KB Output is correct
12 Correct 2 ms 616 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 3 ms 868 KB Output is correct
28 Correct 3 ms 868 KB Output is correct
29 Correct 3 ms 868 KB Output is correct
30 Correct 3 ms 868 KB Output is correct
31 Correct 3 ms 868 KB Output is correct
32 Correct 3 ms 948 KB Output is correct
33 Correct 3 ms 948 KB Output is correct
34 Correct 4 ms 948 KB Output is correct
35 Correct 3 ms 948 KB Output is correct
36 Correct 3 ms 948 KB Output is correct
37 Correct 3 ms 948 KB Output is correct
38 Correct 3 ms 992 KB Output is correct
39 Correct 3 ms 992 KB Output is correct
40 Correct 4 ms 992 KB Output is correct
41 Correct 3 ms 992 KB Output is correct
42 Correct 3 ms 992 KB Output is correct
43 Correct 3 ms 992 KB Output is correct
44 Correct 3 ms 992 KB Output is correct
45 Correct 3 ms 992 KB Output is correct
46 Correct 3 ms 992 KB Output is correct
47 Correct 3 ms 992 KB Output is correct
48 Correct 3 ms 992 KB Output is correct
49 Correct 3 ms 992 KB Output is correct
50 Correct 3 ms 992 KB Output is correct
51 Correct 3 ms 992 KB Output is correct
52 Correct 118 ms 24056 KB Output is correct
53 Correct 116 ms 24056 KB Output is correct
54 Correct 113 ms 24136 KB Output is correct
55 Correct 113 ms 24136 KB Output is correct
56 Correct 112 ms 24136 KB Output is correct
57 Correct 115 ms 24136 KB Output is correct
58 Correct 118 ms 24136 KB Output is correct
59 Correct 115 ms 24136 KB Output is correct
60 Correct 112 ms 24136 KB Output is correct
61 Correct 113 ms 24136 KB Output is correct
62 Correct 114 ms 24136 KB Output is correct
63 Correct 118 ms 24136 KB Output is correct
64 Correct 111 ms 24136 KB Output is correct
65 Correct 116 ms 24136 KB Output is correct
66 Correct 113 ms 24136 KB Output is correct
67 Correct 118 ms 24136 KB Output is correct
68 Correct 128 ms 24204 KB Output is correct