제출 #735173

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
735173		Nelt	Commuter Pass (JOI18_commuter_pass)	C++17	100 / 100	340 ms	27000 KiB

commuter_pass

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 1e5 + 5;
vv(pp(ll, ll)) g[N];

ll d[3][N], n;
ll dp[2][N];
void djikstra(ll s, ll ind)
{
    for (ll i = 1; i <= n; i++)
        d[ind][i] = INF;
    priority_queue<pp(ll, ll), vv(pp(ll, ll)), greater<pp(ll, ll)>> q;
    d[ind][s] = 0;
    q.push(mpr(0, s));
    while (!q.empty())
    {
        ll v = q.top().S;
        q.pop();
        for (auto [to, w] : g[v])
            if (d[ind][to] > d[ind][v] + w)
                d[ind][to] = d[ind][v] + w, q.push(mpr(d[ind][to], to));
    }
}
ll calc(ll v, ll ind)
{
    if (dp[ind][v] != 1e18)
        return dp[ind][v];
    dp[ind][v] = d[ind][v];
    for (auto [to, w] : g[v])
        if (d[2][to] + w == d[2][v])
            dp[ind][v] = min(dp[ind][v], calc(to, ind));
    return dp[ind][v];
}
void solve()
{
    ll m, s, t, u, v;
    cin >> n >> m >> s >> t >> u >> v;
    while (m--)
    {
        ll a, b, c;
        cin >> a >> b >> c;
        g[a].pb(mpr(b, c));
        g[b].pb(mpr(a, c));
    }
    djikstra(s, 2);
    djikstra(u, 0);
    djikstra(v, 1);
    for (ll i = 0; i < 2; i++)
    for (ll j = 1; j <= n; j++)
        dp[i][j] = 1e18;
    ll ans = d[0][v];
    calc(t, 0);
    calc(t, 1);
    for (ll i = 1; i <= n; i++)
        ans = min({ans, d[0][i] + dp[1][i], dp[0][i] + d[1][i]});
    cout << ans << endl;
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

• Subtask 1: 16 / 16
• Subtask 2: 15 / 15
• Subtask 3: 24 / 24
• Subtask 4: 45 / 45