oj.uz

Submission #880407

# Submission time Handle Problem Language Result Execution time Memory
880407 2023-11-29T11:03:23 Z frostray8653 Art Exhibition (JOI18_art) C++17
100 / 100
 159 ms 20060 KB 
#include <bits/stdc++.h>
#define int long long
#define IO ios::sync_with_stdio(0), cin.tie(0)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
using pii = pair<int, int>;
void dbg() {;}
template<class T, class ...U>
void dbg(T a, U ...b) { cout << a << " "; dbg(b...); }
void ent() { cout << "\n"; }
const int INF = 1e17;
const int N = 500005;
pii a[N];
int pre[N];
int bef[N], bck[N];

signed main() {
    IO;
    
    int n;
    cin >> n;
    FOR(i, 1, n) cin >> a[i].first >> a[i].second;
    sort(a + 1, a + n + 1, [&](pii p, pii q) {
        return p.first < q.first;
    });
    
    FOR(i, 1, n)
        pre[i] = pre[i - 1] + a[i].second;

    bef[0] = -INF;
    for (int i = 1; i <= n; i++) {
        bef[i] = a[i].first - pre[i - 1];
        bef[i] = max(bef[i], bef[i - 1]);
    }
    bck[n + 1] = -INF;
    for (int i = n; i >= 1; i--) {
        bck[i] = pre[i] - a[i].first;
        bck[i] = max(bck[i], bck[i + 1]);
    }
    int ans = -INF;
    for (int i = 1; i <= n; i++)
        ans = max(ans, bef[i] + bck[i]);

    cout << ans << "\n";

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4468 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4580 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 2 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 2 ms 4612 KB Output is correct
35 Correct 2 ms 4444 KB Output is correct
36 Correct 2 ms 4444 KB Output is correct
37 Correct 2 ms 4444 KB Output is correct
38 Correct 2 ms 4444 KB Output is correct
39 Correct 2 ms 4444 KB Output is correct
40 Correct 2 ms 4444 KB Output is correct
41 Correct 2 ms 4444 KB Output is correct
42 Correct 2 ms 4444 KB Output is correct
43 Correct 2 ms 4444 KB Output is correct
44 Correct 2 ms 4564 KB Output is correct
45 Correct 2 ms 4444 KB Output is correct
46 Correct 2 ms 4448 KB Output is correct
47 Correct 2 ms 4448 KB Output is correct
48 Correct 3 ms 4448 KB Output is correct
49 Correct 2 ms 4448 KB Output is correct
50 Correct 2 ms 4564 KB Output is correct
51 Correct 2 ms 4448 KB Output is correct
52 Correct 130 ms 20060 KB Output is correct
53 Correct 130 ms 19792 KB Output is correct
54 Correct 124 ms 19796 KB Output is correct
55 Correct 125 ms 19908 KB Output is correct
56 Correct 146 ms 20004 KB Output is correct
57 Correct 125 ms 19792 KB Output is correct
58 Correct 124 ms 19792 KB Output is correct
59 Correct 159 ms 19908 KB Output is correct
60 Correct 122 ms 19912 KB Output is correct
61 Correct 125 ms 19796 KB Output is correct
62 Correct 123 ms 19796 KB Output is correct
63 Correct 130 ms 19804 KB Output is correct
64 Correct 125 ms 19792 KB Output is correct
65 Correct 153 ms 19912 KB Output is correct
66 Correct 125 ms 19792 KB Output is correct
67 Correct 125 ms 19916 KB Output is correct
68 Correct 126 ms 19804 KB Output is correct