oj.uz

Submission #680452

# Submission time Handle Problem Language Result Execution time Memory
680452 2023-01-10T22:02:02 Z Neos Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 418 ms 26152 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define sz(x) (int)x.size()
#define getBit(x, i) ((x) >> (i) & 1)
#define rep(i, begin, end) for (ll i = (begin); i <= (end); i++)
#define rrep(i, begin, end) for (ll i = (begin); i >= (end); i--)

typedef long long ll;
typedef pair<ll, ll> ii;

template <class T>
bool minimize(T &a, const T &b) {
    if(a > b) {a = b; return 1;}
    return 0;
}
template <class T>
bool maximize(T &a, const T &b) {
    if(a < b) {a = b; return 1;}
    return 0;
}

const int N = 1e5 + 7;

int n, m, s, t, x, y;
bool done[N];
ll d[N][4], f[N], ans = 1e18;
vector<ii> adj[N];
vector<int> dag[N];

void dijk(int s, int i) {
    priority_queue<ii, vector<ii>, greater<ii>> pq;
    pq.push(ii(0, s)); d[s][i] = 0;

    while (sz(pq)) {
        ii u = pq.top(); pq.pop();
        if (u.fi != d[u.se][i]) continue;
        for (auto [v, w]: adj[u.se]) {
            if (minimize(d[v][i], d[u.se][i] + w)) {
                pq.push(ii(d[v][i], v));
            }
        }
    }
}

void dfs1(int u) {
    done[u] = 1; f[u] = d[u][3]; // shortest path from y->u
    for (auto [v, w]: adj[u]) if (d[u][0] + d[v][1] + w == d[t][0]) {
        if (!done[v]) dfs1(v);
        minimize(f[u], f[v]);
    }
    minimize(ans, d[u][2] + f[u]);
}

void dfs2(int u) {
    done[u] = 1; f[u] = d[u][3]; // shortest path from y->u
    for (auto [v, w]: adj[u]) if (d[u][1] + d[v][0] + w == d[t][0]) {
        if (!done[v]) dfs2(v);
        minimize(f[u], f[v]);
    }
    minimize(ans, d[u][2] + f[u]);
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> s >> t >> x >> y;
    rep(i, 1, m) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].pb(ii(v, w)); adj[v].pb(ii(u, w));
    }

    memset(d, 0x3f, sizeof d);
    dijk(s, 0); dijk(t, 1); dijk(x, 2); dijk(y, 3);

    ans = d[y][2];
    memset(f, 0x3f, sizeof f);
    dfs1(s);
    memset(done, 0, sizeof done);
    memset(f, 0x3f, sizeof f);
    dfs2(t);
    cout << ans;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 21632 KB Output is correct
2 Correct 330 ms 20492 KB Output is correct
3 Correct 368 ms 26152 KB Output is correct
4 Correct 317 ms 21496 KB Output is correct
5 Correct 326 ms 20332 KB Output is correct
6 Correct 345 ms 21692 KB Output is correct
7 Correct 367 ms 20400 KB Output is correct
8 Correct 368 ms 20460 KB Output is correct
9 Correct 349 ms 20344 KB Output is correct
10 Correct 227 ms 20144 KB Output is correct
11 Correct 180 ms 17496 KB Output is correct
12 Correct 305 ms 20344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 21812 KB Output is correct
2 Correct 353 ms 22060 KB Output is correct
3 Correct 335 ms 21616 KB Output is correct
4 Correct 418 ms 21972 KB Output is correct
5 Correct 364 ms 22396 KB Output is correct
6 Correct 371 ms 24172 KB Output is correct
7 Correct 384 ms 24712 KB Output is correct
8 Correct 382 ms 22040 KB Output is correct
9 Correct 342 ms 22468 KB Output is correct
10 Correct 403 ms 21692 KB Output is correct
11 Correct 148 ms 19152 KB Output is correct
12 Correct 386 ms 24512 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 10516 KB Output is correct
2 Correct 4 ms 9044 KB Output is correct
3 Correct 4 ms 9044 KB Output is correct
4 Correct 15 ms 11688 KB Output is correct
5 Correct 10 ms 10340 KB Output is correct
6 Correct 5 ms 9044 KB Output is correct
7 Correct 5 ms 9172 KB Output is correct
8 Correct 6 ms 9240 KB Output is correct
9 Correct 6 ms 9136 KB Output is correct
10 Correct 11 ms 10324 KB Output is correct
11 Correct 4 ms 9044 KB Output is correct
12 Correct 4 ms 9044 KB Output is correct
13 Correct 4 ms 9044 KB Output is correct
14 Correct 5 ms 9044 KB Output is correct
15 Correct 5 ms 9044 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 21632 KB Output is correct
2 Correct 330 ms 20492 KB Output is correct
3 Correct 368 ms 26152 KB Output is correct
4 Correct 317 ms 21496 KB Output is correct
5 Correct 326 ms 20332 KB Output is correct
6 Correct 345 ms 21692 KB Output is correct
7 Correct 367 ms 20400 KB Output is correct
8 Correct 368 ms 20460 KB Output is correct
9 Correct 349 ms 20344 KB Output is correct
10 Correct 227 ms 20144 KB Output is correct
11 Correct 180 ms 17496 KB Output is correct
12 Correct 305 ms 20344 KB Output is correct
13 Correct 369 ms 21812 KB Output is correct
14 Correct 353 ms 22060 KB Output is correct
15 Correct 335 ms 21616 KB Output is correct
16 Correct 418 ms 21972 KB Output is correct
17 Correct 364 ms 22396 KB Output is correct
18 Correct 371 ms 24172 KB Output is correct
19 Correct 384 ms 24712 KB Output is correct
20 Correct 382 ms 22040 KB Output is correct
21 Correct 342 ms 22468 KB Output is correct
22 Correct 403 ms 21692 KB Output is correct
23 Correct 148 ms 19152 KB Output is correct
24 Correct 386 ms 24512 KB Output is correct
25 Correct 16 ms 10516 KB Output is correct
26 Correct 4 ms 9044 KB Output is correct
27 Correct 4 ms 9044 KB Output is correct
28 Correct 15 ms 11688 KB Output is correct
29 Correct 10 ms 10340 KB Output is correct
30 Correct 5 ms 9044 KB Output is correct
31 Correct 5 ms 9172 KB Output is correct
32 Correct 6 ms 9240 KB Output is correct
33 Correct 6 ms 9136 KB Output is correct
34 Correct 11 ms 10324 KB Output is correct
35 Correct 4 ms 9044 KB Output is correct
36 Correct 4 ms 9044 KB Output is correct
37 Correct 4 ms 9044 KB Output is correct
38 Correct 5 ms 9044 KB Output is correct
39 Correct 5 ms 9044 KB Output is correct
40 Correct 324 ms 21204 KB Output is correct
41 Correct 343 ms 20388 KB Output is correct
42 Correct 324 ms 20436 KB Output is correct
43 Correct 148 ms 18128 KB Output is correct
44 Correct 157 ms 18128 KB Output is correct
45 Correct 332 ms 20292 KB Output is correct
46 Correct 339 ms 19992 KB Output is correct
47 Correct 303 ms 21528 KB Output is correct
48 Correct 178 ms 15720 KB Output is correct
49 Correct 266 ms 21224 KB Output is correct
50 Correct 376 ms 20128 KB Output is correct
51 Correct 347 ms 20076 KB Output is correct