結果

問題 No.2739 Time is money
ユーザー woodywoodywoodywoody
提出日時 2024-04-20 19:36:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 249 ms / 2,000 ms
コード長 5,948 bytes
コンパイル時間 4,228 ms
コンパイル使用メモリ 272,240 KB
実行使用メモリ 25,576 KB
最終ジャッジ日時 2024-10-12 17:26:20
合計ジャッジ時間 8,702 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 77 ms
16,128 KB
testcase_03 AC 171 ms
22,228 KB
testcase_04 AC 73 ms
15,616 KB
testcase_05 AC 111 ms
16,656 KB
testcase_06 AC 150 ms
21,044 KB
testcase_07 AC 228 ms
24,576 KB
testcase_08 AC 225 ms
24,832 KB
testcase_09 AC 226 ms
25,216 KB
testcase_10 AC 160 ms
24,192 KB
testcase_11 AC 249 ms
25,284 KB
testcase_12 AC 180 ms
23,552 KB
testcase_13 AC 170 ms
23,424 KB
testcase_14 AC 162 ms
23,552 KB
testcase_15 AC 110 ms
23,696 KB
testcase_16 AC 111 ms
21,624 KB
testcase_17 AC 216 ms
25,440 KB
testcase_18 AC 213 ms
25,576 KB
testcase_19 AC 139 ms
22,928 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 2001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

struct edge{
    int from,to;
    ll cost;
    ll tcost;

    edge(int from_=0,int to_=0,ll cost_=0,ll _tcost=0) : from(from_),to(to_),cost(cost_),tcost(_tcost) {}
    bool operator<(const edge& ot){
        return cost < ot.cost;
    }
};

void solve(){
    ll n,m,x; cin>>n>>m>>x;
    vector<vector<edge>> e(n);
    rep(i,m){
        int a,b,c,d; cin>>a>>b>>c>>d;
        a--; b--;
        e[a].pb(edge(a,b,c,d));
        e[b].pb(edge(b,a,c,d));
    }
    vpll dist(n,{LINF,0});
    mpq<pair<pll, int>> q;
    
    int st = 0;
    dist[st] = {0,0};
    q.push({dist[st] , st});
    
    while(!q.empty()){
        pll p = q.top().fi;
        int from = q.top().se;
        q.pop();
        ll nowDist = p.first;
        ll money = -p.se;
    
        if (dist[from] < p) continue;
    
        fore(ey , e[from]){
            int to = ey.to;
            ll nc = nowDist + ey.tcost;
            ll nd = money;
            if (money < ey.cost){
                nc += (ey.cost - money + x - 1) / x;
                nd = money + (ey.cost - money + x - 1) / x * x - ey.cost;
            }else{
                nd -= ey.cost;
            }
            assert(nd>=0 && nd<x);
            pll np = {nc, -nd};
    
            if (chmin(dist[to] , np)){
                q.push({dist[to] , to});
            }
        }
    }
    ll ans = dist[n-1].fi;
    if (ans==LINF) ans = -1;
    out;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0