結果

問題 No.807 umg tours
ユーザー hitonanodehitonanode
提出日時 2019-03-22 22:03:06
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 271 ms / 4,000 ms
コード長 4,302 bytes
コンパイル時間 2,123 ms
コンパイル使用メモリ 179,580 KB
実行使用メモリ 21,104 KB
最終ジャッジ日時 2024-05-02 23:23:48
合計ジャッジ時間 6,242 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 3 ms
5,248 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 157 ms
15,148 KB
testcase_12 AC 144 ms
13,256 KB
testcase_13 AC 185 ms
16,468 KB
testcase_14 AC 74 ms
9,356 KB
testcase_15 AC 52 ms
8,132 KB
testcase_16 AC 194 ms
17,160 KB
testcase_17 AC 271 ms
21,068 KB
testcase_18 AC 266 ms
21,104 KB
testcase_19 AC 246 ms
19,216 KB
testcase_20 AC 130 ms
12,288 KB
testcase_21 AC 136 ms
12,776 KB
testcase_22 AC 49 ms
7,552 KB
testcase_23 AC 39 ms
6,656 KB
testcase_24 AC 103 ms
17,564 KB
testcase_25 AC 259 ms
20,904 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))

int N, M;
vector<vector<plint>> e;
constexpr lint INF = 1e17;

int main()
{
    cin >> N >> M;
    e.resize(N + 1);
    REP(_, M)
    {
        lint a, b, c;
        cin >> a >> b >> c;
        e[a].emplace_back(b, c);
        e[b].emplace_back(a, c);
    }

    priority_queue<plint, vector<plint>, greater<plint>> pq;
    vector<lint> dp(2 * N + 1, INF);
    dp[1] = dp[N + 1] = 0;
    pq.emplace(0, 1);
    while (!pq.empty())
    {
        plint pa = pq.top();
        pq.pop();
        lint now = pa.second, d = pa.first;
        if (d > dp[now]) continue;

        dp[now] = d;
        if (now <= N)
        {
            if (mmin(dp[now + N], dp[now])) pq.emplace(dp[now + N], now + N);
            for (auto nxt : e[now])
            {
                if (mmin(dp[nxt.first], dp[now] + nxt.second)) pq.emplace(dp[nxt.first], nxt.first);
                if (mmin(dp[nxt.first + N], dp[now])) pq.emplace(dp[nxt.first + N], nxt.first + N);
            }
        }
        else
        {
            for (auto nxt : e[now - N])
            {
                if (mmin(dp[nxt.first + N], dp[now] + nxt.second)) pq.emplace(dp[nxt.first + N], nxt.first + N);
            }
        }
    }
    FOR(i, 1, N + 1)
    {
        printf("%lld\n", dp[i] + dp[i + N]);
    }
}
0