oj.uz

답안 #1049835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049835 2024-08-09T05:40:11 Z vjudge1 Art Exhibition (JOI18_art) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pll pair<ll, ll>
#define fi first
#define se second
#define all(x) begin(x), end(x)
int main() {
    int n;
    cin >> n;
    vector<pll> a(n);
    for(int i = 0; i < n; i++) cin >> a[i].fi >> a[i].se;
    sort(all(a));
    ll pref[n+1]{}, ans = 0ll;
    pref[0] = a[0].se;
    for(int i = 1; i < n; i++) pref[i] = pref[i-1] + a[i].se;
    for(int i = 0; i < n; i++) {
        int l = i, r = n;
        while(l + 1 < r) {
            int m = (l + r) / 2;
            if(a[i].se + a[i].fi >= a[m].fi) l = m;
            else r = m;
        }
        if(a[i].se + a[i].fi >= a[l].fi) ans = max(ans, pref[l] - (i ? pref[i-1] : 0ll) - a[l].fi + a[i].fi);
    }
    cout << ans;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -