oj.uz

Submission #74037

# Submission time Handle Problem Language Result Execution time Memory
74037 2018-08-29T16:19:33 Z Bodo171 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 977 ms 87412 KB 
#include <iostream>
#include <fstream>
#include <queue>
#include <climits>
#include <vector>
using namespace std;
const int nmax=100005;
priority_queue< pair<long long,int> > pq;
vector< pair<int,long long> > v[nmax];
long long dS[nmax],dT[nmax],dd[4*nmax];
int i,n,x,nod,newhow,how,s,t,u,vv,m,a,b,c;
long long di,D,dist;
void dij(int source,long long d[])
{
    for(i=1;i<=n;i++)
        d[i]=LLONG_MAX;
    d[source]=0;
    pq.push({0,source});
    while(!pq.empty())
    {
        x=pq.top().second;di=-pq.top().first;
        pq.pop();
        for(i=0;i<v[x].size();i++)
        {
            nod=v[x][i].first;D=di+v[x][i].second;
            if(D<d[nod])
            {
                d[nod]=D;
                pq.push({-D,nod});
            }
        }
    }
}
void exs()
{
    for(int i=0;i<v[x].size();i++)
    {
         nod=v[x][i].first;D=di+v[x][i].second;
         newhow=3*(how!=0);
         if(D<dd[nod*4+newhow])
         {
             dd[nod*4+newhow]=D;
             pq.push({-D,nod*4+newhow});
         }
    }
}
bool ok(int par,int A,int B,long long len)
{
    if(par==1)
    {
        return (dS[A]+dT[B]+len==dist&&dS[A]<dS[B]);
    }
    else
    {
        return (dT[A]+dS[B]+len==dist&&dT[A]<dT[B]);
    }
}
void ex(int par)
{
      for(int i=0;i<v[x].size();i++)
    {
         nod=v[x][i].first;D=di;
         if(D<dd[nod*4+par]&&ok(par,x,nod,v[x][i].second))
         {
             dd[nod*4+par]=D;
             pq.push({-D,nod*4+par});
         }
    }
}
long long calc()
{
    //0-drum normal
    //1- de la s la t
    //2-de la t la s
    //3-drum normal din nou
    for(i=1;i<=4*n+5;i++)
        dd[i]=LLONG_MAX;
    dd[4*u]=0;
    pq.push({0,4*u});
    while(!pq.empty())
    {
        x=((pq.top().second)>>2);how=((pq.top().second)&3);
        di=-pq.top().first;
        pq.pop();
        if(x==vv)
            return di;
        if(how==0)
        {
            exs();
            ex(1);
            ex(2);
        }
        if(how==1)
        {
            ex(1);
            exs();
        }
        if(how==2)
        {
            ex(2);
            exs();
        }
        if(how==3)
        {
            exs();
        }
    }
    return 0;
}
int main()
{
   // freopen("data.in","r",stdin);
    cin>>n>>m;
    cin>>s>>t;
    cin>>u>>vv;
    for(i=1;i<=m;i++)
    {
        cin>>a>>b>>c;
        v[a].push_back({b,c});
        v[b].push_back({a,c});
    }
    dij(s,dS);
    dij(t,dT);
    dist=dS[t];
    cout<<calc();
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'void dij(int, long long int*)':
commuter_pass.cpp:23:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
commuter_pass.cpp: In function 'void exs()':
commuter_pass.cpp:36:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
commuter_pass.cpp: In function 'void ex(int)':
commuter_pass.cpp:60:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i=0;i<v[x].size();i++)
                   ~^~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 743 ms 22252 KB Output is correct
