제출 #547057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
547057		d2k05	Fuel Station (NOI20_fuelstation)	C++14	13 / 100	222 ms	12860 KiB

FuelStation

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 1e6 + 5;

int n, d;
pair <int, pair <int, int> > a[N];

double mx(double f) {
	double cur = f, now = 0;
	for (int i = 1; i <= n; ++i) {
		if (cur >= a[i].first - now) {
			cur -= a[i].first - now;
			now = a[i].first;
		} 
		else 
			return now + cur;
		if (f <= a[i].second.second)
			cur += a[i].second.first;
	}
	return min(d * 1.0, now + cur);
}

int main() {
	ios :: sync_with_stdio(0), cin.tie(0);
	cin >> n >> d;
	for (int i = 1; i <= n; ++i) cin >> a[i].first >> a[i].second.first >> a[i].second.second;
	sort(a + 1, a + 1 + n);
	double lb = 0, rb = d;
	for (int i = 0; i < 100; ++i) {
		double md1 = lb + (rb - lb) / 3;
		double md2 = rb - (rb - lb) / 3;
		if (md2 < md1) break;
		if (mx(md1) > mx(md2)) {
			rb = md2;
		} else if (mx(md1) < mx(md2)) {
			lb = md1;
		} else {
			rb = md1;
		}
	}
	cout << fixed << setprecision(0) << lb;
	return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 13 / 13
• Subtask 3: 0 / 17
• Subtask 4: 0 / 12
• Subtask 5: 0 / 19
• Subtask 6: 0 / 11
• Subtask 7: 0 / 21