제출 #1142835

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1142835		AmirMakaM	Commuter Pass (JOI18_commuter_pass)	C++20	15 / 100	200 ms	19316 KiB

commuter_pass

#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define ld long double
#define pb push_back
#define f first
#define s second 
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define pii pair<int,int> 
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define pdd pair<double,double>
#define mp make_pair   
#define AmirMakaM ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
// solve it
const ull SEED = chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 mrand(SEED);
ull rnd(ull x = ~(0ull)) {return mrand() % x;} 
const ll MOD = 998244353;
const ll INF = 1e16+20;
const int inf = 1e9 + 7;
const ll N = 1e5+5;
const ll M = 2e3+1;
const double pi = 2*acos(0.0);
const int dx[] = {1,-1,0,0}, dy[] = {0,0,1,-1};

int n, m;
vector<pll> g[N];
ll d[N], p[N];

void dj(int s) {
    for(int i=1; i<=n; i++) d[i] = INF, p[i] = 0;
    set<pll> best;
    d[s] = 0;
    best.insert({d[s],s});

    while(!best.empty()) {
        auto curr = *best.begin();
        best.erase(curr);
        int v = curr.s;

        for(auto it:g[v]) {
            if(d[it.f] <= d[v] + it.s) continue;
            best.erase({d[it.f],it.f});
            d[it.f] = d[v] + it.s;
            p[it.f] = v;
            best.insert({d[it.f],it.f});
        }
    }
}

void solve() {
    cin >> n >> m;
    int s, t, u, v;
    cin >> s >> t >> u >> v;

    for(ll i=1, x, y, s; i<=m; i++) {
        cin >> x >> y >> s;
        g[x].pb({y,s});
        g[y].pb({x,s});
    }

    dj(s);
    for(int i=t; p[i]>0; i=p[i]) {
        g[i].pb({p[i],0});
        g[p[i]].pb({i,0});
    }

    dj(u);
    cout << d[v];
}

int main() {
    AmirMakaM;
    srand(SEED);
    //freopen("bulk.in", "r", stdin);
    //freopen("bulk.out", "w", stdout);
    int ttt = 1;
    //cin >> ttt;
    while(ttt--) {
        solve();
    }
    return 0;
}

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