oj.uz

Submission #116014

# Submission time Handle Problem Language Result Execution time Memory
116014 2019-06-10T07:47:02 Z oolimry Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 636 ms 27108 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    //freopen("i.txt","r",stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    int s, t, p, q;
    cin >> s >> t >> p >> q;
    s--;
    t--;
    p--;
    q--;

    typedef pair<long long, long long> ii;

    vector<ii> adj[n];

    for(int i = 0;i < m;i++){
        int a, b, c;
        cin >> a >> b >> c;
        a--;
        b--;
        adj[a].push_back(ii(c,b));
        adj[b].push_back(ii(c,a));
    }

    priority_queue<ii, vector<ii>, greater<ii> > dtr;

    long long disp[n];
    long long disq[n];
    long long dis[n];
    long long dist[n];
    fill(disp,disp+n,102345678901234567ll);
    fill(disq,disq+n,102345678901234567ll);
    fill(dis,dis+n,102345678901234567ll);
    fill(dist,dist+n,102345678901234567ll);

    disp[p] = 0;
    dtr.push(ii(0,p));
    while(!dtr.empty()){
        ii cur = dtr.top();
        dtr.pop();
        for(ii nei : adj[cur.second]){
            if(disp[nei.second] > nei.first + cur.first){
                disp[nei.second] = nei.first + cur.first;
                dtr.push(ii(disp[nei.second],nei.second));
            }
        }
    }

    for(int i = 0;i < n;i++){
      //  cout << disp[i] << " ";
    }
   // cout << "\n";


    disq[q] = 0;
    dtr.push(ii(0,q));
    while(!dtr.empty()){
        ii cur = dtr.top();
        dtr.pop();
        for(ii nei : adj[cur.second]){
            if(disq[nei.second] > nei.first + cur.first){
                disq[nei.second] = nei.first + cur.first;
                dtr.push(ii(disq[nei.second],nei.second));
            }
        }
    }

    for(int i = 0;i < n;i++){
       // cout << disq[i] << " ";
    }
    //cout << "\n";

    dis[s] = 0;
    dtr.push(ii(0,s));
    while(!dtr.empty()){
        ii cur = dtr.top();
        dtr.pop();
        for(ii nei : adj[cur.second]){
            if(dis[nei.second] > nei.first + cur.first){
                dis[nei.second] = nei.first + cur.first;
                dtr.push(ii(dis[nei.second],nei.second));
            }
        }
    }

    for(int i = 0;i < n;i++){
       // cout << dis[i] << " ";
    }
    //cout << "\n";


    dist[t] = 0;
    dtr.push(ii(0,t));
    while(!dtr.empty()){
        ii cur = dtr.top();
        dtr.pop();
        for(ii nei : adj[cur.second]){
            if(dist[nei.second] > nei.first + cur.first){
                dist[nei.second] = nei.first + cur.first;
                dtr.push(ii(dist[nei.second],nei.second));
            }
        }
    }

    for(int i = 0;i < n;i++){
        //cout << dist[i] << " ";
    }
   // cout << "\n";


    vector<int> dag[n];
    int indegree[n];
    fill(indegree,indegree+n,0);
    for(int u = 0;u < n;u++){
        if(dis[u]+dist[u] != dis[t]) continue;
        for(ii v : adj[u]){
            if(dis[v.second] + dist[v.second] != dis[t]) continue;
            if(dis[u] + v.first == dis[v.second]){
               // cout << v.second << " " << u << "\n";
                dag[v.second].push_back(u);
                indegree[u]++;
            }
        }
    }
    //cout << "\n\n";
    ii dp[n];
    for(int i = 0;i < n;i++){
        dp[i] = ii(disp[i],disq[i]);

    }
    queue<int> bfs;
    bfs.push(t);
    while(!bfs.empty()){
        int u = bfs.front();
        bfs.pop();
        //cout << u << " ";
        for(int v : dag[u]){
            indegree[v]--;
            if(indegree[v] == 0) bfs.push(v);
            dp[v].first = min(dp[v].first, dp[u].first);
            dp[v].second = min(dp[v].second, dp[u].second);
        }
    }
    long long ans = disp[q];
    //cout << "\n";
    for(int i = 0;i < n;i++){
        //cout << dp[i].first << " " << dp[i].second << "\n";
        if(dis[i]+dist[i] != dis[t]) continue;
        ans = min(ans, disq[i] + dp[i].first);
        ans = min(ans, disp[i] + dp[i].second);
    }

    cout << ans << "\n";


    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 489 ms 25704 KB Output is correct
