oj.uz

답안 #852667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852667 2023-09-22T12:42:34 Z nghiaaa Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 266 ms 29772 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ii pair<int,int>
#define f first
#define s second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define BIT(i) ((ll)1<<i)
#define endl "\n"
#define debug(x) for (auto p: x) cout<<p<<' ';cout<<endl
#define forw(i,j,z) for(int i=(int)j;i<=(int)z;i++)
#define forw2(i,j,z,k) for(int i=(int)j;i<=(int)z;i+=k)
#define ford(i,j,z) for (int i=(int)j;i>=(int)z;i--)
#define ford2(i,j,z,k) for (int i=(int)j;i>=(int)z;i-=k)
#define sz(a) (int)a.size()
const ll inf=BIT(60);
const int N=100000;
int n,m,s;
struct Edge{
    int nex;ll cost;
    Edge(int v1,ll d1)
    {
        nex=v1,cost=d1;
    }
};
vector<Edge> a[N+1];
vector<ll> S,U,V,dpU,dpV;
vector<vector<int> > traceS;
ll ans;
bitset<N+1> vis;
void dijkstra(int S,vector<ll> &dp,bool TRACE)
{
    dp.assign(n+1,LLONG_MAX);
    dp[S]=0;
    priority_queue<pair<ll,int>,vector<pair<ll,int> >,greater<pair<ll,int> > > haha;
    haha.push(mp(0LL,S));
    while(!haha.empty())
    {
        pair<ll,int> temp = haha.top();
        haha.pop();
        int u=temp.s;
        if (temp.f>dp[u]) continue;
        forw(i,0,sz(a[u])-1)
        {
            int v=a[u][i].nex,d=a[u][i].cost;
            if (dp[u]+d<dp[v])
            {
                if (TRACE)
                {
                    traceS[v].clear();
                    traceS[v].pb(u);
                }
                dp[v]=dp[u]+d;
                haha.push(mp(dp[v],v));
            }
            else if (TRACE&&dp[u]+d==dp[v])
                traceS[v].pb(u);
        }
    }
}
void dfs(int u)
{
    vis[u]=1;
    if (u==s)
    {
        dpU[u]=U[s],dpV[u]=V[s];
        ans=min(ans,dpU[u]+dpV[u]);
        return ;
    }
    dpU[u]=U[u],dpV[u]=V[u];
    forw(i,0,sz(traceS[u])-1)
    {
        int v=traceS[u][i];
        if (!vis[v]) dfs(v);
        dpU[u]=min(dpU[u],dpU[v]);
        dpV[u]=min(dpV[u],dpV[v]);
    }
    ans=min(ans,min(dpU[u]+V[u],dpV[u]+U[u]));
}
void solve()
{
    int u,v,t;
    cin>>n>>m;
    cin>>s>>t>>u>>v;
    traceS.assign(n+1,vector<int>(0,0));
    dpU.assign(n+1,0);
    dpV.assign(n+1,0);
    while(m--)
    {
        int u,v;ll d;
        cin>>u>>v>>d;
        a[u].pb(Edge(v,d));
        a[v].pb(Edge(u,d));
    }
    dijkstra(s,S,1);
    dijkstra(u,U,0);
    dijkstra(v,V,0);
    ans=U[v];
    dfs(t);
    cout<<ans;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<setprecision(6)<<fixed;
    int t=1;
    while(t--)
        solve();
    return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 235 ms 28828 KB Output is correct
2 Correct 203 ms 27112 KB Output is correct
3 Correct 212 ms 29772 KB Output is correct
4 Correct 218 ms 28648 KB Output is correct
5 Correct 190 ms 26944 KB Output is correct
6 Correct 215 ms 29056 KB Output is correct
7 Correct 193 ms 27116 KB Output is correct
8 Correct 223 ms 27032 KB Output is correct
9 Correct 188 ms 28152 KB Output is correct
10 Correct 186 ms 27792 KB Output is correct
11 Correct 67 ms 21588 KB Output is correct
12 Correct 218 ms 27908 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 221 ms 27460 KB Output is correct
2 Correct 235 ms 27300 KB Output is correct
3 Correct 238 ms 27108 KB Output is correct
4 Correct 252 ms 27328 KB Output is correct
5 Correct 266 ms 27832 KB Output is correct
6 Correct 183 ms 29284 KB Output is correct
7 Correct 199 ms 29628 KB Output is correct
8 Correct 255 ms 27328 KB Output is correct
9 Correct 227 ms 27648 KB Output is correct
10 Correct 241 ms 27108 KB Output is correct
11 Correct 95 ms 23120 KB Output is correct
12 Correct 211 ms 29636 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4576 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 12 ms 6232 KB Output is correct
5 Correct 6 ms 4440 KB Output is correct
6 Correct 2 ms 2824 KB Output is correct
7 Correct 2 ms 2904 KB Output is correct
8 Correct 2 ms 2904 KB Output is correct
9 Correct 1 ms 2904 KB Output is correct
10 Correct 6 ms 4696 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 1 ms 2904 KB Output is correct
15 Correct 1 ms 2904 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 235 ms 28828 KB Output is correct
2 Correct 203 ms 27112 KB Output is correct
3 Correct 212 ms 29772 KB Output is correct
4 Correct 218 ms 28648 KB Output is correct
5 Correct 190 ms 26944 KB Output is correct
6 Correct 215 ms 29056 KB Output is correct
7 Correct 193 ms 27116 KB Output is correct
8 Correct 223 ms 27032 KB Output is correct
9 Correct 188 ms 28152 KB Output is correct
10 Correct 186 ms 27792 KB Output is correct
11 Correct 67 ms 21588 KB Output is correct
12 Correct 218 ms 27908 KB Output is correct
13 Correct 221 ms 27460 KB Output is correct
14 Correct 235 ms 27300 KB Output is correct
15 Correct 238 ms 27108 KB Output is correct
16 Correct 252 ms 27328 KB Output is correct
17 Correct 266 ms 27832 KB Output is correct
18 Correct 183 ms 29284 KB Output is correct
19 Correct 199 ms 29628 KB Output is correct
20 Correct 255 ms 27328 KB Output is correct
21 Correct 227 ms 27648 KB Output is correct
22 Correct 241 ms 27108 KB Output is correct
23 Correct 95 ms 23120 KB Output is correct
24 Correct 211 ms 29636 KB Output is correct
25 Correct 7 ms 4576 KB Output is correct
26 Correct 1 ms 2648 KB Output is correct
27 Correct 1 ms 2648 KB Output is correct
28 Correct 12 ms 6232 KB Output is correct
29 Correct 6 ms 4440 KB Output is correct
30 Correct 2 ms 2824 KB Output is correct
31 Correct 2 ms 2904 KB Output is correct
32 Correct 2 ms 2904 KB Output is correct
33 Correct 1 ms 2904 KB Output is correct
34 Correct 6 ms 4696 KB Output is correct
35 Correct 1 ms 2648 KB Output is correct
36 Correct 1 ms 2648 KB Output is correct
37 Correct 1 ms 2648 KB Output is correct
38 Correct 1 ms 2904 KB Output is correct
39 Correct 1 ms 2904 KB Output is correct
40 Correct 182 ms 28928 KB Output is correct
41 Correct 173 ms 27760 KB Output is correct
42 Correct 236 ms 27896 KB Output is correct
43 Correct 92 ms 22204 KB Output is correct
44 Correct 72 ms 22352 KB Output is correct
45 Correct 178 ms 26140 KB Output is correct
46 Correct 184 ms 26408 KB Output is correct
47 Correct 220 ms 28628 KB Output is correct
48 Correct 80 ms 19792 KB Output is correct
49 Correct 153 ms 28660 KB Output is correct
50 Correct 191 ms 26820 KB Output is correct
51 Correct 175 ms 26672 KB Output is correct