結果

問題 No.2387 Yokan Factory
コンテスト
ユーザー siro53
提出日時 2023-07-21 22:11:02
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 718 ms / 5,000 ms
コード長 5,248 bytes
コンパイル時間 2,170 ms
コンパイル使用メモリ 216,420 KB
最終ジャッジ日時 2025-02-15 16:59:21
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "combined.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
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;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define REVERSE(v) reverse(ALL(v))
#define SZ(v) ((int)(v).size())
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

#line 2 "/Users/siro53/kyo-pro/compro_library/graph/shortest-path/dijkstra.hpp"

#line 7 "/Users/siro53/kyo-pro/compro_library/graph/shortest-path/dijkstra.hpp"

#line 2 "/Users/siro53/kyo-pro/compro_library/graph/graph_template.hpp"

#line 5 "/Users/siro53/kyo-pro/compro_library/graph/graph_template.hpp"

template <typename Cost = int> struct Edge {
    int from, to;
    Cost cost;
    int id;
    Edge() = default;
    explicit Edge(int from, int to, Cost cost = 1, int id = -1)
        : from(from), to(to), cost(cost), id(id) {}
    operator int() const { return to; }
};

template <typename Cost = int> class Graph {
  public:
    Graph() = default;
    explicit Graph(int N) : N(N), M(0), G(N) {}

    inline void add_directed_edge(int from, int to, Cost cost = 1) {
        assert(0 <= from && from < N);
        assert(0 <= to && to < N);
        G[from].emplace_back(from, to, cost, M++);
    }

    inline void add_undirected_edge(int from, int to, Cost cost = 1) {
        assert(0 <= from && from < N);
        assert(0 <= to && to < N);
        G[from].emplace_back(from, to, cost, M);
        G[to].emplace_back(to, from, cost, M++);
    }

    inline size_t size() const { return G.size(); }
    inline std::vector<Edge<Cost>> &operator[](const int &i) { return G[i]; }
    inline const std::vector<Edge<Cost>> &operator[](const int &i) const {
        return G[i];
    }

  private:
    int N, M;
    std::vector<std::vector<Edge<Cost>>> G;
};

template <class Cost = int> using Edges = std::vector<Edge<Cost>>;
#line 9 "/Users/siro53/kyo-pro/compro_library/graph/shortest-path/dijkstra.hpp"

template <typename Cost = int>
std::pair<std::vector<Cost>, std::vector<int>>
dijkstra(const Graph<Cost> &G, int start, Cost iv = 0,
         Cost inf = std::numeric_limits<Cost>::max()) {
    using Data = std::pair<Cost, int>;
    int N = (int)G.size();
    std::vector<Cost> dist(N, inf);
    std::vector<int> prev(N, -1);

    dist[start] = iv;
    std::priority_queue<Data, std::vector<Data>, std::greater<Data>> que;
    que.emplace(iv, start);
    while(!que.empty()) {
        auto [d, u] = que.top();
        que.pop();
        if(d > dist[u]) continue;
        for(const auto &e : G[u]) {
            if(dist[e.to] > d + e.cost) {
                dist[e.to] = d + e.cost;
                prev[e.to] = u;
                que.emplace(dist[e.to], e.to);
            }
        }
    }

    return std::make_pair(dist, prev);
}
#line 78 "combined.cpp"

int main() {
    int N, M;
    ll X;
    cin >> N >> M >> X;
    vector<tuple<int, int, int, int>> edges(M);
    REP(i, M) {
        int u, v, a, b;
        cin >> u >> v >> a >> b;
        u--, v--;
        edges.emplace_back(u, v, a, b);
    }
    int ok = -1, ng = 1000000000 + 1;
    while(ng - ok > 1) {
        int mid = (ok + ng) / 2;
        Graph<ll> G(N);
        for(const auto& [u, v, a, b] : edges) {
            if(b < mid) continue;
            G.add_undirected_edge(u, v, a);
        }
        auto [d, _] = dijkstra<ll>(G, 0);
        if(d[N-1] <= X) ok = mid;
        else ng = mid;
    }
    cout << ok << endl;
}
0