oj.uz

Submission #483663

# Submission time Handle Problem Language Result Execution time Memory
483663 2021-10-31T13:40:34 Z Victor Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 1035 ms 51524 KB 
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

vpll graph[100001];
int n, m, s, t, a, b;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    cin >> n >> m >> s >> t >> a >> b;
    --s;
    --t;
    --a;
    --b;
    rep(i, 0, m) {
        ll u, v, w;
        cin >> u >> v >> w;
        graph[--u].emplace_back(--v, w);
        graph[v].emplace_back(u, w);
    }

    ll dist[100001];
    memset(dist, 63, sizeof(dist));

    dist[s] = 0;
    set<pll> pq;
    pq.emplace(0, s);

    while (!pq.empty()) {
        ll u, d;
        tie(d, u) = *pq.begin();
        pq.erase(pq.begin());

        trav(edge, graph[u]) {
            ll v, w;
            tie(v, w) = edge;
            if (d + w >= dist[v]) continue;

            pq.erase({dist[v], v});
            dist[v] = d + w;
            pq.emplace(d + w, v);
        }
    }

    set<pll> marked;
    bitset<100001> vis;
    queue<ll> q;
    q.push(t);
    vis[t] = 1;

    while (!q.empty()) {
        ll u = q.front();
        q.pop();
        trav(edge, graph[u]) {
            ll v, w;
            tie(v, w) = edge;
            if (dist[u] - w == dist[v]) {
                marked.emplace(u, v);
                marked.emplace(v, u);

                if (!vis[v]) {
                    q.push(v);
                    vis[v] = 1;
                }
            }
        }
    }

    ll cost[100001][4];
    memset(cost, 63, sizeof(cost));
    cost[a][0] = 0;
    pq.emplace(0, a);

    while (!pq.empty()) {
        ll u, d, state;
        tie(d, u) = *pq.begin();
        pq.erase(pq.begin());
        state = u >> 30;
        u &= (1 << 30) - 1;

        // cout<<"u = "<<u<<" d = "<<d<<" state = "<<state<<endl;

        trav(edge, graph[u]) {
            ll v, w;
            tie(v, w) = edge;

            if (state != 3 && marked.count(pll(u, v))) {
                ll nstate = (dist[u] < dist[v]) + 1;
                if ((!state || state == nstate) && d < cost[v][nstate]) {
                    pq.erase({cost[v][nstate], v | (nstate << 30)});
                    cost[v][nstate] = d;
                    pq.emplace(d, v | (nstate << 30));
                }
            }

            ll nstate = state ? 3 : 0;
            if (d + w < cost[v][nstate]) {
                pq.erase({cost[v][nstate], v | (nstate << 30)});
                cost[v][nstate] = d + w;
                pq.emplace(d + w, v | (nstate << 30));
            }
        }
    }
    ll ans = 1e15;
    rep(i, 0, 4) ans = min(ans, cost[b][i]);
    cout << ans << endl;
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 342 ms 23232 KB Output is correct
2 Correct 513 ms 25404 KB Output is correct
3 Correct 646 ms 30692 KB Output is correct
4 Correct 340 ms 23340 KB Output is correct
5 Correct 553 ms 30568 KB Output is correct
6 Correct 361 ms 23488 KB Output is correct
7 Correct 664 ms 31220 KB Output is correct
8 Correct 602 ms 33332 KB Output is correct
9 Correct 362 ms 24772 KB Output is correct
10 Correct 230 ms 26052 KB Output is correct
11 Correct 210 ms 21572 KB Output is correct
12 Correct 353 ms 24260 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 559 ms 24604 KB Output is correct
2 Correct 536 ms 25216 KB Output is correct
3 Correct 545 ms 26040 KB Output is correct
4 Correct 526 ms 24896 KB Output is correct
5 Correct 571 ms 26180 KB Output is correct
6 Correct 580 ms 29508 KB Output is correct
7 Correct 677 ms 32708 KB Output is correct
8 Correct 530 ms 25028 KB Output is correct
9 Correct 554 ms 26308 KB Output is correct
10 Correct 515 ms 24260 KB Output is correct
11 Correct 290 ms 23568 KB Output is correct
12 Correct 600 ms 30260 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 9036 KB Output is correct
2 Correct 4 ms 6604 KB Output is correct
3 Correct 4 ms 6592 KB Output is correct
4 Correct 16 ms 10000 KB Output is correct
5 Correct 14 ms 8316 KB Output is correct
6 Correct 4 ms 6604 KB Output is correct
7 Correct 5 ms 6732 KB Output is correct
8 Correct 5 ms 6732 KB Output is correct
9 Correct 4 ms 6728 KB Output is correct
10 Correct 12 ms 8268 KB Output is correct
11 Correct 3 ms 6588 KB Output is correct
12 Correct 4 ms 6604 KB Output is correct
13 Correct 3 ms 6604 KB Output is correct
14 Correct 4 ms 6604 KB Output is correct
15 Correct 4 ms 6604 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 342 ms 23232 KB Output is correct
2 Correct 513 ms 25404 KB Output is correct
3 Correct 646 ms 30692 KB Output is correct
4 Correct 340 ms 23340 KB Output is correct
5 Correct 553 ms 30568 KB Output is correct
6 Correct 361 ms 23488 KB Output is correct
7 Correct 664 ms 31220 KB Output is correct
8 Correct 602 ms 33332 KB Output is correct
9 Correct 362 ms 24772 KB Output is correct
10 Correct 230 ms 26052 KB Output is correct
11 Correct 210 ms 21572 KB Output is correct
12 Correct 353 ms 24260 KB Output is correct
13 Correct 559 ms 24604 KB Output is correct
14 Correct 536 ms 25216 KB Output is correct
15 Correct 545 ms 26040 KB Output is correct
16 Correct 526 ms 24896 KB Output is correct
17 Correct 571 ms 26180 KB Output is correct
18 Correct 580 ms 29508 KB Output is correct
19 Correct 677 ms 32708 KB Output is correct
20 Correct 530 ms 25028 KB Output is correct
21 Correct 554 ms 26308 KB Output is correct
22 Correct 515 ms 24260 KB Output is correct
23 Correct 290 ms 23568 KB Output is correct
24 Correct 600 ms 30260 KB Output is correct
25 Correct 22 ms 9036 KB Output is correct
26 Correct 4 ms 6604 KB Output is correct
27 Correct 4 ms 6592 KB Output is correct
28 Correct 16 ms 10000 KB Output is correct
29 Correct 14 ms 8316 KB Output is correct
30 Correct 4 ms 6604 KB Output is correct
31 Correct 5 ms 6732 KB Output is correct
32 Correct 5 ms 6732 KB Output is correct
33 Correct 4 ms 6728 KB Output is correct
34 Correct 12 ms 8268 KB Output is correct
35 Correct 3 ms 6588 KB Output is correct
36 Correct 4 ms 6604 KB Output is correct
37 Correct 3 ms 6604 KB Output is correct
38 Correct 4 ms 6604 KB Output is correct
39 Correct 4 ms 6604 KB Output is correct
40 Correct 428 ms 32360 KB Output is correct
41 Correct 337 ms 23364 KB Output is correct
42 Correct 336 ms 23496 KB Output is correct
43 Correct 421 ms 29536 KB Output is correct
44 Correct 420 ms 29612 KB Output is correct
45 Correct 981 ms 48592 KB Output is correct
46 Correct 965 ms 48092 KB Output is correct
47 Correct 371 ms 26820 KB Output is correct
48 Correct 436 ms 28972 KB Output is correct
49 Correct 308 ms 31280 KB Output is correct
50 Correct 895 ms 44916 KB Output is correct
51 Correct 1035 ms 51524 KB Output is correct