oj.uz

답안 #466482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466482 2021-08-19T12:34:32 Z spike1236 Art Exhibition (JOI18_art) C++14
100 / 100
 216 ms 16556 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

const int MAXN = 5e5 + 10;
int n;
pll a[MAXN];
int ord[MAXN];
ll pref[MAXN];

void solve() {
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> a[i].f >> a[i].s;
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= n; ++i)
        pref[i] = pref[i - 1] + a[i].s;
    ll ans = a[1].s, res = -a[1].f;
    for(int i = 2; i <= n; ++i) {
        ans = max(ans, max(a[i].s, pref[i] - a[i].f - res));
        res = min(res, pref[i - 1] - a[i].f);
    }
    if(n <= 5000) {
        for(int i = 1; i <= n; ++i)
            for(int j = i; j <= n; ++j) ans = max(ans, pref[j] - a[j].f - (pref[i - 1] - a[i].f));
    }
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int CNT_TESTS = 1;
    ///cin >> CNT_TESTS;
    for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
        solve();
        if(NUMCASE != CNT_TESTS) cout << '\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 17 ms 460 KB Output is correct
28 Correct 17 ms 460 KB Output is correct
29 Correct 17 ms 460 KB Output is correct
30 Correct 19 ms 460 KB Output is correct
31 Correct 17 ms 576 KB Output is correct
32 Correct 17 ms 576 KB Output is correct
33 Correct 17 ms 572 KB Output is correct
34 Correct 17 ms 576 KB Output is correct
35 Correct 17 ms 460 KB Output is correct
36 Correct 17 ms 460 KB Output is correct
37 Correct 17 ms 568 KB Output is correct
38 Correct 17 ms 572 KB Output is correct
39 Correct 17 ms 460 KB Output is correct
40 Correct 17 ms 576 KB Output is correct
41 Correct 17 ms 460 KB Output is correct
42 Correct 17 ms 568 KB Output is correct
43 Correct 19 ms 572 KB Output is correct
44 Correct 18 ms 576 KB Output is correct
45 Correct 18 ms 460 KB Output is correct
46 Correct 18 ms 460 KB Output is correct
47 Correct 17 ms 460 KB Output is correct
48 Correct 19 ms 572 KB Output is correct
49 Correct 18 ms 572 KB Output is correct
50 Correct 17 ms 568 KB Output is correct
51 Correct 17 ms 568 KB Output is correct
52 Correct 211 ms 12476 KB Output is correct
53 Correct 210 ms 16488 KB Output is correct
54 Correct 210 ms 16448 KB Output is correct
55 Correct 209 ms 16516 KB Output is correct
56 Correct 210 ms 16480 KB Output is correct
57 Correct 210 ms 16532 KB Output is correct
58 Correct 207 ms 16448 KB Output is correct
59 Correct 208 ms 16492 KB Output is correct
60 Correct 206 ms 16556 KB Output is correct
61 Correct 216 ms 16520 KB Output is correct
62 Correct 210 ms 16504 KB Output is correct
63 Correct 211 ms 16420 KB Output is correct
64 Correct 212 ms 16460 KB Output is correct
65 Correct 208 ms 16524 KB Output is correct
66 Correct 209 ms 16448 KB Output is correct
67 Correct 209 ms 16460 KB Output is correct
68 Correct 212 ms 16476 KB Output is correct