oj.uz

Submission #696737

# Submission time Handle Problem Language Result Execution time Memory
696737 2023-02-07T06:30:37 Z ToroTN Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 428 ms 25164 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define X first 
#define Y second
ll n,m,S,T,U,V,u_i,v_i,w_i,fromu[100005],fromv[100005],u,y,cost,froms[100005],fromt[100005];
ll ans,us[100005],vs[100005],ut[100005],vt[100005];
vector<pair<ll,ll> > v[100005];
priority_queue<pair<ll,ll> > pq;
void debug_arr(ll arr[])
{
    for(int i=1;i<=n;i++)
    {
        printf("%lld ",arr[i]);
    }
    printf("\n");
}
void dij(ll st,ll d[])
{
    for(int i=1;i<=n;i++)d[i]=1e18;
    d[st]=0;
    pq.push({0,st});
    while(!pq.empty())
    {
        u=pq.top().Y;
        pq.pop();
        for(int i=0;i<v[u].size();i++)
        {
            y=v[u][i].X,cost=v[u][i].Y;
            if(d[u]+cost<d[y])
            {
                d[y]=d[u]+cost;
                pq.push({-d[y],y});
            }
        }        
    }
}
void dij2(ll st,ll d[],ll du[],ll dv[])
{
    for(int i=1;i<=n;i++)d[i]=1e18,du[i]=1e18,dv[i]=1e18;
    d[st]=0,du[st]=fromu[st],dv[st]=fromv[st];
    pq.push({0,st});
    while(!pq.empty())
    {
        u=pq.top().Y;
        pq.pop();
        for(int i=0;i<v[u].size();i++)
        {
            y=v[u][i].X,cost=v[u][i].Y;
            if(d[u]+cost<d[y])
            {
                d[y]=d[u]+cost;
                du[y]=min(du[u],fromu[y]);
                dv[y]=min(dv[u],fromv[y]);
                pq.push({-d[y],y});
            }else if(d[u]+cost==d[y])
            {
                du[y]=min(du[y],min(du[u],fromu[y]));
                dv[y]=min(dv[y],min(dv[u],fromv[y]));
            }
        }        
    }
}
int main()
{
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin >> n >> m >> S >> T >> U >> V;
    for(int i=1;i<=m;i++)
    {
        cin >> u_i >> v_i >> w_i;
        v[u_i].pb({v_i,w_i});
        v[v_i].pb({u_i,w_i});
    }
    dij(U,fromu);
    dij(V,fromv);
    ans=fromu[V];
    /*printf("basic\n");
    debug_arr(fromu),debug_arr(fromv);*/
    dij2(S,froms,us,vs);
    dij2(T,fromt,ut,vt);
    /*printf("s\n");
    debug_arr(froms),debug_arr(us),debug_arr(vs);
    printf("t\n");
    debug_arr(fromt),debug_arr(ut),debug_arr(vt);*/
    for(int i=1;i<=n;i++)
    {
        if(froms[i]+fromt[i]==froms[T])
        {
            ans=min(ans,us[i]+vt[i]);
            ans=min(ans,ut[i]+vs[i]);
        }
    }
    printf("%lld\n",ans);
}

Compilation message

commuter_pass.cpp: In function 'void dij(long long int, long long int*)':
commuter_pass.cpp:28:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         for(int i=0;i<v[u].size();i++)
      |                     ~^~~~~~~~~~~~
commuter_pass.cpp: In function 'void dij2(long long int, long long int*, long long int*, long long int*)':
commuter_pass.cpp:48:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for(int i=0;i<v[u].size();i++)
      |                     ~^~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 24300 KB Output is correct
