結果
| 問題 | No.2387 Yokan Factory |
| ユーザー |
 ningenMe
|
| 提出日時 | 2023-07-21 23:36:08 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 621 ms / 5,000 ms |
| コード長 | 5,808 bytes |
| コンパイル時間 | 2,681 ms |
| コンパイル使用メモリ | 214,408 KB |
| 最終ジャッジ日時 | 2025-02-15 17:47:33 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 35 |
ソースコード
#include <bits/stdc++.h>using namespace std;using int128 = __int128_t;using int64 = long long;#define ALL(obj) (obj).begin(),(obj).end()/** @title FastIO* @docs md/util/FastIO.md*/class FastIO{private:inline static constexpr int ch_0='0';inline static constexpr int ch_9='9';inline static constexpr int ch_n='-';inline static constexpr int ch_s=' ';inline static constexpr int ch_l='\n';inline static void endline_skip(char& ch) {while(ch==ch_l) ch=getchar();}template<typename T> inline static void read_integer(T &x) {int neg=0; char ch; x=0;ch=getchar();endline_skip(ch);if(ch==ch_n) neg=1,ch=getchar();for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0);if(neg) x*=-1;}template<typename T> inline static void read_unsigned_integer(T &x) {char ch; x=0;ch=getchar();endline_skip(ch);for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0);}inline static void read_string(string &x) {char ch; x="";ch=getchar();endline_skip(ch);for(;(ch != ch_s && ch!=ch_l); ch = getchar()) x.push_back(ch);}inline static char ar[40];inline static char *ch_ar;template<typename T> inline static void write_integer(T x) {ch_ar=ar;if(x< 0) putchar(ch_n), x=-x;if(x==0) putchar(ch_0);for(;x;x/=10) *ch_ar++=(ch_0+x%10);while(ch_ar--!=ar) putchar(*ch_ar);}public:inline static void read(int &x) {read_integer<int>(x);}inline static void read(long long &x) {read_integer<long long>(x);}inline static void read(unsigned int &x) {read_unsigned_integer<unsigned int>(x);}inline static void read(unsigned long long &x) {read_unsigned_integer<unsigned long long>(x);}inline static void read(string &x) {read_string(x);}inline static void read(__int128_t &x) {read_integer<__int128_t>(x);}inline static void write(__int128_t x) {write_integer<__int128_t>(x);}inline static void write(char x) {putchar(x);}};#define read(arg) FastIO::read(arg)#define write(arg) FastIO::write(arg)template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL;constexpr int64 LOWINF = 1'000'000'000'000'000LL; //'constexpr long double PI = 3.1415926535897932384626433L;template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "")<< obj[i]; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") <<obj[i]; o << "}"; return o;}template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}void print(void) {cout << endl;}template <class Head> void print(Head&& head) {cout << head;print();}template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}template <class T> void chmax(T& a, const T b){a=max(a,b);}template <class T> void chmin(T& a, const T b){a=min(a,b);}vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer,delemiter) ) res.push_back(buffer); return res;}inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;}inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b)void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}/*** @url* @est*/int main() {cin.tie(0);ios::sync_with_stdio(false);int64 N,M,X;read(N),read(M),read(X);vector<vector<tuple<int,int64,int64>>> edge(N);for(int i=0;i<M;++i) {int u,v,a,b;read(u),read(v),read(a),read(b);u--,v--;edge[u].emplace_back(v,a,b);edge[v].emplace_back(u,a,b);}int64 ok=0,ng=LOWINF,md;vector<int64> dp(N);while(ng-ok>1) {md = ok + (ng-ok)/2;for(int i=0;i<N;++i) dp[i]=HIGHINF+10;priority_queue_reverse<pair<int64,int>> pq;pq.emplace(0,0);dp[0]=0;while(pq.size()) {auto [cost,from] = pq.top(); pq.pop();if(dp[from]<cost) continue;for(auto [to,w,b]: edge[from]) {if(md<=b && dp[to]>cost+w) {pq.emplace(cost+w,to);dp[to]=cost+w;}}}(dp[N-1]<=X?ok:ng)=md;}if(ok==0) ok=-1;cout << ok << endl;return 0;}