Submission #586764

# Submission time Handle Problem Language Result Execution time Memory
586764 2022-06-30T16:39:50 Z TheEvilBird Art Exhibition (JOI18_art) C++17
100 / 100
206 ms 20828 KB
#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <numeric>
#include <string>
#include <bitset>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <random>
#include <ctime>
#include <chrono>

using namespace std;

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

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
//typedef __int128_t int128;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const char en = '\n';
const int INF = 1e9 + 7;
const ll INFLL = 1e18;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

#ifdef __APPLE__
#include "debug.h"
//#define debug(...) 42
#else
#define debug(...) 42
#endif

void solve() {
    int n;
    cin >> n;
    vector<pll> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i].first >> a[i].second;
    }
    sort(all(a));
    ll ans = a[0].second;
    ll prev = a[0].second, now = 0;
    for (int i = 1; i < n; ++i) {
        now = a[i].second;
        now += max(0LL, prev + a[i - 1].first - a[i].first);
        ans = max(ans, now);
        prev = now;
    }
    cout << ans << en;
}

void stupid() {
    int n;
    cin >> n;
    vector<pll> a(n);
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        cin >> a[i].first >> a[i].second;
        ans = max(ans, a[i].second);
    }
    sort(all(a));
    for (int i = 0; i < n; ++i) {
        ll now = a[i].first + a[i].second;
        for (int j = i + 1; j < n; ++j) {
            now += a[j].second;
            now -= a[j].first;
            ans = max(ans, now);
            now += a[j].first;
        }
    }
    cout << ans << en;
}

int main() {
#ifdef __APPLE__
    freopen("input.txt", "r", stdin);
#else
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif
    solve();
//    stupid();
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 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 340 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 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 340 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 532 KB Output is correct
32 Correct 2 ms 532 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 532 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 468 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 2 ms 516 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 464 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 464 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 2 ms 464 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 2 ms 528 KB Output is correct
51 Correct 2 ms 468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 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 340 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 532 KB Output is correct
32 Correct 2 ms 532 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 532 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 468 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 2 ms 516 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 464 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 464 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 2 ms 468 KB Output is correct
46 Correct 2 ms 464 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 2 ms 528 KB Output is correct
51 Correct 2 ms 468 KB Output is correct
52 Correct 167 ms 17984 KB Output is correct
53 Correct 179 ms 20704 KB Output is correct
54 Correct 206 ms 20812 KB Output is correct
55 Correct 169 ms 20692 KB Output is correct
56 Correct 176 ms 20700 KB Output is correct
57 Correct 171 ms 20808 KB Output is correct
58 Correct 168 ms 20704 KB Output is correct
59 Correct 175 ms 20828 KB Output is correct
60 Correct 171 ms 20820 KB Output is correct
61 Correct 205 ms 20572 KB Output is correct
62 Correct 167 ms 20816 KB Output is correct
63 Correct 171 ms 20700 KB Output is correct
64 Correct 164 ms 20696 KB Output is correct
65 Correct 181 ms 20696 KB Output is correct
66 Correct 178 ms 20808 KB Output is correct
67 Correct 165 ms 20812 KB Output is correct
68 Correct 168 ms 20804 KB Output is correct