結果

問題 No.807 umg tours
ユーザー Konton7Konton7
提出日時 2020-04-30 18:59:58
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 5,337 bytes
コンパイル時間 2,632 ms
コンパイル使用メモリ 217,676 KB
実行使用メモリ 25,416 KB
最終ジャッジ日時 2024-11-23 20:02:36
合計ジャッジ時間 10,637 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 3 ms
5,248 KB
testcase_11 AC 103 ms
9,728 KB
testcase_12 AC 78 ms
9,984 KB
testcase_13 AC 114 ms
11,600 KB
testcase_14 AC 44 ms
7,296 KB
testcase_15 AC 39 ms
6,528 KB
testcase_16 AC 139 ms
12,260 KB
testcase_17 AC 150 ms
13,880 KB
testcase_18 AC 164 ms
13,952 KB
testcase_19 AC 160 ms
14,532 KB
testcase_20 AC 70 ms
10,624 KB
testcase_21 AC 76 ms
11,008 KB
testcase_22 AC 31 ms
6,656 KB
testcase_23 AC 24 ms
5,888 KB
testcase_24 TLE -
testcase_25 AC 137 ms
25,416 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()

const int mod = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(const vector<T> &v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;

    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w)
{
    return 0 <= y && y < h && 0 <= x && x < w;
}

template <typename T>
vector<T> cumsum(const vector<T> &v)
{
    T s = 0;
    vector<T> ret = {0};

    rep(i, v.size())
    {
        s += v[i];
        ret.push_back(s);
    }
    return ret;
}

bool iskadomatsu(int a, int b, int c)
{
    return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}

VS split(string s, char c)
{
    VS ret;
    string part;
    s += c;
    rep(i, s.length())
    {
        if (s[i] == c)
        {
            ret.emplace_back(part);
            part = "";
        }
        else if (s[i] != c)
        {
            part += s[i];
        }
    }
    return ret;
}

string removezero(string &s)
{
    string ret;
    for (auto z : s)
        if (z != '0')
            ret += z;
    return ret;
}

ll sumdigit(ll x)
{
    ll ans{0};
    while (x > 0)
    {
        ans += x % 10;
        x /= 10;
    }
    return ans;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r, ret %= mod;
        r = (r * r) % mod, q /= 2;
    }
    return ret % mod;
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
    ll ret = frac_list[a];
    ret *= frac_inv_list[b];
    ret %= mod;
    ret *= frac_inv_list[a - b];
    ret %= mod;
    return ret;
}

const ll maxint = 1e17;
vector<ll> shortest1, shortest2;
vector<vector<pair<int, int>>> connective;

void djkstra1(int x)
{
    vector<int> search = {x};
    vector<int> new_search;
    shortest1[x] = 0;
    while (!search.empty())
    {

        for (auto i : search)
        {
            for (auto [v, d] : connective[i])
            {
                if (shortest1[v] > d + shortest1[i])
                {
                    shortest1[v] = d + shortest1[i];
                    new_search.emplace_back(v);
                }
            }
        }
        search.clear();
        search = new_search;
        new_search.clear();
    }
}

void djkstra2(int x)
{
    vector<int> search = {x};
    vector<int> new_search;
    copy(allpt(shortest1), shortest2.begin());
    
    while (!search.empty())
    {
        for (auto i : search)
        {
            for (auto [v, d] : connective[i])
            {
                if (shortest2[v] > shortest1[i])
                {
                    shortest2[v] = shortest1[i];
                    new_search.emplace_back(v);
                }
                if (shortest2[v] > d + shortest2[i])
                {
                    shortest2[v] = d + shortest2[i];
                    new_search.emplace_back(v);
                }
            }
        }
        search.clear();
        search = new_search;
        new_search.clear();
    }
}



int main()
{

    cin.tie(0);
    ios::sync_with_stdio(false);

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int n, m, a, b, c;
    cin >> n >> m;
    connective.resize(n), shortest1.resize(n), shortest2.resize(n);
    fill(allpt(shortest1), maxint), fill(allpt(shortest2), maxint);

    rep(i, m)
    {
        cin >> a >> b >> c;
        a--, b--;
        connective[a].emplace_back(make_pair(b, c));
        connective[b].emplace_back(make_pair(a, c));
    }

    djkstra1(0);
    djkstra2(0);

    rep(i, n)
        cout << shortest1[i] + shortest2[i] << rt;

    return 0;
}
0