제출 #952679

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
952679		Mohamed_Kachef06	Fuel Station (NOI20_fuelstation)	C++17	0 / 100	3050 ms	32472 KiB

FuelStation

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


void doWork(){
    int n , d;
    cin >> n >> d;
    vector<array<int , 3>> v(n+1); 
    vector<array<int , 3>> u(n+1); 
    int arr[n+1] = {};
    // arr[i] = cost to go from i to i+1

    for (int i=  1 ; i <= n ; i++){
        for (int j = 0 ; j < 3 ; j++){
            cin >> v[i][j]; 
        }
    }
    v.push_back({d , 0 , 0});
    sort(v.begin() , v.end());

    for (int i = 1 ; i <= n ; i++){
        u[i] = {v[i][2] , v[i][1] , i}; 
    }
    sort(u.begin() , u.end());

    for (int i = 0 ; i <= n ; i++){
        arr[i] = v[i+1][0] - v[i][0]; 
    }
    int ans = 1e18;
    int id = 1;
    for (int i = 1 ; i <= n ; i++){
        while (id <= n && u[id][0] <= u[i][0]) {arr[u[id][2]]-=u[id][1]; id++;}
        int mx = 0 , sum = 0;
        for (int j = 0 ; j <= n ; j++) {
            sum += arr[j]; 
            mx = max(mx , sum);
        }
        if (mx <= u[id][0]) ans = min(ans , mx);
    }
    cout << ans; 
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    doWork(); 
}

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