2 Correct 537 ms 25192 KB Output is correct
3 Correct 541 ms 26852 KB Output is correct
4 Correct 428 ms 25696 KB Output is correct
5 Correct 485 ms 25836 KB Output is correct
6 Correct 512 ms 25704 KB Output is correct
7 Correct 533 ms 26348 KB Output is correct
8 Correct 578 ms 26096 KB Output is correct
9 Correct 479 ms 25844 KB Output is correct
10 Correct 379 ms 25724 KB Output is correct
11 Correct 266 ms 18540 KB Output is correct
12 Correct 502 ms 25836 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 531 ms 25448 KB Output is correct
2 Correct 553 ms 25192 KB Output is correct
3 Correct 636 ms 25148 KB Output is correct
4 Correct 591 ms 25196 KB Output is correct
5 Correct 573 ms 25324 KB Output is correct
6 Correct 526 ms 26576 KB Output is correct
7 Correct 602 ms 26348 KB Output is correct
8 Correct 564 ms 25192 KB Output is correct
9 Correct 533 ms 25452 KB Output is correct
10 Correct 548 ms 25108 KB Output is correct
11 Correct 231 ms 19064 KB Output is correct
12 Correct 532 ms 26740 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2048 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 19 ms 3840 KB Output is correct
5 Correct 11 ms 2048 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 4 ms 560 KB Output is correct
10 Correct 11 ms 2048 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 524 KB Output is correct
15 Correct 3 ms 384 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 489 ms 25704 KB Output is correct
2 Correct 537 ms 25192 KB Output is correct
3 Correct 541 ms 26852 KB Output is correct
4 Correct 428 ms 25696 KB Output is correct
5 Correct 485 ms 25836 KB Output is correct
6 Correct 512 ms 25704 KB Output is correct
7 Correct 533 ms 26348 KB Output is correct
8 Correct 578 ms 26096 KB Output is correct
9 Correct 479 ms 25844 KB Output is correct
10 Correct 379 ms 25724 KB Output is correct
11 Correct 266 ms 18540 KB Output is correct
12 Correct 502 ms 25836 KB Output is correct
13 Correct 531 ms 25448 KB Output is correct
14 Correct 553 ms 25192 KB Output is correct
15 Correct 636 ms 25148 KB Output is correct
16 Correct 591 ms 25196 KB Output is correct
17 Correct 573 ms 25324 KB Output is correct
18 Correct 526 ms 26576 KB Output is correct
19 Correct 602 ms 26348 KB Output is correct
20 Correct 564 ms 25192 KB Output is correct
21 Correct 533 ms 25452 KB Output is correct
22 Correct 548 ms 25108 KB Output is correct
23 Correct 231 ms 19064 KB Output is correct
24 Correct 532 ms 26740 KB Output is correct
25 Correct 12 ms 2048 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 19 ms 3840 KB Output is correct
29 Correct 11 ms 2048 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 5 ms 640 KB Output is correct
33 Correct 4 ms 560 KB Output is correct
34 Correct 11 ms 2048 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 3 ms 384 KB Output is correct
38 Correct 3 ms 524 KB Output is correct
39 Correct 3 ms 384 KB Output is correct
40 Correct 442 ms 25544 KB Output is correct
41 Correct 451 ms 25908 KB Output is correct
42 Correct 472 ms 25968 KB Output is correct
43 Correct 235 ms 20344 KB Output is correct
44 Correct 220 ms 20344 KB Output is correct
45 Correct 476 ms 27108 KB Output is correct
46 Correct 473 ms 26736 KB Output is correct
47 Correct 459 ms 25676 KB Output is correct
48 Correct 290 ms 19704 KB Output is correct
49 Correct 384 ms 25340 KB Output is correct
50 Correct 531 ms 26472 KB Output is correct
51 Correct 481 ms 26984 KB Output is correct