oj.uz

Submission #47137

# Submission time Handle Problem Language Result Execution time Memory
47137 2018-04-27T22:02:44 Z dqhungdl Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 705 ms 156224 KB 
#include <bits/stdc++.h>
using namespace std;

typedef pair<int64_t,int64_t> ii;
typedef pair<ii,int64_t> iii;
int64_t n,m,S,T,U,V,res,d[100005],dS[100005],dT[100005],dU[100005],dV[100005],F1[100005],F2[100005];
bool Free[100005];
vector<int64_t> dag[100005];
vector<ii> g[100005];
vector<iii> Edge;
set<ii> s;

void Dijkstra(int64_t start)
{
    for(int64_t i=1; i<=n; i++)
        d[i]=1e15;
    d[start]=0;
    s.insert(ii(0,start));
    while(s.size()>0)
    {
        int64_t u=(*s.begin()).second;
        s.erase(s.begin());
        for(int64_t i=0; i<g[u].size(); i++)
        {
            int64_t v=g[u][i].first;
            int64_t w=g[u][i].second;
            if(d[v]>d[u]+w)
            {
                if(d[v]!=1e15)
                    s.erase(s.find(ii(d[v],v)));
                d[v]=d[u]+w;
                s.insert(ii(d[v],v));
            }
        }
    }
}

void DFS(int64_t u)
{
    Free[u]=true;
    F1[u]=dV[u];
    F2[u]=dU[u];
    for(int64_t i=0; i<dag[u].size(); i++)
    {
        int64_t v=dag[u][i];
        if(Free[v]==false)
            DFS(v);
        F1[u]=min(F1[u],F1[v]);
        F2[u]=min(F2[u],F2[v]);
    }
    res=min(res,min(dU[u]+F1[u],dV[u]+F2[u]));
}

int main()
{
    ios_base::sync_with_stdio(false);
    //freopen("TEST.INP","r",stdin);
    cin>>n>>m>>S>>T>>U>>V;
    int64_t u,v,w;
    while(m--)
    {
        cin>>u>>v>>w;
        Edge.push_back(iii(ii(u,v),w));
        g[u].push_back(ii(v,w));
        g[v].push_back(ii(u,w));
    }
    Dijkstra(S);
    for(int64_t i=1; i<=n; i++)
        dS[i]=d[i];
    Dijkstra(T);
    for(int64_t i=1; i<=n; i++)
        dT[i]=d[i];
    Dijkstra(U);
    for(int64_t i=1; i<=n; i++)
        dU[i]=d[i];
    Dijkstra(V);
    for(int64_t i=1; i<=n; i++)
        dV[i]=d[i];
    for(int64_t i=0; i<Edge.size(); i++)
    {
        int64_t u=Edge[i].first.first;
        int64_t v=Edge[i].first.second;
        int64_t w=Edge[i].second;
        if(dS[u]+dT[v]+w==dS[T])
            dag[u].push_back(v);
        if(dS[v]+dT[u]+w==dS[T])
            dag[v].push_back(u);
    }
    res=dU[V];
    DFS(S);
    cout<<res;
}

Compilation message

commuter_pass.cpp: In function 'void Dijkstra(int64_t)':
commuter_pass.cpp:23:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int64_t i=0; i<g[u].size(); i++)
                          ~^~~~~~~~~~~~
commuter_pass.cpp: In function 'void DFS(int64_t)':
commuter_pass.cpp:43:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int64_t i=0; i<dag[u].size(); i++)
                      ~^~~~~~~~~~~~~~
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:79:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int64_t i=0; i<Edge.size(); i++)
                      ~^~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 626 ms 31148 KB Output is correct
