oj.uz

Submission #635821

# Submission time Handle Problem Language Result Execution time Memory
635821 2022-08-27T04:50:53 Z zeroesandones Art Exhibition (JOI18_art) C++17
100 / 100
 206 ms 16600 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define all(x) (x).begin(), (x).end()

#define sc second
#define fr first
#define pb push_back

const ll inf = 1e18 + 5;

void solve()
{
    ll n;
    cin >> n;

    pi a[n + 1] = {};
    FOR(i, 1, n + 1)
        cin >> a[i].fr >> a[i].sc;

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

    // FOR(i, 1, n + 1) {
        // cout << a[i].fr << " " << a[i].sc << nl;
    // }

    ll sum[n + 1] = {};
    FOR(i, 1, n + 1) {
        sum[i] = sum[i - 1] + a[i].sc;
    }

    ll ans = a[1].sc;
    ll mn = sum[0] - a[1].fr;
    FOR(i, 2, n + 1) {
        mn = min(mn, sum[i - 1] - a[i].fr);
        ans = max(ans, sum[i] - a[i].fr - mn);
    }

    cout << ans << nl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 520 KB Output is correct
29 Correct 2 ms 520 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 3 ms 468 KB Output is correct
36 Correct 2 ms 508 KB Output is correct
37 Correct 2 ms 524 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 3 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 508 KB Output is correct
42 Correct 3 ms 468 KB Output is correct
43 Correct 2 ms 508 KB Output is correct
44 Correct 3 ms 524 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 2 ms 456 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 3 ms 468 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 288 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 520 KB Output is correct
29 Correct 2 ms 520 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 3 ms 468 KB Output is correct
36 Correct 2 ms 508 KB Output is correct
37 Correct 2 ms 524 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 3 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 508 KB Output is correct
42 Correct 3 ms 468 KB Output is correct
43 Correct 2 ms 508 KB Output is correct
44 Correct 3 ms 524 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 2 ms 456 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 3 ms 468 KB Output is correct
52 Correct 173 ms 16460 KB Output is correct
53 Correct 179 ms 16436 KB Output is correct
54 Correct 186 ms 16464 KB Output is correct
55 Correct 169 ms 16440 KB Output is correct
56 Correct 169 ms 16468 KB Output is correct
57 Correct 172 ms 16412 KB Output is correct
58 Correct 183 ms 16576 KB Output is correct
59 Correct 179 ms 16412 KB Output is correct
60 Correct 167 ms 16440 KB Output is correct
61 Correct 195 ms 16448 KB Output is correct
62 Correct 171 ms 16452 KB Output is correct
63 Correct 181 ms 16584 KB Output is correct
64 Correct 166 ms 16504 KB Output is correct
65 Correct 187 ms 16532 KB Output is correct
66 Correct 206 ms 16520 KB Output is correct
67 Correct 168 ms 16460 KB Output is correct
68 Correct 176 ms 16600 KB Output is correct