oj.uz

Submission #777083

# Submission time Handle Problem Language Result Execution time Memory
777083 2023-07-08T15:55:44 Z teokakabadze Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 260 ms 31492 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define int long long
#define N 200005
#define pii pair<int, int>
#define piii pair<int, pii>
using namespace std;

int n, m, s, T, U, V, a, b, w, inf = 1e16, ans = 1e18, dp[N][2], d[N][3], f[N][3], F[N];
vector<pii> v[N];

void dijkstra(int st, int t)
{
    int u;
    priority_queue<pii, vector<pii>, greater<pii>> q;
    for(int i = 1; i <= n; i++)
    d[i][t] = inf;
    d[st][t] = 0;
    q.push({0, st});
    while(q.size())
    {
        u = q.top().s;
        q.pop();
        if(f[u][t]) continue;
        f[u][t] = 1;
        for(auto x : v[u])
        if(d[x.f][t] > d[u][t] + x.s)
        {
            d[x.f][t] = d[u][t] + x.s;
            q.push({d[x.f][t], x.f});
        }
    }
}

void dfs(int u)
{
    if(F[u]) return;
    F[u] = 1;
    dp[u][0] = d[u][1];
    dp[u][1] = d[u][2];
    for(auto x : v[u])
    if(d[u][0] == d[x.f][0] + x.s) 
    {
        dfs(x.f);
        dp[u][0] = min(dp[u][0], dp[x.f][0]);
        dp[u][1] = min(dp[u][1], dp[x.f][1]);
    }
    ans = min(ans, min(dp[u][0] + d[u][2], dp[u][1] + d[u][1]));
}

main()
{
    std::ios::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> n >> m >> s >> T >> U >> V;
    while(m--)
    {
        cin >> a >> b >> w;
        v[a].pb({b, w});
        v[b].pb({a, w});
    }
    dijkstra(s, 0);
    dijkstra(U, 1);
    dijkstra(V, 2);
    dfs(T);
    cout << min(d[V][1], ans) << '\n';
}

Compilation message

commuter_pass.cpp:53:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   53 | main()
      | ^~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 27052 KB Output is correct
2 Correct 228 ms 26192 KB Output is correct
3 Correct 214 ms 31492 KB Output is correct
4 Correct 204 ms 26884 KB Output is correct
5 Correct 187 ms 26056 KB Output is correct
6 Correct 183 ms 27124 KB Output is correct
7 Correct 233 ms 26172 KB Output is correct
8 Correct 184 ms 26188 KB Output is correct
9 Correct 182 ms 26180 KB Output is correct
10 Correct 162 ms 26348 KB Output is correct
11 Correct 78 ms 22636 KB Output is correct
12 Correct 184 ms 26188 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 28376 KB Output is correct
2 Correct 197 ms 28592 KB Output is correct
3 Correct 223 ms 28120 KB Output is correct
4 Correct 260 ms 28384 KB Output is correct
5 Correct 228 ms 29036 KB Output is correct
6 Correct 194 ms 30904 KB Output is correct
7 Correct 212 ms 31148 KB Output is correct
8 Correct 251 ms 28656 KB Output is correct
9 Correct 215 ms 29032 KB Output is correct
10 Correct 201 ms 28196 KB Output is correct
11 Correct 95 ms 24508 KB Output is correct
12 Correct 205 ms 31260 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6740 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 13 ms 8492 KB Output is correct
5 Correct 7 ms 6732 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 4 ms 5332 KB Output is correct
9 Correct 3 ms 5164 KB Output is correct
10 Correct 7 ms 6732 KB Output is correct
11 Correct 3 ms 5024 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5044 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 27052 KB Output is correct
2 Correct 228 ms 26192 KB Output is correct
3 Correct 214 ms 31492 KB Output is correct
4 Correct 204 ms 26884 KB Output is correct
5 Correct 187 ms 26056 KB Output is correct
6 Correct 183 ms 27124 KB Output is correct
7 Correct 233 ms 26172 KB Output is correct
8 Correct 184 ms 26188 KB Output is correct
9 Correct 182 ms 26180 KB Output is correct
10 Correct 162 ms 26348 KB Output is correct
11 Correct 78 ms 22636 KB Output is correct
12 Correct 184 ms 26188 KB Output is correct
13 Correct 225 ms 28376 KB Output is correct
14 Correct 197 ms 28592 KB Output is correct
15 Correct 223 ms 28120 KB Output is correct
16 Correct 260 ms 28384 KB Output is correct
17 Correct 228 ms 29036 KB Output is correct
18 Correct 194 ms 30904 KB Output is correct
19 Correct 212 ms 31148 KB Output is correct
20 Correct 251 ms 28656 KB Output is correct
21 Correct 215 ms 29032 KB Output is correct
22 Correct 201 ms 28196 KB Output is correct
23 Correct 95 ms 24508 KB Output is correct
24 Correct 205 ms 31260 KB Output is correct
25 Correct 8 ms 6740 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 13 ms 8492 KB Output is correct
29 Correct 7 ms 6732 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5204 KB Output is correct
32 Correct 4 ms 5332 KB Output is correct
33 Correct 3 ms 5164 KB Output is correct
34 Correct 7 ms 6732 KB Output is correct
35 Correct 3 ms 5024 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5044 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 227 ms 27008 KB Output is correct
41 Correct 174 ms 26080 KB Output is correct
42 Correct 187 ms 26272 KB Output is correct
43 Correct 73 ms 23244 KB Output is correct
44 Correct 71 ms 23244 KB Output is correct
45 Correct 171 ms 26784 KB Output is correct
46 Correct 182 ms 25864 KB Output is correct
47 Correct 175 ms 26904 KB Output is correct
48 Correct 79 ms 20300 KB Output is correct
49 Correct 142 ms 26620 KB Output is correct
50 Correct 178 ms 26044 KB Output is correct
51 Correct 170 ms 26076 KB Output is correct