oj.uz

Submission #945713

# Submission time Handle Problem Language Result Execution time Memory
945713 2024-03-14T06:37:19 Z ezzzay Commuter Pass (JOI18_commuter_pass) C++14
0 / 100
 271 ms 30660 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
vector<pair<int,int>>v[N];
int dist[N];
int tmp[N];
int par[N];
bool vis[N];
vector<pair<int,int>>vc;
void dfs(int a){
    vis[a]=1;
    for(auto p:v[a]){
        int b=p.ff;
        int c=p.ss;
        if(vis[b]==0 and dist[b]+c==dist[a])dfs(b);
    }
}
signed main(){
    int n,m,s,t,x,y;
    cin>>n>>m>>s>>t>>x>>y;
    for(int i=0;i<m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        v[a].pb({b,c});
        v[b].pb({a,c});
    }
    for(int i=1;i<=n;i++){
        dist[i]=1e16;
    }
    priority_queue<pair<int,int>>q;
    q.push({0,s});
    par[s]=s;
    dist[s]=0;
    vis[s]=1;
    while(!q.empty()){
        int w=-q.top().ff;
        int a=q.top().ss;
        q.pop();
        if(dist[a]<w)continue;
        for(auto p:v[a]){
            
            int b=p.ff;
            int c=p.ss;
            if(dist[a]+c<dist[b]){
               
                dist[b]=dist[a]+c;
                par[b]=a;
                q.push({-dist[b],b});
            }
        }
    }
    
    dfs(t);
    for(int i=1;i<=n;i++){
        dist[i]=1e16;
    }
    s=y;
    q.push({0,s});
    dist[s]=0;
    while(!q.empty()){
        int w=-q.top().ff;
        int a=q.top().ss;
        q.pop();
        if(dist[a]<w)continue;
        for(auto p:v[a]){
            int b=p.ff;
            int c=p.ss;
            if(dist[a]+c<dist[b]){
                dist[b]=dist[a]+c;
                par[b]=a;
                q.push({-dist[b],b});
            }
        }
    }
    int ans=INT_MAX;
    for(int i=1;i<=n;i++){
        if(vis[i]){
           
            ans=min(ans,dist[i]);
        }
    }
    cout<<ans;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 25124 KB Output is correct
2 Correct 217 ms 27600 KB Output is correct
3 Correct 252 ms 30660 KB Output is correct
4 Correct 230 ms 28868 KB Output is correct
5 Correct 219 ms 27456 KB Output is correct
6 Correct 221 ms 28872 KB Output is correct
7 Correct 216 ms 27588 KB Output is correct
8 Correct 219 ms 27496 KB Output is correct
9 Incorrect 271 ms 28440 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 25396 KB Output is correct
2 Correct 218 ms 25540 KB Output is correct
3 Incorrect 217 ms 25092 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 14172 KB Output is correct
2 Incorrect 3 ms 12636 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 25124 KB Output is correct
2 Correct 217 ms 27600 KB Output is correct
3 Correct 252 ms 30660 KB Output is correct
4 Correct 230 ms 28868 KB Output is correct
5 Correct 219 ms 27456 KB Output is correct
6 Correct 221 ms 28872 KB Output is correct
7 Correct 216 ms 27588 KB Output is correct
8 Correct 219 ms 27496 KB Output is correct
9 Incorrect 271 ms 28440 KB Output isn't correct
10 Halted 0 ms 0 KB -