oj.uz

Submission #668819

# Submission time Handle Problem Language Result Execution time Memory
668819 2022-12-05T03:39:54 Z Darren0724 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 273 ms 22248 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define x first
#define y second
const int INF=1e18;
int n,m;
vector<vector<pair<int,int>>> adj;
vector<vector<int>> dp;
vector<vector<int>> dis1;
vector<bool> vis;
int ans=0;
void dijkstra(int s){
    vector<int> dis(n,INF);
    dis[s]=0;
    priority_queue<pair<int,int>> pq;
    pq.push({0,s});
    while(pq.size()){
        int a,b;tie(a,b)=pq.top();
        pq.pop();
        a=-a;
        if(dis[b]!=a){
            continue;
        }
        for(auto p:adj[b]){
            if(dis[p.x]>dis[b]+p.y){
                dis[p.x]=dis[b]+p.y;
                pq.push({-dis[p.x],p.x});
            }
        }
    }
    dis1.push_back(dis);
}
void dfs(int k){
    vis[k]=1;
    for(auto p:adj[k]){
        if(dis1[2][k]-dis1[2][p.x]==p.y){
            if(!vis[p.x]){
                dfs(p.x);
            }
            dp[0][k]=min(dp[0][k],dp[0][p.x]);
            dp[1][k]=min(dp[1][k],dp[1][p.x]);
        }
    }
    ans=min({ans,dp[1][k]+dis1[0][k],dis1[1][k]+dp[0][k]});
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int s,t,u,v;
    cin>>n>>m>>s>>t>>u>>v;
    s--;t--;u--;v--;
    adj.resize(n);
    for(int i=0;i<m;i++){
        int a,b,c;cin>>a>>b>>c;a--;b--;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }
    dijkstra(u);
    dijkstra(v);
    dijkstra(s);
    ans=dis1[0][v];
    dp.resize(2);
    dp[0]=dis1[0];
    dp[1]=dis1[1];
    vis.resize(n);
    dfs(t);
    cout<<ans<<endl;
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 19148 KB Output is correct
2 Correct 219 ms 17988 KB Output is correct
3 Correct 262 ms 21624 KB Output is correct
4 Correct 215 ms 18068 KB Output is correct
5 Correct 220 ms 17700 KB Output is correct
6 Correct 248 ms 19248 KB Output is correct
7 Correct 248 ms 17924 KB Output is correct
8 Correct 229 ms 17968 KB Output is correct
9 Correct 228 ms 17880 KB Output is correct
10 Correct 204 ms 17592 KB Output is correct
11 Correct 104 ms 14932 KB Output is correct
12 Correct 261 ms 17804 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 264 ms 19748 KB Output is correct
2 Correct 234 ms 19768 KB Output is correct
3 Correct 249 ms 19520 KB Output is correct
4 Correct 236 ms 19732 KB Output is correct
5 Correct 249 ms 20328 KB Output is correct
6 Correct 256 ms 21240 KB Output is correct
7 Correct 249 ms 21844 KB Output is correct
8 Correct 273 ms 19800 KB Output is correct
9 Correct 238 ms 20300 KB Output is correct
10 Correct 262 ms 19452 KB Output is correct
11 Correct 108 ms 16184 KB Output is correct
12 Correct 235 ms 21448 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2048 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 14 ms 3796 KB Output is correct
5 Correct 7 ms 2024 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 7 ms 1996 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 19148 KB Output is correct
2 Correct 219 ms 17988 KB Output is correct
3 Correct 262 ms 21624 KB Output is correct
4 Correct 215 ms 18068 KB Output is correct
5 Correct 220 ms 17700 KB Output is correct
6 Correct 248 ms 19248 KB Output is correct
7 Correct 248 ms 17924 KB Output is correct
8 Correct 229 ms 17968 KB Output is correct
9 Correct 228 ms 17880 KB Output is correct
10 Correct 204 ms 17592 KB Output is correct
11 Correct 104 ms 14932 KB Output is correct
12 Correct 261 ms 17804 KB Output is correct
13 Correct 264 ms 19748 KB Output is correct
14 Correct 234 ms 19768 KB Output is correct
15 Correct 249 ms 19520 KB Output is correct
16 Correct 236 ms 19732 KB Output is correct
17 Correct 249 ms 20328 KB Output is correct
18 Correct 256 ms 21240 KB Output is correct
19 Correct 249 ms 21844 KB Output is correct
20 Correct 273 ms 19800 KB Output is correct
21 Correct 238 ms 20300 KB Output is correct
22 Correct 262 ms 19452 KB Output is correct
23 Correct 108 ms 16184 KB Output is correct
24 Correct 235 ms 21448 KB Output is correct
25 Correct 7 ms 2048 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 14 ms 3796 KB Output is correct
29 Correct 7 ms 2024 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 3 ms 596 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 7 ms 1996 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 206 ms 22248 KB Output is correct
41 Correct 244 ms 21448 KB Output is correct
42 Correct 232 ms 21520 KB Output is correct
43 Correct 107 ms 17084 KB Output is correct
44 Correct 105 ms 17020 KB Output is correct
45 Correct 260 ms 20588 KB Output is correct
46 Correct 220 ms 20192 KB Output is correct
47 Correct 230 ms 21476 KB Output is correct
48 Correct 106 ms 14444 KB Output is correct
49 Correct 185 ms 21864 KB Output is correct
50 Correct 217 ms 20420 KB Output is correct
51 Correct 250 ms 20456 KB Output is correct