oj.uz

Submission #586574

# Submission time Handle Problem Language Result Execution time Memory
586574 2022-06-30T11:53:10 Z TheEvilBird Art Exhibition (JOI18_art) C++17
0 / 100
 0 ms 212 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());

void solve() {
    int n;
    cin >> n;
    vector<pll> a(n + 1, {0, 0});
    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));
    int i = 1;
    while (i <= n && a[i].first > a[i - 1].first + a[i - 1].second) {
        ++i;
    }
//    --i;
    ll now = a[i - 1].first + a[i - 1].second;
    for (; i <= n; ++i) {
        now += a[i].second;
        now -= a[i].first;
        ans = max(ans, now);
        now += a[i].first;
    }
    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;
}

Subtask #1
0 / 10.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 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.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 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.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 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 50.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 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -