#14471 (C++11（廃止可能性あり）) No.160 最短経路のうち辞書順最小

• 問題: No.160 最短経路のうち辞書順最小
• ユーザー: koyumeishi
• 提出日時: 2015-03-02 00:05:34
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 63 ms / 5,000 ms
• コード長: 2,102 bytes
• コンパイル時間: 1,110 ms
• コンパイル使用メモリ: 93,308 KB
• 実行使用メモリ: 8,016 KB
• 最終ジャッジ日時: 2024-06-24 00:45:23
• 合計ジャッジ時間: 2,522 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 26

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;
typedef struct{
    int to;
    int cost;
}edge;
class my_distance{
public:
    long long cost;
    vector<int> s;
    my_distance(){
        
    }
    my_distance(long long cost_, const vector<int> s_){
        cost = cost_;
        s = s_;
    }
    my_distance(const my_distance& x){
        this->cost = x.cost;
        this->s = x.s;
    }
    bool operator<(const my_distance& x) const{
        if(this->cost != x.cost) return this->cost < x.cost;
        return this->s < x.s;
    }
    bool operator>(const my_distance& x) const{
        if(this->cost != x.cost) return this->cost > x.cost;
        return this->s > x.s;
    }
};
//distance from s
//O(E log V)
void dijkstra(vector< vector<edge> > &G, vector< my_distance > &dist, int s){
    //INF as distance
    const long long INF = 1LL<<60LL;
    
    //first : distance from s, second : its vertex
    priority_queue< pair<my_distance, int> , vector< pair<my_distance, int>  >, greater< pair<my_distance, int> >> pq;
     
    fill(dist.begin(), dist.end(),  my_distance(INF, {}) );
    dist[s] = my_distance(0, {s});
    pq.push( {dist[s], s} );
    while(!pq.empty()){
        auto q = pq.top();
        pq.pop();
        int from = q.second;
        if(dist[from] < q.first) continue; // it's not minimum distance
        int n=G[from].size();
        for(int i=0; i<n; i++){
            edge e = G[from][i];
            my_distance next = dist[from];
            next.cost += e.cost;
            next.s.push_back(e.to);
            if(dist[e.to] > next){
                dist[e.to] = next;
                pq.push( {dist[e.to], e.to} );
            }
        }
    }
}
 
void add_edge(vector<vector<edge> > &G, int from, int to, int cost){
    G[from].push_back( (edge){to, cost} );
    G[to].push_back( (edge){from, cost} );
}
 
int main(){
    int N,M,S,G;
    cin >> N >> M >> S >> G;
    vector<vector<edge>> Graph(N);
    for(int i=0; i<M; i++){
        int a,b,c;
        cin >> a >> b >> c;
        add_edge(Graph, a, b, c);
    }
    vector<my_distance> dist(N);
    dijkstra(Graph, dist, S);
    auto ans = dist[G].s;
    for(int i=0; i<ans.size(); i++){
        cout << ans[i] << " ";
    }
    cout << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX