結果

問題 No.2387 Yokan Factory
ユーザー jabeejabee
提出日時 2023-07-21 21:56:13
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 336 ms / 5,000 ms
コード長 5,362 bytes
コンパイル時間 4,128 ms
コンパイル使用メモリ 273,480 KB
実行使用メモリ 30,984 KB
最終ジャッジ日時 2023-10-21 21:57:50
合計ジャッジ時間 8,637 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 25 ms
18,788 KB
testcase_01 AC 26 ms
18,788 KB
testcase_02 AC 25 ms
18,788 KB
testcase_03 AC 25 ms
18,788 KB
testcase_04 AC 24 ms
18,788 KB
testcase_05 AC 26 ms
18,788 KB
testcase_06 AC 25 ms
18,788 KB
testcase_07 AC 25 ms
18,788 KB
testcase_08 AC 25 ms
18,788 KB
testcase_09 AC 25 ms
18,788 KB
testcase_10 AC 25 ms
18,788 KB
testcase_11 AC 26 ms
18,788 KB
testcase_12 AC 27 ms
18,788 KB
testcase_13 AC 27 ms
18,788 KB
testcase_14 AC 27 ms
18,788 KB
testcase_15 AC 194 ms
28,916 KB
testcase_16 AC 122 ms
30,340 KB
testcase_17 AC 336 ms
30,556 KB
testcase_18 AC 258 ms
30,984 KB
testcase_19 AC 164 ms
25,556 KB
testcase_20 AC 108 ms
25,044 KB
testcase_21 AC 305 ms
29,796 KB
testcase_22 AC 109 ms
24,532 KB
testcase_23 AC 301 ms
25,976 KB
testcase_24 AC 114 ms
24,836 KB
testcase_25 AC 129 ms
23,744 KB
testcase_26 AC 180 ms
26,844 KB
testcase_27 AC 143 ms
28,720 KB
testcase_28 AC 29 ms
18,788 KB
testcase_29 AC 29 ms
19,224 KB
testcase_30 AC 29 ms
19,224 KB
testcase_31 AC 29 ms
18,788 KB
testcase_32 AC 29 ms
18,788 KB
testcase_33 AC 28 ms
18,788 KB
testcase_34 AC 30 ms
19,224 KB
testcase_35 AC 29 ms
19,224 KB
testcase_36 AC 27 ms
18,788 KB
testcase_37 AC 26 ms
18,788 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
 
//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
 
//---------------------------------------------------------------------------------------------------
 
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";
 
#endif // templete
//---------------------------------------------------------------------------------------------------
Graph g;
ll n,m,x;
Graph width;
Graph cost;
bool judge(ll w){
    vector<ll>dist(n,infl);
    dist[0] = 0;
    priority_queue<P,vector<P>,greater<P>>q;
    q.push({0,0});
    while(q.size()){
        ll from = q.top().second;
        ll time = q.top().first;
        q.pop();
        if(dist[from] != time)continue;
        rep(i,0,g[from].size()){
            ll to = g[from][i];
            ll cost_v = cost[from][i];
            ll width_v = width[from][i];
            ll ntime = time + cost_v;
            if(ntime > x)continue;
            ll w_limit = width_v;
            if(w > w_limit)continue;
            if(chmin(dist[to],ntime))q.push({ntime,to});
        }
    }
    if(dist[n-1] <= x)return true;
    else return false;
}
void _main() {
    cin >> n >> m >> x;
    g.resize(n);
    cost.resize(n);
    width.resize(n);
    rep(i,0,m){
        ll u,v,a,b;
        cin >> u >> v >> a >> b;
        u--; v--;
        g[u].push_back(v);
        g[v].push_back(u);
        cost[u].push_back(a);
        cost[v].push_back(a);
        width[u].push_back(b);
        width[v].push_back(b);
    }
    ll wa = infl;
    ll ac = 0;
    while(wa - ac > 1){
        ll wj = (wa + ac)/2;
        if(judge(wj))ac = wj;
        else wa = wj;
    }
    if(ac == 0)ac = -1;
   cout << ac << endl;
}
0