oj.uz

Submission #471071

# Submission time Handle Problem Language Result Execution time Memory
471071 2021-09-07T01:54:39 Z jalsol Art Exhibition (JOI18_art) C++17
50 / 100
 1000 ms 20652 KB 
// looking to shine brighter in this world...

#define TASK "art"

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// ================================================================================

constexpr int maxn = 5e5 + 5;

int n;
pair<ll, int> a[maxn];

signed main() {
    cin >> n;
    For (i, 1, n) cin >> a[i].first >> a[i].second;

    sort(a + 1, a + n + 1);
    ll ans = 0;

    For (i, 1, n) {
        ll sum = 0;

        For (j, i, n) {
            sum += a[j].second;
            chmax(ans, sum - (a[j].first - a[i].first));
        }
    }

    cout << ans << '\n';

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 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 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 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 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 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 18 ms 460 KB Output is correct
28 Correct 24 ms 460 KB Output is correct
29 Correct 23 ms 460 KB Output is correct
30 Correct 23 ms 460 KB Output is correct
31 Correct 18 ms 520 KB Output is correct
32 Correct 18 ms 456 KB Output is correct
33 Correct 18 ms 524 KB Output is correct
34 Correct 24 ms 460 KB Output is correct
35 Correct 18 ms 460 KB Output is correct
36 Correct 19 ms 528 KB Output is correct
37 Correct 18 ms 456 KB Output is correct
38 Correct 18 ms 528 KB Output is correct
39 Correct 18 ms 520 KB Output is correct
40 Correct 18 ms 440 KB Output is correct
41 Correct 18 ms 460 KB Output is correct
42 Correct 18 ms 516 KB Output is correct
43 Correct 23 ms 460 KB Output is correct
44 Correct 23 ms 460 KB Output is correct
45 Correct 18 ms 524 KB Output is correct
46 Correct 18 ms 460 KB Output is correct
47 Correct 18 ms 520 KB Output is correct
48 Correct 18 ms 520 KB Output is correct
49 Correct 18 ms 524 KB Output is correct
50 Correct 18 ms 516 KB Output is correct
51 Correct 18 ms 524 KB Output is correct

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 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 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 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 18 ms 460 KB Output is correct
28 Correct 24 ms 460 KB Output is correct
29 Correct 23 ms 460 KB Output is correct
30 Correct 23 ms 460 KB Output is correct
31 Correct 18 ms 520 KB Output is correct
32 Correct 18 ms 456 KB Output is correct
33 Correct 18 ms 524 KB Output is correct
34 Correct 24 ms 460 KB Output is correct
35 Correct 18 ms 460 KB Output is correct
36 Correct 19 ms 528 KB Output is correct
37 Correct 18 ms 456 KB Output is correct
38 Correct 18 ms 528 KB Output is correct
39 Correct 18 ms 520 KB Output is correct
40 Correct 18 ms 440 KB Output is correct
41 Correct 18 ms 460 KB Output is correct
42 Correct 18 ms 516 KB Output is correct
43 Correct 23 ms 460 KB Output is correct
44 Correct 23 ms 460 KB Output is correct
45 Correct 18 ms 524 KB Output is correct
46 Correct 18 ms 460 KB Output is correct
47 Correct 18 ms 520 KB Output is correct
48 Correct 18 ms 520 KB Output is correct
49 Correct 18 ms 524 KB Output is correct
50 Correct 18 ms 516 KB Output is correct
51 Correct 18 ms 524 KB Output is correct
52 Execution timed out 1081 ms 20652 KB Time limit exceeded
53 Halted 0 ms 0 KB -