oj.uz

Submission #141674

# Submission time Handle Problem Language Result Execution time Memory
141674 2019-08-08T19:26:05 Z osaaateiasavtnl Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 776 ms 45196 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
const int N = 2e5 + 7, INF = 1e18 + 7;
struct Edge { int v, c; }; vector <Edge> g[N];
void dj1(int S, int dist[N]) {
    for (int i = 0; i < N; ++i) dist[i] = INF;
    set <ii> ms; ms.insert({0, S}); dist[S] = 0;
    while (ms.size()) {
        int u = ms.begin()->second; ms.erase(ms.begin());
        for (auto e : g[u]) if (dist[u] + e.c < dist[e.v]) { ms.erase({dist[e.v], e.v}); dist[e.v] = dist[u] + e.c; ms.insert({dist[e.v], e.v}); }
    }
}
void dj2(int S, int dist[N], vector <int> rg[N]) {
    for (int i = 0; i < N; ++i) dist[i] = INF;
    set <ii> ms; ms.insert({0, S}); dist[S] = 0;
    while (ms.size()) {
        int u = ms.begin()->second; ms.erase(ms.begin());
        for (auto e : g[u]) {
            if (dist[u] + e.c < dist[e.v]) { 
                ms.erase({dist[e.v], e.v}); dist[e.v] = dist[u] + e.c; ms.insert({dist[e.v], e.v}); 
                rg[e.v] = {u};
            }
            else if (dist[u] + e.c == dist[e.v]) {
                rg[e.v].app(u);
            }
        }
    }
}
int n, m, S, T, U, V, distU[N], distV[N], distS[N], ans = INF;
vector <int> dag[N], rg[N];
bool used[N], t[N]; int toU[N], toV[N];
void dfs(int u) {
    used[u] = 1;
    t[u] = u == T; toU[u] = distU[u]; toV[u] = distV[u];
    for (int v : dag[u]) {
        if (!used[v]) dfs(v);
        if (t[v]) { toU[u] = min(toU[u], toU[v]); toV[u] = min(toV[u], toV[v]); t[u] = 1; }
    }
    if (t[u]) { 
        ans = min(ans, distU[u] + toV[u]); 
        ans = min(ans, distV[u] + toU[u]); 
    }
}
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    cin >> n >> m >> S >> T >> U >> V;
    for(int i = 0; i < m; ++i) {
        int u, v, c; cin >> u >> v >> c; g[u].app({v,c}); g[v].app({u,c});
    }
    dj1(U,distU);dj1(V,distV);dj2(S,distS,rg);
    for (int i = 1; i <= n; ++i) for (int v : rg[i]) dag[v].app(i);
    ans = distU[V];
    dfs(S);
    cout << ans << '\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 625 ms 40796 KB Output is correct
2 Correct 593 ms 40044 KB Output is correct
3 Correct 682 ms 43740 KB Output is correct
4 Correct 665 ms 41232 KB Output is correct
5 Correct 577 ms 40952 KB Output is correct
6 Correct 669 ms 40568 KB Output is correct
7 Correct 620 ms 40504 KB Output is correct
8 Correct 612 ms 40572 KB Output is correct
9 Correct 564 ms 40316 KB Output is correct
10 Correct 463 ms 40676 KB Output is correct
11 Correct 248 ms 36856 KB Output is correct
12 Correct 622 ms 40876 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 704 ms 41980 KB Output is correct
2 Correct 632 ms 41976 KB Output is correct
3 Correct 635 ms 42000 KB Output is correct
4 Correct 644 ms 41932 KB Output is correct
5 Correct 620 ms 41848 KB Output is correct
6 Correct 573 ms 43512 KB Output is correct
7 Correct 673 ms 44988 KB Output is correct
8 Correct 634 ms 41904 KB Output is correct
9 Correct 615 ms 41976 KB Output is correct
10 Correct 622 ms 42064 KB Output is correct
11 Correct 231 ms 37200 KB Output is correct
12 Correct 570 ms 43640 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 20984 KB Output is correct
2 Correct 20 ms 19192 KB Output is correct
3 Correct 19 ms 19240 KB Output is correct
4 Correct 40 ms 22904 KB Output is correct
5 Correct 30 ms 20856 KB Output is correct
6 Correct 20 ms 19320 KB Output is correct
7 Correct 21 ms 19320 KB Output is correct
8 Correct 21 ms 19448 KB Output is correct
9 Correct 20 ms 19320 KB Output is correct
10 Correct 28 ms 20856 KB Output is correct
11 Correct 19 ms 19192 KB Output is correct
12 Correct 19 ms 19192 KB Output is correct
13 Correct 19 ms 19192 KB Output is correct
14 Correct 19 ms 19192 KB Output is correct
15 Correct 20 ms 19192 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 625 ms 40796 KB Output is correct
2 Correct 593 ms 40044 KB Output is correct
3 Correct 682 ms 43740 KB Output is correct
4 Correct 665 ms 41232 KB Output is correct
5 Correct 577 ms 40952 KB Output is correct
6 Correct 669 ms 40568 KB Output is correct
7 Correct 620 ms 40504 KB Output is correct
8 Correct 612 ms 40572 KB Output is correct
9 Correct 564 ms 40316 KB Output is correct
10 Correct 463 ms 40676 KB Output is correct
11 Correct 248 ms 36856 KB Output is correct
12 Correct 622 ms 40876 KB Output is correct
13 Correct 704 ms 41980 KB Output is correct
14 Correct 632 ms 41976 KB Output is correct
15 Correct 635 ms 42000 KB Output is correct
16 Correct 644 ms 41932 KB Output is correct
17 Correct 620 ms 41848 KB Output is correct
18 Correct 573 ms 43512 KB Output is correct
19 Correct 673 ms 44988 KB Output is correct
20 Correct 634 ms 41904 KB Output is correct
21 Correct 615 ms 41976 KB Output is correct
22 Correct 622 ms 42064 KB Output is correct
23 Correct 231 ms 37200 KB Output is correct
24 Correct 570 ms 43640 KB Output is correct
25 Correct 29 ms 20984 KB Output is correct
26 Correct 20 ms 19192 KB Output is correct
27 Correct 19 ms 19240 KB Output is correct
28 Correct 40 ms 22904 KB Output is correct
29 Correct 30 ms 20856 KB Output is correct
30 Correct 20 ms 19320 KB Output is correct
31 Correct 21 ms 19320 KB Output is correct
32 Correct 21 ms 19448 KB Output is correct
33 Correct 20 ms 19320 KB Output is correct
34 Correct 28 ms 20856 KB Output is correct
35 Correct 19 ms 19192 KB Output is correct
36 Correct 19 ms 19192 KB Output is correct
37 Correct 19 ms 19192 KB Output is correct
38 Correct 19 ms 19192 KB Output is correct
39 Correct 20 ms 19192 KB Output is correct
40 Correct 776 ms 45196 KB Output is correct
41 Correct 600 ms 40172 KB Output is correct
42 Correct 659 ms 40144 KB Output is correct
43 Correct 241 ms 36600 KB Output is correct
44 Correct 241 ms 36608 KB Output is correct
45 Correct 543 ms 41564 KB Output is correct
46 Correct 510 ms 41464 KB Output is correct
47 Correct 639 ms 41592 KB Output is correct
48 Correct 246 ms 34808 KB Output is correct
49 Correct 541 ms 45028 KB Output is correct
50 Correct 544 ms 41412 KB Output is correct
51 Correct 512 ms 41488 KB Output is correct