oj.uz

답안 #370931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370931 2021-02-25T05:56:44 Z Fysty Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 661 ms 31456 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define F first
#define S second
#define pb push_back
const ll INF=2e18;
vector<pll> ed[100005];
ll dist[100005][5],ds[100005],dt[100005],dv[100005];
ll s,t;
void dijk(ll n)
{
    priority_queue<pair<ll,pll>,vector<pair<ll,pll> >,greater<pair<ll,pll> > > pq;
    pq.push({0,{n,0}});
    dist[n][0]=0;
    while(!pq.empty())
    {
        auto p=pq.top();pq.pop();
        ll d=p.F,u=p.S.F,x=p.S.S;
        if(dist[u][x]<d) continue;
        for(auto tmp:ed[u])
        {
            ll v=tmp.F,len=tmp.S;
            if(x==0)
            {
                if(dist[v][0]>d+len)
                {
                    dist[v][0]=d+len;
                    pq.push({d+len,{v,0}});
                }
                if(ds[u]+dt[v]+len==ds[t])
                {
                    if(dist[v][1]>d)
                    {
                        dist[v][1]=d;
                        pq.push({d,{v,1}});
                    }
                }
                if(ds[v]+dt[u]+len==ds[t])
                {
                    if(dist[v][3]>d)
                    {
                        dist[v][3]=d;
                        pq.push({d,{v,3}});
                    }
                }
            }
            else if(x==1)
            {
                if(dist[v][2]>d+len)
                {
                    dist[v][2]=d+len;
                    pq.push({d+len,{v,2}});
                }
                if(ds[u]+dt[v]+len==ds[t])
                {
                    if(dist[v][1]>d)
                    {
                        dist[v][1]=d;
                        pq.push({d,{v,1}});
                    }
                }
            }
            else if(x==3)
            {
                if(dist[v][2]>d+len)
                {
                    dist[v][2]=d+len;
                    pq.push({d+len,{v,2}});
                }
                if(ds[v]+dt[u]+len==ds[t])
                {
                    if(dist[v][3]>d)
                    {
                        dist[v][3]=d;
                        pq.push({d,{v,3}});
                    }
                }
            }
            else
            {
                if(dist[v][2]>d+len)
                {
                    dist[v][2]=d+len;
                    pq.push({d+len,{v,2}});
                }
            }
        }
    }
}
int main()
{
    int n,m,a,b;
    cin>>n>>m>>s>>t>>a>>b;
    rep(i,m)
    {
        ll u,v,w;
        cin>>u>>v>>w;
        ed[u].pb({v,w});
        ed[v].pb({u,w});
    }
    rep1(i,n) ds[i]=dt[i]=INF;
    rep1(i,n) rep(j,5) dist[i][j]=INF;
    priority_queue<pll,vector<pll>,greater<pll> > pq;
    pq.push({0,s});
    ds[s]=0;
    while(!pq.empty())
    {
        ll d=pq.top().F,u=pq.top().S;pq.pop();
        if(d>ds[u]) continue;
        for(auto v:ed[u])
        {
            if(ds[v.F]<=v.S+d) continue;
            ds[v.F]=v.S+d;
            pq.push({ds[v.F],v.F});
        }
    }
    pq.push({0,t});
    dt[t]=0;
    while(!pq.empty())
    {
        ll d=pq.top().F,u=pq.top().S;pq.pop();
        if(d>dt[u]) continue;
        for(auto v:ed[u])
        {
            if(dt[v.F]<=v.S+d) continue;
            dt[v.F]=v.S+d;
            pq.push({dt[v.F],v.F});
        }
    }
    dijk(a);
    cout<<min({dist[b][0],dist[b][1],dist[b][2],dist[b][3]});
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 517 ms 31192 KB Output is correct
2 Correct 629 ms 27004 KB Output is correct
3 Correct 661 ms 31096 KB Output is correct
4 Correct 550 ms 27228 KB Output is correct
5 Correct 576 ms 29612 KB Output is correct
6 Correct 531 ms 31456 KB Output is correct
7 Correct 594 ms 29784 KB Output is correct
8 Correct 596 ms 29912 KB Output is correct
9 Correct 540 ms 27492 KB Output is correct
10 Correct 490 ms 27792 KB Output is correct
11 Correct 278 ms 17128 KB Output is correct
12 Correct 572 ms 27484 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 599 ms 27104 KB Output is correct
2 Correct 591 ms 26844 KB Output is correct
3 Correct 591 ms 29916 KB Output is correct
4 Correct 586 ms 26876 KB Output is correct
5 Correct 613 ms 26848 KB Output is correct
6 Correct 587 ms 30184 KB Output is correct
7 Correct 637 ms 29784 KB Output is correct
8 Correct 624 ms 26980 KB Output is correct
9 Correct 583 ms 26756 KB Output is correct
10 Correct 589 ms 26720 KB Output is correct
11 Correct 310 ms 18788 KB Output is correct
12 Correct 589 ms 30424 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 4588 KB Output is correct
2 Correct 4 ms 2796 KB Output is correct
3 Correct 3 ms 2796 KB Output is correct
4 Correct 44 ms 6252 KB Output is correct
5 Correct 22 ms 4460 KB Output is correct
6 Correct 4 ms 2796 KB Output is correct
7 Correct 5 ms 2924 KB Output is correct
8 Correct 6 ms 3052 KB Output is correct
9 Correct 4 ms 2924 KB Output is correct
10 Correct 23 ms 4588 KB Output is correct
11 Correct 2 ms 2796 KB Output is correct
12 Correct 3 ms 2796 KB Output is correct
13 Correct 4 ms 2816 KB Output is correct
14 Correct 3 ms 2796 KB Output is correct
15 Correct 4 ms 2796 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 517 ms 31192 KB Output is correct
2 Correct 629 ms 27004 KB Output is correct
3 Correct 661 ms 31096 KB Output is correct
4 Correct 550 ms 27228 KB Output is correct
5 Correct 576 ms 29612 KB Output is correct
6 Correct 531 ms 31456 KB Output is correct
7 Correct 594 ms 29784 KB Output is correct
8 Correct 596 ms 29912 KB Output is correct
9 Correct 540 ms 27492 KB Output is correct
10 Correct 490 ms 27792 KB Output is correct
11 Correct 278 ms 17128 KB Output is correct
12 Correct 572 ms 27484 KB Output is correct
13 Correct 599 ms 27104 KB Output is correct
14 Correct 591 ms 26844 KB Output is correct
15 Correct 591 ms 29916 KB Output is correct
16 Correct 586 ms 26876 KB Output is correct
17 Correct 613 ms 26848 KB Output is correct
18 Correct 587 ms 30184 KB Output is correct
19 Correct 637 ms 29784 KB Output is correct
20 Correct 624 ms 26980 KB Output is correct
21 Correct 583 ms 26756 KB Output is correct
22 Correct 589 ms 26720 KB Output is correct
23 Correct 310 ms 18788 KB Output is correct
24 Correct 589 ms 30424 KB Output is correct
25 Correct 24 ms 4588 KB Output is correct
26 Correct 4 ms 2796 KB Output is correct
27 Correct 3 ms 2796 KB Output is correct
28 Correct 44 ms 6252 KB Output is correct
29 Correct 22 ms 4460 KB Output is correct
30 Correct 4 ms 2796 KB Output is correct
31 Correct 5 ms 2924 KB Output is correct
32 Correct 6 ms 3052 KB Output is correct
33 Correct 4 ms 2924 KB Output is correct
34 Correct 23 ms 4588 KB Output is correct
35 Correct 2 ms 2796 KB Output is correct
36 Correct 3 ms 2796 KB Output is correct
37 Correct 4 ms 2816 KB Output is correct
38 Correct 3 ms 2796 KB Output is correct
39 Correct 4 ms 2796 KB Output is correct
40 Correct 516 ms 31064 KB Output is correct
41 Correct 546 ms 26160 KB Output is correct
42 Correct 553 ms 25952 KB Output is correct
43 Correct 333 ms 18728 KB Output is correct
44 Correct 338 ms 18916 KB Output is correct
45 Correct 601 ms 29792 KB Output is correct
46 Correct 620 ms 29272 KB Output is correct
47 Correct 524 ms 28488 KB Output is correct
48 Correct 320 ms 18232 KB Output is correct
49 Correct 467 ms 30960 KB Output is correct
50 Correct 593 ms 29664 KB Output is correct
51 Correct 636 ms 29528 KB Output is correct