2 Correct 573 ms 35316 KB Output is correct
3 Correct 577 ms 41956 KB Output is correct
4 Correct 620 ms 42332 KB Output is correct
5 Correct 550 ms 46492 KB Output is correct
6 Correct 705 ms 49836 KB Output is correct
7 Correct 606 ms 53724 KB Output is correct
8 Correct 606 ms 57620 KB Output is correct
9 Correct 554 ms 59968 KB Output is correct
10 Correct 439 ms 64720 KB Output is correct
11 Correct 199 ms 64720 KB Output is correct
12 Correct 607 ms 70692 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 653 ms 77756 KB Output is correct
2 Correct 619 ms 80716 KB Output is correct
3 Correct 632 ms 84032 KB Output is correct
4 Correct 672 ms 87660 KB Output is correct
5 Correct 647 ms 91668 KB Output is correct
6 Correct 591 ms 96412 KB Output is correct
7 Correct 654 ms 99972 KB Output is correct
8 Correct 664 ms 101812 KB Output is correct
9 Correct 649 ms 105700 KB Output is correct
10 Correct 627 ms 108628 KB Output is correct
11 Correct 226 ms 108628 KB Output is correct
12 Correct 649 ms 116204 KB Output is correct

Subtask #3
24.0 / 24.0

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

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 626 ms 31148 KB Output is correct
2 Correct 573 ms 35316 KB Output is correct
3 Correct 577 ms 41956 KB Output is correct
4 Correct 620 ms 42332 KB Output is correct
5 Correct 550 ms 46492 KB Output is correct
6 Correct 705 ms 49836 KB Output is correct
7 Correct 606 ms 53724 KB Output is correct
8 Correct 606 ms 57620 KB Output is correct
9 Correct 554 ms 59968 KB Output is correct
10 Correct 439 ms 64720 KB Output is correct
11 Correct 199 ms 64720 KB Output is correct
12 Correct 607 ms 70692 KB Output is correct
13 Correct 653 ms 77756 KB Output is correct
14 Correct 619 ms 80716 KB Output is correct
15 Correct 632 ms 84032 KB Output is correct
16 Correct 672 ms 87660 KB Output is correct
17 Correct 647 ms 91668 KB Output is correct
18 Correct 591 ms 96412 KB Output is correct
19 Correct 654 ms 99972 KB Output is correct
20 Correct 664 ms 101812 KB Output is correct
21 Correct 649 ms 105700 KB Output is correct
22 Correct 627 ms 108628 KB Output is correct
23 Correct 226 ms 108628 KB Output is correct
24 Correct 649 ms 116204 KB Output is correct
25 Correct 17 ms 116204 KB Output is correct
26 Correct 6 ms 116204 KB Output is correct
27 Correct 6 ms 116204 KB Output is correct
28 Correct 30 ms 116204 KB Output is correct
29 Correct 20 ms 116204 KB Output is correct
30 Correct 7 ms 116204 KB Output is correct
31 Correct 7 ms 116204 KB Output is correct
32 Correct 8 ms 116204 KB Output is correct
33 Correct 8 ms 116204 KB Output is correct
34 Correct 17 ms 116204 KB Output is correct
35 Correct 6 ms 116204 KB Output is correct
36 Correct 6 ms 116204 KB Output is correct
37 Correct 6 ms 116204 KB Output is correct
38 Correct 6 ms 116204 KB Output is correct
39 Correct 7 ms 116204 KB Output is correct
40 Correct 705 ms 121148 KB Output is correct
41 Correct 627 ms 122608 KB Output is correct
42 Correct 662 ms 126984 KB Output is correct
43 Correct 213 ms 126984 KB Output is correct
44 Correct 228 ms 128092 KB Output is correct
45 Correct 513 ms 136816 KB Output is correct
46 Correct 522 ms 140060 KB Output is correct
47 Correct 640 ms 142992 KB Output is correct
48 Correct 299 ms 142992 KB Output is correct
49 Correct 521 ms 149772 KB Output is correct
50 Correct 536 ms 151928 KB Output is correct
51 Correct 481 ms 156224 KB Output is correct