oj.uz

답안 #334239

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334239 2020-12-08T17:59:17 Z limabeans 금 캐기 (IZhO14_divide) C++17
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;


const int maxn = 1e6 + 5;


int n;
ll x[maxn], g[maxn], d[maxn];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);
    cin>>n;
    for (int i=1; i<=n; i++) {
	cin>>x[i]>>g[i]>>d[i];
	g[i]+=g[i-1];
	d[i]+=d[i-1];
    }




    map<ll,ll> mp; // mono-decreasing

    auto insert = [&](ll k, ll v) {
	if (!mp.count(k)) {
	    mp[k] = v;
	} else {
	    mp[k] = max(mp[k], v);
	}
	auto iter = mp.lower_bound(k);
	if (iter == mp.begin()) return;

	--iter;
	
	while (true) {
	    if (iter->second > v) break;
	    auto it2 = iter;
	    bool done = false;
	    if (it2==mp.begin()) {
		done=true;
	    } else {
		--it2;
	    }
	    mp.erase(iter);
	    if (done) break;
	    iter = it2;
	}
    };

    ll ans = 0;

    for (int i=1; i<=n; i++) {
	insert(x[i]-d[i-1], -g[i-1]);
	auto iter = mp.lower_bound(x[i]-d[i]);
	if (iter != mp.end()) {
	    ans = max(ans, g[i]+iter->second);
	}
    }

    cout<<ans<<endl;
    return 0;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 31.0

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

Subtask #3
0 / 52.0

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