답안 #879759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
879759	2023-11-28T05:00:15 Z	The_Samurai	금 캐기 (IZhO14_divide)	C++17	100 / 100	47 ms	11848 KB

divide

// I stand with PALESTINE




//#pragma GCC optimize("Ofast,O3")
//#pragma GCC target("avx,avx2")
#include "bits/stdc++.h"

using namespace std;
using ll = long long;

void solve() {
    int n;
    cin >> n;
    vector<int> x(n), g(n), d(n), best(n);
    for (int i = 0; i < n; i++) cin >> x[i] >> g[i] >> d[i];
    vector<ll> pref_g(n);
    for (int i = 0; i < n; i++) pref_g[i] = (i > 0 ? pref_g[i - 1] : 0ll) + g[i];
    ll ans = 0, sum_d = 0;
    set<pair<ll, int>, greater<>> need;
    for (int i = 0; i < n; i++) {
        sum_d += d[i];
        need.emplace(x[i] - x[0] - sum_d, i);
    }
    sum_d = 0;
    for (int i = 0; i < n; i++) {
        if (i) best[i] = best[i - 1];
        auto it = need.lower_bound(make_pair(x[i] - x[0] - sum_d, (int) 1e9));
        while (it != need.end()) {
            best[i] = max(best[i], it->second);
            need.erase(it);
            it = need.lower_bound(make_pair(x[i] - x[0] - sum_d, (int) 1e9));
        }
//        cout << i << ' ' << pref_g[best[i]] - (i > 0 ? pref_g[i - 1] : 0) << endl;
        ans = max(ans, pref_g[best[i]] - (i > 0 ? pref_g[i - 1] : 0));
        sum_d += d[i];
    }
    cout << ans;
}

int main() {
    cin.tie(0)->sync_with_stdio(false);
#ifdef sunnatov
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int q = 1;
//    cin >> q;
    while (q--) {
        solve();
        cout << '\n';
    }
}

Subtask #1

17.0 / 17.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	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct

Subtask #2

31.0 / 31.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	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	2 ms	860 KB	Output is correct
24	Correct	2 ms	860 KB	Output is correct

Subtask #3

52.0 / 52.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	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	2 ms	860 KB	Output is correct
24	Correct	2 ms	860 KB	Output is correct
25	Correct	2 ms	860 KB	Output is correct
26	Correct	3 ms	1372 KB	Output is correct
27	Correct	3 ms	1376 KB	Output is correct
28	Correct	19 ms	5632 KB	Output is correct
29	Correct	19 ms	5952 KB	Output is correct
30	Correct	47 ms	11848 KB	Output is correct
31	Correct	44 ms	10584 KB	Output is correct
32	Correct	40 ms	10832 KB	Output is correct
33	Correct	31 ms	10584 KB	Output is correct
34	Correct	34 ms	10580 KB	Output is correct
35	Correct	41 ms	10976 KB	Output is correct
36	Correct	34 ms	11356 KB	Output is correct