제출 #359967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
359967		teehandsome	Fuel Station (NOI20_fuelstation)	C++11	67 / 100	3058 ms	12912 KiB

FuelStation

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define INF 1e14+7
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;

template<typename T>
void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";}
void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";}
template<typename T>
void _print(T x) {cerr<<x;}

void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
    _print(H);
    if(sizeof...(T)) cerr<<",";
    else cerr<<"\"]";
    dbg(T...);
}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__)

int n,d;
vector<ll> B;
struct dt {
    int x,a,b;
    bool operator<(const dt &r) {
        return x<r.x;
    };
};
vector<dt> shop;
ll ans = INF;

bool ok(ll f) {
    ll sum=0;
    ll f_rem=INF;
    for(int i=0;i<n+1;i++) {
        if(shop[i].b<f) continue;
        f_rem=min(f_rem,f+sum-shop[i].x);
        sum+=shop[i].a;
    }
    if(f_rem>=0) {
        ans=min(ans,f-f_rem);
        //cout<<f-f_rem<<endl; return true;
    }
    return false;
}

int main () {
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>n>>d;
    for(int i=0;i<n;i++) {
        int x,a,b; cin>>x>>a>>b;
        shop.push_back({x,a,b});
        B.push_back(b);
    }
    B.push_back(d);
    sort(all(shop)); shop.push_back({d,0,d});
    sort(all(B)); B.erase(unique(all(B)),end(B));
    for(auto e:B) {
        if(ok(e)) {
//            return 0;
        }
    }
    cout<<ans<<endl;
}

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