oj.uz

Submission #601270

# Submission time Handle Problem Language Result Execution time Memory
601270 2022-07-21T14:32:59 Z ziduo Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 297 ms 23048 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define E '\n'
#define name "main"
#define X first
#define Y second
#define ii pair<int,int>
#define int ll
const int N = 1e5;
const ll oo = 1e18+19;
vector<ii> adj[N+13];
int numNode, numEdge;
ll dist[3][N+13];
ll dp[3][N+13];
int id[N+13];
int S,T,U,V;
 
bool minimize(ll &x, ll y){
    return x > y ? x = y,1 : 0;
}
void dijkstra(int start,ll d[]){
    priority_queue<ii, vector<ii>, greater<ii>> pq;
    for (int i=1; i <= numNode ; ++i)
        d[i] = oo;
    pq.push({0,start});
    d[start] = 0;
    while (pq.size()){
        ii t = pq.top();
        pq . pop();
        int du = t.X;
        int u = t.Y;
        if (du != d[u]) continue;
 
        for (ii e: adj[u]){
            int v = e.Y;
            int uv = e.X;
            if (minimize(d[v],d[u] + uv))
                pq.push({d[v],v});
        }
    }
}
signed main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout .tie(0);
//    freopen(name".inp","r",stdin); freopen(name".out","w",stdout);
    cin >> numNode >> numEdge;
    cin >> S >> T >> U >> V;
    for (int i=1; i <= numEdge; ++i){
        int u,v,w;
        cin >> u >> v >> w;
        adj[u].push_back({w,v});
        adj[v].push_back({w,u});
    }
    dijkstra(S,dist[2]);
    dijkstra(U,dist[0]);
    dijkstra(V,dist[1]);
    for (int i=1; i <= numNode; ++i)
        id[i] = i;
    sort(id+1,id+1+numNode,[&](int x,int y){
        return dist[2][x] < dist[2][y];
    });
    for (int i=1; i <= numNode; ++i){
        int u = id[i];
        dp[0][u] = dist[0][u];
        dp[1][u] = dist[1][u];
        dp[2][u] = dist[0][u] + dist[1][u];
 
        for (ii e: adj[u]){
            int v = e.Y;
            if (dist[2][v] + e.X > dist[2][u]) continue;
            for (int k=0 ; k < 3; ++k)
                minimize(dp[k][u],dp[k][v]);
        }
        minimize(dp[2][u],min(dp[0][u] + dist[1][u],dp[1][u] + dist[0][u]));
    }
    cout << min(dp[2][T],dist[0][V]);
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 22508 KB Output is correct
2 Correct 240 ms 22292 KB Output is correct
3 Correct 227 ms 22280 KB Output is correct
4 Correct 260 ms 22440 KB Output is correct
5 Correct 231 ms 21988 KB Output is correct
6 Correct 283 ms 22400 KB Output is correct
7 Correct 243 ms 21984 KB Output is correct
8 Correct 247 ms 22068 KB Output is correct
9 Correct 295 ms 22992 KB Output is correct
10 Correct 216 ms 23048 KB Output is correct
11 Correct 123 ms 15404 KB Output is correct
12 Correct 254 ms 22892 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 22300 KB Output is correct
2 Correct 297 ms 22144 KB Output is correct
3 Correct 270 ms 22144 KB Output is correct
4 Correct 282 ms 22152 KB Output is correct
5 Correct 250 ms 22156 KB Output is correct
6 Correct 262 ms 22240 KB Output is correct
7 Correct 263 ms 22072 KB Output is correct
8 Correct 278 ms 22048 KB Output is correct
9 Correct 276 ms 22092 KB Output is correct
10 Correct 256 ms 22104 KB Output is correct
11 Correct 124 ms 15404 KB Output is correct
12 Correct 231 ms 22296 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4484 KB Output is correct
2 Correct 3 ms 2692 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 20 ms 6228 KB Output is correct
5 Correct 8 ms 4360 KB Output is correct
6 Correct 2 ms 2820 KB Output is correct
7 Correct 3 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 3 ms 2824 KB Output is correct
10 Correct 8 ms 4356 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 22508 KB Output is correct
2 Correct 240 ms 22292 KB Output is correct
3 Correct 227 ms 22280 KB Output is correct
4 Correct 260 ms 22440 KB Output is correct
5 Correct 231 ms 21988 KB Output is correct
6 Correct 283 ms 22400 KB Output is correct
7 Correct 243 ms 21984 KB Output is correct
8 Correct 247 ms 22068 KB Output is correct
9 Correct 295 ms 22992 KB Output is correct
10 Correct 216 ms 23048 KB Output is correct
11 Correct 123 ms 15404 KB Output is correct
12 Correct 254 ms 22892 KB Output is correct
13 Correct 258 ms 22300 KB Output is correct
14 Correct 297 ms 22144 KB Output is correct
15 Correct 270 ms 22144 KB Output is correct
16 Correct 282 ms 22152 KB Output is correct
17 Correct 250 ms 22156 KB Output is correct
18 Correct 262 ms 22240 KB Output is correct
19 Correct 263 ms 22072 KB Output is correct
20 Correct 278 ms 22048 KB Output is correct
21 Correct 276 ms 22092 KB Output is correct
22 Correct 256 ms 22104 KB Output is correct
23 Correct 124 ms 15404 KB Output is correct
24 Correct 231 ms 22296 KB Output is correct
25 Correct 8 ms 4484 KB Output is correct
26 Correct 3 ms 2692 KB Output is correct
27 Correct 3 ms 2772 KB Output is correct
28 Correct 20 ms 6228 KB Output is correct
29 Correct 8 ms 4360 KB Output is correct
30 Correct 2 ms 2820 KB Output is correct
31 Correct 3 ms 2900 KB Output is correct
32 Correct 3 ms 2900 KB Output is correct
33 Correct 3 ms 2824 KB Output is correct
34 Correct 8 ms 4356 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2688 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 3 ms 2688 KB Output is correct
40 Correct 264 ms 22252 KB Output is correct
41 Correct 278 ms 22708 KB Output is correct
42 Correct 242 ms 22896 KB Output is correct
43 Correct 138 ms 15468 KB Output is correct
44 Correct 151 ms 15400 KB Output is correct
45 Correct 222 ms 22728 KB Output is correct
46 Correct 253 ms 21744 KB Output is correct
47 Correct 231 ms 22376 KB Output is correct
48 Correct 110 ms 14840 KB Output is correct
49 Correct 235 ms 21996 KB Output is correct
50 Correct 214 ms 22092 KB Output is correct
51 Correct 227 ms 22044 KB Output is correct