oj.uz

답안 #334237

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334237 2020-12-08T17:58:09 Z limabeans 금 캐기 (IZhO14_divide) C++17
48 / 100
 1000 ms 2796 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;
	}
    };

    auto print = [&]() {
	return;
	for (auto p: mp) cout<<p.first<<": "<<p.second<<endl;
	cout<<endl;
    };

    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]);
	for (; iter!=mp.end(); ++iter) {
	    ans = max(ans, g[i] + iter->second);
	}
	print();
    }

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

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 236 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 236 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 6 ms 492 KB Output is correct
19 Correct 4 ms 492 KB Output is correct
20 Correct 4 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 4 ms 748 KB Output is correct
24 Correct 4 ms 748 KB Output is correct

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 236 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 6 ms 492 KB Output is correct
19 Correct 4 ms 492 KB Output is correct
20 Correct 4 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 4 ms 748 KB Output is correct
24 Correct 4 ms 748 KB Output is correct
25 Correct 77 ms 876 KB Output is correct
26 Correct 320 ms 1260 KB Output is correct
27 Correct 304 ms 1260 KB Output is correct
28 Execution timed out 1095 ms 2796 KB Time limit exceeded
29 Halted 0 ms 0 KB -