結果

問題 No.807 umg tours
ユーザー ミドリムシミドリムシ
提出日時 2019-03-22 21:36:03
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 457 ms / 4,000 ms
コード長 4,210 bytes
コンパイル時間 717 ms
コンパイル使用メモリ 80,392 KB
実行使用メモリ 26,260 KB
最終ジャッジ日時 2023-08-15 11:51:21
合計ジャッジ時間 7,029 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,356 KB
testcase_01 AC 2 ms
4,356 KB
testcase_02 AC 2 ms
4,352 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 1 ms
4,384 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 2 ms
4,384 KB
testcase_11 AC 284 ms
22,304 KB
testcase_12 AC 255 ms
16,712 KB
testcase_13 AC 357 ms
22,676 KB
testcase_14 AC 153 ms
13,192 KB
testcase_15 AC 128 ms
13,008 KB
testcase_16 AC 380 ms
23,764 KB
testcase_17 AC 442 ms
25,360 KB
testcase_18 AC 449 ms
25,492 KB
testcase_19 AC 457 ms
26,260 KB
testcase_20 AC 280 ms
16,256 KB
testcase_21 AC 288 ms
17,404 KB
testcase_22 AC 120 ms
9,032 KB
testcase_23 AC 95 ms
8,092 KB
testcase_24 AC 270 ms
21,788 KB
testcase_25 AC 438 ms
25,832 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
#include <queue>
#include <cmath>
using namespace std;
using lint = long long;
const long mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<long> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } long C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };

using path = pair<long, int>;

int main(){
    int N, M;
    cin >> N >> M;
    vector<pair<int, long>> roads[N];
    for(int i = 0; i < M; i++){
        int a, b, c;
        cin >> a >> b >> c;
        roads[a - 1].push_back({b - 1, c});
        roads[b - 1].push_back({a - 1, c});
    }
    vector<long> dist1(N, 1e18), dist2(N, 1e18);
    priority_queue<path, vector<path>, greater<path>> pathes;
    dist1[0] = 0;
    pathes.push({0, 0});
    while(!pathes.empty()){
        auto top = pathes.top();
        pathes.pop();
        if(top.first > dist1[top.second]){
            continue;
        }
        for(auto i: roads[top.second]){
            int to = i.first;
            long cost = i.second + top.first;
            if(dist1[to] > cost){
                dist1[to] = cost;
                pathes.push({cost, to});
            }
        }
    }
    for(int i = 0; i < N; i++){
        for(auto j: roads[i]){
            pathes.push({dist1[i], j.first});
            dist2[j.first] = min(dist2[j.first], dist1[i]);
        }
    }
    while(!pathes.empty()){
        auto top = pathes.top();
        pathes.pop();
        if(top.first > dist2[top.second]){
            continue;
        }
        for(auto i: roads[top.second]){
            int to = i.first;
            long cost = i.second + top.first;
            if(dist2[to] > cost){
                dist2[to] = cost;
                pathes.push({cost, to});
            }
        }
    }
    dist2[0] = 0;
    for(int i = 0; i < N; i++){
        cout << dist1[i] + dist2[i] << endl;
    }
}
0