結果

問題 No.160 最短経路のうち辞書順最小
コンテスト
ユーザー mai
提出日時 2017-08-28 22:03:09
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 23 ms / 5,000 ms
コード長 6,021 bytes
コンパイル時間 13,736 ms
コンパイル使用メモリ 295,112 KB
最終ジャッジ日時 2025-01-05 02:33:57
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }

mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;


class GraphE {
public:
    typedef int W_T;
    struct Edge {
        int u, v;
        W_T value;
        Edge(int from = 0, int to = 0, W_T value = 0) :u(from), v(to), value(value) {}
        inline int to(int _v) { return _v == v ? u : v; }
    };
    size_t n;
    vector<vector<int>> vertex_to;
    vector<Edge> edges;

    GraphE(int n) :n(n), vertex_to(n) { }

    void resize(size_t _n) {
        n = _n;
        vertex_to.resize(_n);
    }
    void connect(int from, int to, W_T val = 0) {
        vertex_to[from].push_back(edges.size());
        vertex_to[to].push_back(edges.size());
        edges.emplace_back(from, to, val);
    }
    inline size_t degree(int v) {
        return vertex_to[v].size();
    }
};

class DGraph {
public:
    size_t n;
    vector<vector<int>> vertex_to;
    vector<vector<int>> vertex_from;

    DGraph(size_t n) :n(n), vertex_to(n), vertex_from(n) {}

    void connect(int from, int to) {
        vertex_to[from].emplace_back(to);
        vertex_from[to].emplace_back(from);
    }
    void resize(size_t _n) {
        n = _n;
        vertex_to.resize(_n);
        vertex_from.resize(_n);
    }
};

class Graph {
public:
    size_t n;
    vector<vector<int>> vertex_to;

    Graph(size_t n) :n(n), vertex_to(n) {}

    void connect(int from, int to) {
        vertex_to[from].emplace_back(to);
        vertex_to[to].emplace_back(from);
    }
    void resize(size_t _n) {
        n = _n;
        vertex_to.resize(_n);
    }
};


ll m, n, kei;
ll starti, goali;

GraphE graph(1);

int main() {

    scanner >> n >> m >> starti >> goali;

    graph.resize(n);

    repeat(i, m) {
        int a, b, c;
        scanner >> a >> b >> c;
        graph.connect(a, b, c);
    }

    vector<ll> dist(n, 5e15);
    dist[starti] = 1;

    priority_queue<pair<ll,int>> pq;
    pq.emplace(1, starti);

    while (!pq.empty()) {
        auto p = pq.top();
        ll d = p.first;
        int i = p.second;
        pq.pop();
        if (dist[i] < d) continue;

        for (int ei : graph.vertex_to[i]) {
            auto edge = graph.edges[ei];
            int j = edge.to(i);
            if (edge.value + dist[i] < dist[j]) {
                dist[j] = edge.value + dist[i];
                pq.emplace(dist[j], j);
            }
        }
    }

    DGraph route(n);
    vector<int> visited(n);

    function<void(int, int)> dfs = [&](int idx, int from) {
        if (visited[idx]) return;
        visited[idx] = true;

        for (int ei : graph.vertex_to[idx]) {
            auto edge = graph.edges[ei];
            int j = edge.to(idx);
            if (dist[idx] - edge.value == dist[j]) {
                route.connect(j, idx);
                dfs(j, idx);
            }
        }
    };
    dfs(goali, -1);

    int pos = starti;
    int prev = -1;

    while (pos != goali) {
        printf("%d ", pos);
        sort(ALL(route.vertex_to[pos]));
        for (int to : route.vertex_to[pos]) {
            if (to == prev) continue;
            prev = pos;
            pos = to;
            break;
        }
    }
    cout << goali << endl;

    return 0;
}
0