oj.uz

답안 #112263

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
112263 2019-05-18T07:54:45 Z dolphingarlic Art Exhibition (JOI18_art) C++14
0 / 100
 2 ms 384 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

pair<ll, ll> a[500001];
ll pref[500001]{0};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    FOR(i, 1, n + 1) cin >> a[i].first >> a[i].second;
    sort(a + 1, a + n + 1);
    FOR(i, 1, n + 1) pref[i] = pref[i - 1] + a[i].second;
    int l = 1;
    ll ans = a[1].second;
    FOR(i, 2, n + 1) {
        ll diff = a[i].first - a[i - 1].first + a[i].second;
        while (diff < 0) {
            diff += a[l++].second;
        }
        // cout << l << ' ' << i << ' ' << diff << ' ' << ans << ' ' << pref[i]
        // << ' ' << pref[l - 1] << '\n';
        ans = max(ans, (pref[i] - pref[l - 1]) - (a[i].first - a[l].first));
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -