제출 #330997

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330997		caoash	Commuter Pass (JOI18_commuter_pass)	C++17	100 / 100	515 ms	30812 KiB

commuter_pass

#include <bits/stdc++.h> 
using namespace std;

using ll = long long;

using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

namespace output {
  void pr(int x) {
    cout << x;
  }
  void pr(long x) {
    cout << x;
  }
  void pr(ll x) {
    cout << x;
  }
  void pr(unsigned x) {
    cout << x;
  }
  void pr(unsigned long x) {
    cout << x;
  }
  void pr(unsigned long long x) {
    cout << x;
  }
  void pr(float x) {
    cout << x;
  }
  void pr(double x) {
    cout << x;
  }
  void pr(long double x) {
    cout << x;
  }
  void pr(char x) {
    cout << x;
  }
  void pr(const char * x) {
    cout << x;
  }
  void pr(const string & x) {
    cout << x;
  }
  void pr(bool x) {
    pr(x ? "true" : "false");
  }

  template < class T1, class T2 > void pr(const pair < T1, T2 > & x);
  template < class T > void pr(const T & x);

  template < class T, class...Ts > void pr(const T & t,
    const Ts & ...ts) {
    pr(t);
    pr(ts...);
  }
  template < class T1, class T2 > void pr(const pair < T1, T2 > & x) {
    pr("{", x.f, ", ", x.s, "}");
  }
  template < class T > void pr(const T & x) {
    pr("{"); // const iterator needed for vector<bool>
    bool fst = 1;
    for (const auto & a: x) pr(!fst ? ", " : "", a), fst = 0;
    pr("}");
  }

  void ps() {
    pr("\n");
  } // print w/ spaces
  template < class T, class...Ts > void ps(const T & t,
    const Ts & ...ts) {
    pr(t);
    if (sizeof...(ts)) pr(" ");
    ps(ts...);
  }

  void pc() {
    cout << "]" << endl;
  } // debug w/ commas
  template < class T, class...Ts > void pc(const T & t,
    const Ts & ...ts) {
    pr(t);
    if (sizeof...(ts)) pr(", ");
    pc(ts...);
  }
  // #define dbg(x...) pr("[", #x, "] = ["), pc(x);
}

#ifdef mikey 
using namespace output;
#else
using namespace output;
// #define dbg(x...)
#endif

const int MX = 200005;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;

using T = pair<ll, int>;

int n;
int a, b, c, d;
ll ds[MX], dt[MX], du[MX], dv[MX];
ll dp[MX][2];
vector<T> adj[MX];

void dijkstra(int s, ll dist[MX]) {
    vector<bool> vis(n);
    priority_queue<T, vector<T>, greater<T>> pq;  
    for (int i = 0; i < n; i++) dist[i] = INF;
    dist[s] = 0;
    pq.push(mp(dist[s], s));
    while (!pq.empty()) {
        T curr = pq.top();
        pq.pop();
        for (auto to : adj[curr.s]) {
            int v = to.s;
            if (!vis[v]) {
                if (dist[v] > dist[curr.s] + to.f) {
                    dist[v] = dist[curr.s] + to.f;
                    pq.push(mp(dist[v], v));
                }
            }
        }
        vis[curr.s] = true;
    }
}

ll go(int v, int ok) {
    if (ds[v] + dt[v] != dt[a]) return INF;
    if (dp[v][ok] != INF) return dp[v][ok];
    dp[v][ok] = dv[v];
    for (auto to : adj[v]) {
        // directed ff -> fs
        int ff = to.s, fs = v;
        // // dbg(ff, fs);
        if (ok) swap(ff, fs);
        if (ds[ff] + to.f != ds[fs]) continue;
        // // dbg("DIR", ff, fs);
        assert(ds[ff] + to.f <= ds[fs]);
        dp[v][ok] = min(dp[v][ok], go(to.s, ok));
        // dbg("TRANS", v, to.s, ok, dp[to.s][ok]);
    }
    // dbg(v, ok, dp[v][ok]);
    return dp[v][ok];
}

int main(){
#ifdef mikey 
    freopen("a.in", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    int m;
    cin >> n >> m;
    cin >> a >> b;
    cin >> c >> d;
    a--, b--, c--, d--;
    for (int i = 0; i < m; i++) {
        int u, v, w; cin >> u >> v >> w;
        u--, v--;
        adj[u].pb(mp(w, v)), adj[v].pb(mp(w, u));
    }
    for (int i = 0; i < n; i++) dp[i][0] = INF, dp[i][1] = INF;
    dijkstra(a, ds);
    dijkstra(b, dt);
    dijkstra(c, du);
    dijkstra(d, dv);
    go(b, 0);
    go(a, 1);
    // for (int i = 0; i < n; i++) dbg(i, dv[i]);
    ll ans = dv[c];
    for (int i = 0; i < n; i++) {
        // dbg(i, du[i], dp[i][0], dp[i][1]);
        ans = min(ans, du[i] + min(dp[i][0], dp[i][1]));
    }
    cout << ans << '\n';
}

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