제출 #1291350

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291350		samarthkulkarni	Fuel Station (NOI20_fuelstation)	C++20	24 / 100	3096 ms	668 KiB

FuelStation

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vi vector<long long>
#define all(x) x.begin(), x.end()
#define endl "\n"

void solution();
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solution();
    return 0;
}


const int MAXN = 1e4+10;


#define pr pair<ll, ll>  
#define ff first
#define ss second


struct point {
	ll X, A, B;

	bool operator<(point temp) {
		if (X == temp.X) return B < temp.B;
		return X < temp.X;
	}
};

point a[MAXN];

const ll inf = 1e18;




void solution() {
	ll n, d; cin >> n >> d;

	for (int i = 0; i < n; i++) {
		cin >> a[i].X >> a[i].A >> a[i].B; 
	}

	a[n].X = d;
	a[n].A = 0;
	a[n].B = 1e9;
	n++;

	sort(a, a+n);
		

	for (ll fuel = 0; fuel <= d; fuel++) {
		ll curr = fuel;
		ll p = 0;
		bool flag = true;

		for (int i = 0; i < n; i++) {
			if (a[i].X - p <= curr) {
				curr -= a[i].X - p;
				p = a[i].X;

				if (fuel <= a[i].B) curr += a[i].A;
			} else {
				flag = false;
				break;
			}
		}


		if (flag) {
			cout << fuel << endl;
			return;
		}

	}



}

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