oj.uz

Submission #934768

# Submission time Handle Problem Language Result Execution time Memory
934768 2024-02-28T00:23:25 Z Whisper Art Exhibition (JOI18_art) C++17
0 / 100
 1 ms 2396 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 5e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numPic;
pair<int, int> a[MAX];
int s[MAX];
struct FenwickTree{
    int n;
    vector<int> f;
    FenwickTree(int _n){
        this -> n = _n;
        f.resize(n + 5, -1e16);
    }

    void modify(int p, int val){
        for ( ; p <= n; p += p & (-p)) maximize(f[p], val);
    }
    int query(int p){
        int res = 0;
        for ( ; p > 0; p -= p & (-p)) maximize(res, f[p]);
        return res;
    }
    int query(int l, int r){
        return query(r) - query(l - 1);
    }
};
void Whisper(){
    cin >> numPic;
    for (int i = 1; i <= numPic; ++i){
        cin >> a[i].first >> a[i].second;
    }
    sort(a + 1, a + numPic + 1);
    for (int i = 1; i <= numPic; ++i) s[i] = s[i - 1] + a[i].second;
    FenwickTree fen(numPic);

    int ans = -1e16;
    for (int i = 1; i <= numPic; ++i){
        maximize(ans, fen.query(i) + s[i] - a[i].first);
        fen.modify(i, -s[i - 1] + a[i].first);
    }
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -