oj.uz

Submission #76570

# Submission time Handle Problem Language Result Execution time Memory
76570 2018-09-14T19:11:58 Z Vasiljko Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 504 ms 23784 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll MOD = 1e9+7;
const int N =1e5+5;
const ll INF = 1e18;

int n,m,T;
bool vis[N];
ll du[N],dv[N],ds[N],dt[N],d1[N],d2[N],dp[N],ans;
vector<pair<int,ll> >v[2*N];
priority_queue<pair<ll,int> >pq;
multiset<ll>su,sv;

void Dijkstra(ll *d,int s){
    for(int i=1;i<=N;i++)d[i]=INF;
    d[s]=0;
    pq.push({-d[s],s});

    while(!pq.empty()){
        auto cur=pq.top();
        pq.pop();

        for(auto e:v[cur.second]){
            if(d[cur.second]+e.second<d[e.first]){
                d[e.first]=d[cur.second]+e.second;
                pq.push({-d[e.first],e.first});
            }
        }
    }
}

ll dfs(int s,int dir){
    if(vis[s])return dp[s];
    vis[s]=true;
    dp[s]=du[s];
    for(auto e:v[s]){
        if(dir==0){//go from s to t
            if(ds[s]+e.second+dt[e.first]==ds[T]){
                dp[s]=min(dp[s],dfs(e.first,dir));
            }
        }else{
            if(dt[s]+e.second+ds[e.first]==ds[T]){
                dp[s]=min(dp[s],dfs(e.first,dir));
            }
        }
    }
    ans=min(ans,dp[s]+dv[s]);
    return dp[s];
}

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int s,t,a,b,x,y,z;

    cin>>n>>m;
    cin>>s>>t;
    cin>>a>>b;

    T=t;

    for(int i=1;i<=m;i++){
        cin>>x>>y>>z;
        v[x].push_back({y,z});
        v[y].push_back({x,z});
    }

    Dijkstra(du,a);
    Dijkstra(dv,b);
    Dijkstra(ds,s);
    Dijkstra(dt,t);

    ans=du[b];
    memset(vis,false,sizeof(vis));
    dfs(s,0);
    memset(vis,0,sizeof(vis));
    dfs(t,1);

    cout<<ans;
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 19968 KB Output is correct
2 Correct 504 ms 20792 KB Output is correct
3 Correct 489 ms 23784 KB Output is correct
4 Correct 382 ms 23784 KB Output is correct
5 Correct 442 ms 23784 KB Output is correct
6 Correct 436 ms 23784 KB Output is correct
7 Correct 466 ms 23784 KB Output is correct
8 Correct 491 ms 23784 KB Output is correct
9 Correct 355 ms 23784 KB Output is correct
10 Correct 333 ms 23784 KB Output is correct
11 Correct 173 ms 23784 KB Output is correct
12 Correct 447 ms 23784 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 447 ms 23784 KB Output is correct
2 Correct 457 ms 23784 KB Output is correct
3 Correct 457 ms 23784 KB Output is correct
4 Correct 474 ms 23784 KB Output is correct
5 Correct 454 ms 23784 KB Output is correct
6 Correct 473 ms 23784 KB Output is correct
7 Correct 468 ms 23784 KB Output is correct
8 Correct 436 ms 23784 KB Output is correct
9 Correct 433 ms 23784 KB Output is correct
10 Correct 431 ms 23784 KB Output is correct
11 Correct 150 ms 23784 KB Output is correct
12 Correct 440 ms 23784 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23784 KB Output is correct
2 Correct 9 ms 23784 KB Output is correct
3 Correct 10 ms 23784 KB Output is correct
4 Correct 29 ms 23784 KB Output is correct
5 Correct 19 ms 23784 KB Output is correct
6 Correct 9 ms 23784 KB Output is correct
7 Correct 10 ms 23784 KB Output is correct
8 Correct 10 ms 23784 KB Output is correct
9 Correct 10 ms 23784 KB Output is correct
10 Correct 19 ms 23784 KB Output is correct
11 Correct 9 ms 23784 KB Output is correct
12 Correct 9 ms 23784 KB Output is correct
13 Correct 9 ms 23784 KB Output is correct
14 Correct 9 ms 23784 KB Output is correct
15 Correct 9 ms 23784 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 19968 KB Output is correct
2 Correct 504 ms 20792 KB Output is correct
3 Correct 489 ms 23784 KB Output is correct
4 Correct 382 ms 23784 KB Output is correct
5 Correct 442 ms 23784 KB Output is correct
6 Correct 436 ms 23784 KB Output is correct
7 Correct 466 ms 23784 KB Output is correct
8 Correct 491 ms 23784 KB Output is correct
9 Correct 355 ms 23784 KB Output is correct
10 Correct 333 ms 23784 KB Output is correct
11 Correct 173 ms 23784 KB Output is correct
12 Correct 447 ms 23784 KB Output is correct
13 Correct 447 ms 23784 KB Output is correct
14 Correct 457 ms 23784 KB Output is correct
15 Correct 457 ms 23784 KB Output is correct
16 Correct 474 ms 23784 KB Output is correct
17 Correct 454 ms 23784 KB Output is correct
18 Correct 473 ms 23784 KB Output is correct
19 Correct 468 ms 23784 KB Output is correct
20 Correct 436 ms 23784 KB Output is correct
21 Correct 433 ms 23784 KB Output is correct
22 Correct 431 ms 23784 KB Output is correct
23 Correct 150 ms 23784 KB Output is correct
24 Correct 440 ms 23784 KB Output is correct
25 Correct 19 ms 23784 KB Output is correct
26 Correct 9 ms 23784 KB Output is correct
27 Correct 10 ms 23784 KB Output is correct
28 Correct 29 ms 23784 KB Output is correct
29 Correct 19 ms 23784 KB Output is correct
30 Correct 9 ms 23784 KB Output is correct
31 Correct 10 ms 23784 KB Output is correct
32 Correct 10 ms 23784 KB Output is correct
33 Correct 10 ms 23784 KB Output is correct
34 Correct 19 ms 23784 KB Output is correct
35 Correct 9 ms 23784 KB Output is correct
36 Correct 9 ms 23784 KB Output is correct
37 Correct 9 ms 23784 KB Output is correct
38 Correct 9 ms 23784 KB Output is correct
39 Correct 9 ms 23784 KB Output is correct
40 Correct 390 ms 23784 KB Output is correct
41 Correct 382 ms 23784 KB Output is correct
42 Correct 373 ms 23784 KB Output is correct
43 Correct 158 ms 23784 KB Output is correct
44 Correct 216 ms 23784 KB Output is correct
45 Correct 392 ms 23784 KB Output is correct
46 Correct 373 ms 23784 KB Output is correct
47 Correct 355 ms 23784 KB Output is correct
48 Correct 194 ms 23784 KB Output is correct
49 Correct 302 ms 23784 KB Output is correct
50 Correct 359 ms 23784 KB Output is correct
51 Correct 362 ms 23784 KB Output is correct