2 Correct 759 ms 22252 KB Output is correct
3 Correct 866 ms 22340 KB Output is correct
4 Correct 703 ms 22340 KB Output is correct
5 Correct 726 ms 22340 KB Output is correct
6 Correct 786 ms 22340 KB Output is correct
7 Correct 596 ms 22340 KB Output is correct
8 Correct 597 ms 22340 KB Output is correct
9 Correct 676 ms 22340 KB Output is correct
10 Correct 652 ms 22340 KB Output is correct
11 Correct 422 ms 22340 KB Output is correct
12 Correct 652 ms 22340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 654 ms 22340 KB Output is correct
2 Correct 707 ms 22340 KB Output is correct
3 Correct 623 ms 22340 KB Output is correct
4 Correct 663 ms 22340 KB Output is correct
5 Correct 850 ms 23856 KB Output is correct
6 Correct 977 ms 29600 KB Output is correct
7 Correct 652 ms 31044 KB Output is correct
8 Correct 856 ms 34616 KB Output is correct
9 Correct 677 ms 38112 KB Output is correct
10 Correct 662 ms 40568 KB Output is correct
11 Correct 461 ms 40568 KB Output is correct
12 Correct 954 ms 49484 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 49484 KB Output is correct
2 Correct 5 ms 49484 KB Output is correct
3 Correct 7 ms 49484 KB Output is correct
4 Correct 78 ms 49484 KB Output is correct
5 Correct 39 ms 49484 KB Output is correct
6 Correct 10 ms 49484 KB Output is correct
7 Correct 9 ms 49484 KB Output is correct
8 Correct 11 ms 49484 KB Output is correct
9 Correct 7 ms 49484 KB Output is correct
10 Correct 42 ms 49484 KB Output is correct
11 Correct 8 ms 49484 KB Output is correct
12 Correct 8 ms 49484 KB Output is correct
13 Correct 7 ms 49484 KB Output is correct
14 Correct 8 ms 49484 KB Output is correct
15 Correct 6 ms 49484 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 743 ms 22252 KB Output is correct
2 Correct 759 ms 22252 KB Output is correct
3 Correct 866 ms 22340 KB Output is correct
4 Correct 703 ms 22340 KB Output is correct
5 Correct 726 ms 22340 KB Output is correct
6 Correct 786 ms 22340 KB Output is correct
7 Correct 596 ms 22340 KB Output is correct
8 Correct 597 ms 22340 KB Output is correct
9 Correct 676 ms 22340 KB Output is correct
10 Correct 652 ms 22340 KB Output is correct
11 Correct 422 ms 22340 KB Output is correct
12 Correct 652 ms 22340 KB Output is correct
13 Correct 654 ms 22340 KB Output is correct
14 Correct 707 ms 22340 KB Output is correct
15 Correct 623 ms 22340 KB Output is correct
16 Correct 663 ms 22340 KB Output is correct
17 Correct 850 ms 23856 KB Output is correct
18 Correct 977 ms 29600 KB Output is correct
19 Correct 652 ms 31044 KB Output is correct
20 Correct 856 ms 34616 KB Output is correct
21 Correct 677 ms 38112 KB Output is correct
22 Correct 662 ms 40568 KB Output is correct
23 Correct 461 ms 40568 KB Output is correct
24 Correct 954 ms 49484 KB Output is correct
25 Correct 32 ms 49484 KB Output is correct
26 Correct 5 ms 49484 KB Output is correct
27 Correct 7 ms 49484 KB Output is correct
28 Correct 78 ms 49484 KB Output is correct
29 Correct 39 ms 49484 KB Output is correct
30 Correct 10 ms 49484 KB Output is correct
31 Correct 9 ms 49484 KB Output is correct
32 Correct 11 ms 49484 KB Output is correct
33 Correct 7 ms 49484 KB Output is correct
34 Correct 42 ms 49484 KB Output is correct
35 Correct 8 ms 49484 KB Output is correct
36 Correct 8 ms 49484 KB Output is correct
37 Correct 7 ms 49484 KB Output is correct
38 Correct 8 ms 49484 KB Output is correct
39 Correct 6 ms 49484 KB Output is correct
40 Correct 877 ms 54400 KB Output is correct
41 Correct 687 ms 56340 KB Output is correct
42 Correct 660 ms 60616 KB Output is correct
43 Correct 417 ms 60616 KB Output is correct
44 Correct 328 ms 60800 KB Output is correct
45 Correct 574 ms 69444 KB Output is correct
46 Correct 682 ms 74856 KB Output is correct
47 Correct 789 ms 76528 KB Output is correct
48 Correct 416 ms 76528 KB Output is correct
49 Correct 906 ms 83100 KB Output is correct
50 Correct 882 ms 87412 KB Output is correct
51 Correct 483 ms 87412 KB Output is correct