2 Correct 382 ms 23820 KB Output is correct
3 Correct 361 ms 25164 KB Output is correct
4 Correct 292 ms 24580 KB Output is correct
5 Correct 327 ms 23616 KB Output is correct
6 Correct 345 ms 24396 KB Output is correct
7 Correct 328 ms 23756 KB Output is correct
8 Correct 392 ms 23716 KB Output is correct
9 Correct 295 ms 24504 KB Output is correct
10 Correct 246 ms 24396 KB Output is correct
11 Correct 161 ms 16088 KB Output is correct
12 Correct 331 ms 24368 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 403 ms 24136 KB Output is correct
2 Correct 362 ms 23824 KB Output is correct
3 Correct 428 ms 23824 KB Output is correct
4 Correct 367 ms 23780 KB Output is correct
5 Correct 403 ms 23792 KB Output is correct
6 Correct 331 ms 24020 KB Output is correct
7 Correct 409 ms 23604 KB Output is correct
8 Correct 370 ms 23716 KB Output is correct
9 Correct 366 ms 23744 KB Output is correct
10 Correct 375 ms 23676 KB Output is correct
11 Correct 136 ms 16344 KB Output is correct
12 Correct 327 ms 24180 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4424 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 18 ms 6184 KB Output is correct
5 Correct 8 ms 4424 KB Output is correct
6 Correct 2 ms 2824 KB Output is correct
7 Correct 3 ms 2900 KB Output is correct
8 Correct 4 ms 2900 KB Output is correct
9 Correct 3 ms 2820 KB Output is correct
10 Correct 9 ms 4492 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2824 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 24300 KB Output is correct
2 Correct 382 ms 23820 KB Output is correct
3 Correct 361 ms 25164 KB Output is correct
4 Correct 292 ms 24580 KB Output is correct
5 Correct 327 ms 23616 KB Output is correct
6 Correct 345 ms 24396 KB Output is correct
7 Correct 328 ms 23756 KB Output is correct
8 Correct 392 ms 23716 KB Output is correct
9 Correct 295 ms 24504 KB Output is correct
10 Correct 246 ms 24396 KB Output is correct
11 Correct 161 ms 16088 KB Output is correct
12 Correct 331 ms 24368 KB Output is correct
13 Correct 403 ms 24136 KB Output is correct
14 Correct 362 ms 23824 KB Output is correct
15 Correct 428 ms 23824 KB Output is correct
16 Correct 367 ms 23780 KB Output is correct
17 Correct 403 ms 23792 KB Output is correct
18 Correct 331 ms 24020 KB Output is correct
19 Correct 409 ms 23604 KB Output is correct
20 Correct 370 ms 23716 KB Output is correct
21 Correct 366 ms 23744 KB Output is correct
22 Correct 375 ms 23676 KB Output is correct
23 Correct 136 ms 16344 KB Output is correct
24 Correct 327 ms 24180 KB Output is correct
25 Correct 9 ms 4424 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 18 ms 6184 KB Output is correct
29 Correct 8 ms 4424 KB Output is correct
30 Correct 2 ms 2824 KB Output is correct
31 Correct 3 ms 2900 KB Output is correct
32 Correct 4 ms 2900 KB Output is correct
33 Correct 3 ms 2820 KB Output is correct
34 Correct 9 ms 4492 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 2 ms 2772 KB Output is correct
37 Correct 2 ms 2772 KB Output is correct
38 Correct 2 ms 2824 KB Output is correct
39 Correct 2 ms 2772 KB Output is correct
40 Correct 287 ms 24304 KB Output is correct
41 Correct 297 ms 24476 KB Output is correct
42 Correct 287 ms 24476 KB Output is correct
43 Correct 105 ms 16208 KB Output is correct
44 Correct 108 ms 16284 KB Output is correct
45 Correct 306 ms 23320 KB Output is correct
46 Correct 244 ms 23052 KB Output is correct
47 Correct 279 ms 24216 KB Output is correct
48 Correct 111 ms 15696 KB Output is correct
49 Correct 229 ms 23968 KB Output is correct
50 Correct 304 ms 23472 KB Output is correct
51 Correct 256 ms 23272 KB Output is correct