oj.uz

Submission #330997

# Submission time Handle Problem Language Result Execution time Memory
330997 2020-11-27T03:12:07 Z caoash Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 515 ms 30812 KB 
#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.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 27376 KB Output is correct
2 Correct 429 ms 25628 KB Output is correct
3 Correct 493 ms 30812 KB Output is correct
4 Correct 388 ms 27000 KB Output is correct
5 Correct 430 ms 25532 KB Output is correct
6 Correct 449 ms 27328 KB Output is correct
7 Correct 454 ms 25492 KB Output is correct
8 Correct 477 ms 25568 KB Output is correct
9 Correct 405 ms 26568 KB Output is correct
10 Correct 316 ms 26192 KB Output is correct
11 Correct 192 ms 20460 KB Output is correct
12 Correct 449 ms 26344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 475 ms 26300 KB Output is correct
2 Correct 477 ms 26488 KB Output is correct
3 Correct 491 ms 25860 KB Output is correct
4 Correct 483 ms 26248 KB Output is correct
5 Correct 475 ms 26888 KB Output is correct
6 Correct 460 ms 28716 KB Output is correct
7 Correct 515 ms 28912 KB Output is correct
8 Correct 491 ms 26432 KB Output is correct
9 Correct 509 ms 26752 KB Output is correct
10 Correct 483 ms 26020 KB Output is correct
11 Correct 209 ms 21996 KB Output is correct
12 Correct 468 ms 28984 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 6892 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 21 ms 8556 KB Output is correct
5 Correct 16 ms 6764 KB Output is correct
6 Correct 4 ms 5228 KB Output is correct
7 Correct 5 ms 5228 KB Output is correct
8 Correct 6 ms 5356 KB Output is correct
9 Correct 5 ms 5228 KB Output is correct
10 Correct 13 ms 6892 KB Output is correct
11 Correct 5 ms 5100 KB Output is correct
12 Correct 4 ms 5228 KB Output is correct
13 Correct 5 ms 5100 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5184 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 27376 KB Output is correct
2 Correct 429 ms 25628 KB Output is correct
3 Correct 493 ms 30812 KB Output is correct
4 Correct 388 ms 27000 KB Output is correct
5 Correct 430 ms 25532 KB Output is correct
6 Correct 449 ms 27328 KB Output is correct
7 Correct 454 ms 25492 KB Output is correct
8 Correct 477 ms 25568 KB Output is correct
9 Correct 405 ms 26568 KB Output is correct
10 Correct 316 ms 26192 KB Output is correct
11 Correct 192 ms 20460 KB Output is correct
12 Correct 449 ms 26344 KB Output is correct
13 Correct 475 ms 26300 KB Output is correct
14 Correct 477 ms 26488 KB Output is correct
15 Correct 491 ms 25860 KB Output is correct
16 Correct 483 ms 26248 KB Output is correct
17 Correct 475 ms 26888 KB Output is correct
18 Correct 460 ms 28716 KB Output is correct
19 Correct 515 ms 28912 KB Output is correct
20 Correct 491 ms 26432 KB Output is correct
21 Correct 509 ms 26752 KB Output is correct
22 Correct 483 ms 26020 KB Output is correct
23 Correct 209 ms 21996 KB Output is correct
24 Correct 468 ms 28984 KB Output is correct
25 Correct 13 ms 6892 KB Output is correct
26 Correct 4 ms 5100 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 21 ms 8556 KB Output is correct
29 Correct 16 ms 6764 KB Output is correct
30 Correct 4 ms 5228 KB Output is correct
31 Correct 5 ms 5228 KB Output is correct
32 Correct 6 ms 5356 KB Output is correct
33 Correct 5 ms 5228 KB Output is correct
34 Correct 13 ms 6892 KB Output is correct
35 Correct 5 ms 5100 KB Output is correct
36 Correct 4 ms 5228 KB Output is correct
37 Correct 5 ms 5100 KB Output is correct
38 Correct 4 ms 5100 KB Output is correct
39 Correct 4 ms 5184 KB Output is correct
40 Correct 388 ms 27132 KB Output is correct
41 Correct 452 ms 26296 KB Output is correct
42 Correct 407 ms 26484 KB Output is correct
43 Correct 232 ms 21100 KB Output is correct
44 Correct 206 ms 21100 KB Output is correct
45 Correct 434 ms 24612 KB Output is correct
46 Correct 413 ms 24948 KB Output is correct
47 Correct 395 ms 27028 KB Output is correct
48 Correct 227 ms 18028 KB Output is correct
49 Correct 330 ms 26944 KB Output is correct
50 Correct 418 ms 25420 KB Output is correct
51 Correct 441 ms 25056 KB Output is correct