結果

問題 No.807 umg tours
コンテスト
ユーザー au7777
提出日時 2022-04-23 15:15:56
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 3,730 bytes
コンパイル時間 4,396 ms
コンパイル使用メモリ 246,128 KB
実行使用メモリ 25,996 KB
最終ジャッジ日時 2024-06-25 02:20:08
合計ジャッジ時間 16,331 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 24 TLE * 1 -- * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
typedef long long int ull;
#define MP make_pair
using namespace std;
using namespace atcoder;
typedef pair<ll, ll> P;
// const ll MOD = 998244353;
const ll MOD = 1000000007;
// using mint = modint998244353;
using mint = modint1000000007;
const double pi = 3.1415926536;
const int MAX = 2000003;
long long fac[MAX], finv[MAX], inv[MAX];
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll n) {
    ll ret = 0;
    while (n) {
        n /= 10;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}

vector<ll> compress(vector<ll> v) {
    // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] 
    vector<ll> u = v;
    sort(u.begin(), u.end());
    u.erase(unique(u.begin(),u.end()),u.end());
    map<ll, ll> mp;
    for (int i = 0; i < u.size(); i++) {
        mp[u[i]] = i;
    }
    for (int i = 0; i < v.size(); i++) {
        v[i] = mp[v[i]];
    }
    return v;
}

struct point {
  ll cst;
  int state;
  int pos;
  bool operator==(const point& x) const{ return cst == x.cst; }
  bool operator<(const point& x) const{ return cst > x.cst; }
  bool operator>(const point& x) const{ return cst > x.cst; }
};

vector<P> e[100001];
ll dp[100001][2];
ll INF = (ll)1e18;
int main() {
    for (int i = 0; i <= 100000; i++) {
        for (int j = 0; j < 2; j++) {
            dp[i][j] = INF;
        }
    }
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        ll a, b, c;
        cin >> a >> b >> c;
        e[a].push_back({b, c});
        e[b].push_back({a, c});
    }
    priority_queue<point> que;
    dp[1][0] = 0;
    dp[1][1] = 0;
    que.push(point{0, 0, 1});
    while (que.size()) {
        point p = que.top();
        que.pop();
        for (auto x : e[p.pos]) {
            // 普通に移動
            ll next_cst = p.cst + x.second;
            int next_pos = x.first;
            int next_state = p.state;
            if (dp[x.first][next_state] > next_cst) {
                dp[x.first][next_state] = next_cst;
                que.push({next_cst, next_state, next_pos});
            }
            if (p.state == 0) {
                next_cst = p.cst;
                next_pos = x.first;
                next_state = 1;
                if (dp[x.first][next_state] > next_cst) {
                    dp[x.first][next_state] = next_cst;
                    que.push({next_cst, next_state, next_pos});
                }
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        cout << dp[i][0] + dp[i][1] << endl;
    }
    return 0;
}
0