답안 #496098

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
496098	2021-12-20T16:35:14 Z	shmad	금 캐기 (IZhO14_divide)	C++17	48 / 100	1000 ms	2276 KB

divide

#include <bits/stdc++.h>
 
#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvi = vt< vt<int> >;
 
const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 20);
const double eps = 1e-6;
 
bool check (int k, vt<int> p, int d, int x) {
	return (p[k] <= d - x);
}
 
void solve () {
	int n;
	cin >> n;
	vt<int> x(n + 1), g(n + 1), d(n + 1), p(n + 1, inf);
	for (int i = 1; i <= n; i++) cin >> x[i] >> g[i] >> d[i];
	partial_sum(all(g), g.begin());
	partial_sum(all(d), d.begin());
	for (int i = 1; i <= n; i++) p[i] = min(p[i - 1], d[i - 1] - x[i]);
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		int l = 0;
		for (int mid = LIM; mid ; mid >>= 1) if (l + mid <= i && !check(l + mid, p, d[i], x[i])) l += mid;
		l++;
		ans = max(ans, g[i] - g[l - 1]);
	}
	cout << ans;
	cout << '\n';
}
 
bool testcases = 0;
 
signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int test = 1;
    if (testcases) cin >> test;
    for (int cs = 1; cs <= test; cs++) {
        solve();
    }
}

Subtask #1

17.0 / 17.0

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

Subtask #2

31.0 / 31.0

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

Subtask #3

0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	4 ms	332 KB	Output is correct
19	Correct	3 ms	332 KB	Output is correct
20	Correct	3 ms	332 KB	Output is correct
21	Correct	4 ms	332 KB	Output is correct
22	Correct	7 ms	332 KB	Output is correct
23	Correct	45 ms	460 KB	Output is correct
24	Correct	46 ms	460 KB	Output is correct
25	Correct	75 ms	488 KB	Output is correct
26	Correct	275 ms	684 KB	Output is correct
27	Correct	282 ms	688 KB	Output is correct
28	Execution timed out	1093 ms	2276 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-