結果

問題 No.2387 Yokan Factory
ユーザー pitP
提出日時 2023-07-21 21:50:07
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 553 ms / 5,000 ms
コード長 3,245 bytes
コンパイル時間 3,673 ms
コンパイル使用メモリ 261,320 KB
最終ジャッジ日時 2025-02-15 16:45:16
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};
#ifdef LOCAL
# include <debug_print.hpp>
# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
# define debug(...) (static_cast<void>(0))
#endif
struct Edge{
ll cost;
int to;
};
using Graph = vector<vector<Edge>>;
vector<ll> dijkstra(int st, Graph &g){
int N = g.size();
vector<ll> dist(N,LINF);
dist[st] = 0ll;
using pli = pair<ll,int>;
priority_queue<pli,vector<pli>,greater<pli>> pq;
pq.emplace(pli{0ll,st});
while(!pq.empty()){
ll time = pq.top().first;
int now = pq.top().second;
pq.pop();
if (time > dist[now])continue;
for(auto e:g[now]){
ll c = e.cost;
int nxt = e.to;
if (c + time < dist[nxt]){
dist[nxt] = c + time;
pq.push(pli{c+time,nxt});
}
}
}
return dist;
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int N,M; cin >> N >> M;
ll X; cin >> X;
vector<int> u(M), v(M);
vector<ll> a(M), b(M);
rep(i,M){
cin >> u[i] >> v[i] >> a[i] >> b[i];
u[i]--;
v[i]--;
}
// 1
Graph g1(N);
rep(i,M){
g1[u[i]].push_back(Edge{a[i], v[i]});
g1[v[i]].push_back(Edge{a[i], u[i]});
}
auto dist1 = dijkstra(0, g1);
if (dist1[N - 1] > X){
cout << -1 << endl;
}
else{
ll ok = 0, ng = 1LL<<30;
while(abs(ok - ng) > 1){
ll mid = (ok + ng) / 2;
Graph g(N);
rep(i,M){
if (b[i] >= mid){
g[u[i]].push_back(Edge{a[i], v[i]});
g[v[i]].push_back(Edge{a[i], u[i]});
}
}
auto dist = dijkstra(0, g);
debug(dist, mid, ok, ng);
if (dist[N - 1] <= X) ok = mid;
else ng = mid;
}
cout << ok << endl;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0