oj.uz

Submission #680695

# Submission time Handle Problem Language Result Execution time Memory
680695 2023-01-11T14:19:59 Z kakayoshi Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 506 ms 37008 KB 
#include <bits/stdc++.h>
using namespace std;

#define forw(i,a,b) for(ll i=a;i<=b;i++)
#define forb(i,a,b) for(ll i=a;i>=b;i--)
#define pu push
#define pb push_back
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define minimize(a,b) a=min(a,b)
#define maximize(a,b) a=max(a,b)
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,pair<ll,ll> > plll;
const int maxN=2e5+5;
const ll oo=1e18;
ll n,m,U,V,s,t,d[maxN][4],dp[maxN][2],father[maxN];
vector <pll> edge[maxN];
vector <ll> new_edge[maxN];
vector <plll> pend;
void dijk(int s, int id)
{
    forw(i,1,n) d[i][id]=oo;
    d[s][id]=0;
    priority_queue<pll, vector <pll> , greater<pll> > p;
    p.pu({0,s});
    while (p.size())
    {
        ll u=p.top().se;
        ll val=p.top().fi;
        p.pop();
        if (val>d[u][id]) continue;
        for(auto tmp:edge[u])
        {
            ll v=tmp.se;
            ll add=tmp.fi;
            if (val+add<d[v][id])
            {
                d[v][id]=val+add;
                p.pu({d[v][id],v});
            }
        }
    }
    return;
}
void solve()
{
    cin>>n>>m;
    cin>>s>>t>>U>>V;
    forw(i,1,m)
    {
        ll u,v,z; cin>>u>>v>>z;
        edge[u].pb({z,v});
        edge[v].pb({z,u});
        pend.pb({z,{u,v}});
    }
    dijk(s,0);
    dijk(t,1);
    dijk(U,2);
    dijk(V,3);
    for(auto tmp:pend)
    {
        ll val=tmp.fi; ll u=tmp.se.fi; ll v=tmp.se.se;
        if (d[u][0]+val+d[v][1]==d[t][0])
        {
            father[v]++;
            new_edge[u].pb(v);
        }
        if (d[v][0]+val+d[u][1]==d[t][0])
        {
            father[u]++;
            new_edge[v].pb(u);
        }
    }
    ll ans=d[V][2];
    forw(i,1,n)
    {
        dp[i][0]=d[i][2]; // from U
        dp[i][1]=d[i][3]; // from V
    }
    queue<ll> p;
    p.pu(s);
    while (p.size())
    {
        ll u=p.front(); p.pop();
        ans=min(ans,dp[u][0]+d[u][3]); // to V
        ans=min(ans,dp[u][1]+d[u][2]); // to U
        for(int v:new_edge[u])
        {
            dp[v][0]=min(dp[v][0],dp[u][0]);
            dp[v][1]=min(dp[v][1],dp[u][1]);
            if (--father[v]==0) p.pu(v);
        }
    }
    cout<<ans;
    return;
}
int main()
{
    ios::sync_with_stdio();
    cin.tie(0);
    //freopen("bruh.inp","r",stdin);
    //freopen("bruh.out","w",stdout);
    solve();
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 427 ms 36528 KB Output is correct
2 Correct 436 ms 35732 KB Output is correct
3 Correct 439 ms 37008 KB Output is correct
4 Correct 441 ms 36440 KB Output is correct
5 Correct 432 ms 35532 KB Output is correct
6 Correct 410 ms 36544 KB Output is correct
7 Correct 467 ms 35584 KB Output is correct
8 Correct 426 ms 35656 KB Output is correct
9 Correct 407 ms 35660 KB Output is correct
10 Correct 380 ms 35564 KB Output is correct
11 Correct 193 ms 25724 KB Output is correct
12 Correct 454 ms 35604 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 35976 KB Output is correct
2 Correct 426 ms 35660 KB Output is correct
3 Correct 442 ms 35640 KB Output is correct
4 Correct 447 ms 35636 KB Output is correct
5 Correct 440 ms 35600 KB Output is correct
6 Correct 426 ms 35932 KB Output is correct
7 Correct 477 ms 35476 KB Output is correct
8 Correct 463 ms 35620 KB Output is correct
9 Correct 451 ms 35660 KB Output is correct
10 Correct 438 ms 35628 KB Output is correct
11 Correct 196 ms 26468 KB Output is correct
12 Correct 506 ms 36092 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 12060 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 39 ms 14256 KB Output is correct
5 Correct 22 ms 12076 KB Output is correct
6 Correct 7 ms 9844 KB Output is correct
7 Correct 7 ms 9940 KB Output is correct
8 Correct 9 ms 10068 KB Output is correct
9 Correct 6 ms 9848 KB Output is correct
10 Correct 24 ms 11940 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 7 ms 9708 KB Output is correct
14 Correct 7 ms 9812 KB Output is correct
15 Correct 7 ms 9792 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 427 ms 36528 KB Output is correct
2 Correct 436 ms 35732 KB Output is correct
3 Correct 439 ms 37008 KB Output is correct
4 Correct 441 ms 36440 KB Output is correct
5 Correct 432 ms 35532 KB Output is correct
6 Correct 410 ms 36544 KB Output is correct
7 Correct 467 ms 35584 KB Output is correct
8 Correct 426 ms 35656 KB Output is correct
9 Correct 407 ms 35660 KB Output is correct
10 Correct 380 ms 35564 KB Output is correct
11 Correct 193 ms 25724 KB Output is correct
12 Correct 454 ms 35604 KB Output is correct
13 Correct 458 ms 35976 KB Output is correct
14 Correct 426 ms 35660 KB Output is correct
15 Correct 442 ms 35640 KB Output is correct
16 Correct 447 ms 35636 KB Output is correct
17 Correct 440 ms 35600 KB Output is correct
18 Correct 426 ms 35932 KB Output is correct
19 Correct 477 ms 35476 KB Output is correct
20 Correct 463 ms 35620 KB Output is correct
21 Correct 451 ms 35660 KB Output is correct
22 Correct 438 ms 35628 KB Output is correct
23 Correct 196 ms 26468 KB Output is correct
24 Correct 506 ms 36092 KB Output is correct
25 Correct 22 ms 12060 KB Output is correct
26 Correct 6 ms 9684 KB Output is correct
27 Correct 5 ms 9684 KB Output is correct
28 Correct 39 ms 14256 KB Output is correct
29 Correct 22 ms 12076 KB Output is correct
30 Correct 7 ms 9844 KB Output is correct
31 Correct 7 ms 9940 KB Output is correct
32 Correct 9 ms 10068 KB Output is correct
33 Correct 6 ms 9848 KB Output is correct
34 Correct 24 ms 11940 KB Output is correct
35 Correct 6 ms 9684 KB Output is correct
36 Correct 6 ms 9684 KB Output is correct
37 Correct 7 ms 9708 KB Output is correct
38 Correct 7 ms 9812 KB Output is correct
39 Correct 7 ms 9792 KB Output is correct
40 Correct 383 ms 36376 KB Output is correct
41 Correct 427 ms 35548 KB Output is correct
42 Correct 460 ms 35636 KB Output is correct
43 Correct 197 ms 27596 KB Output is correct
44 Correct 216 ms 27732 KB Output is correct
45 Correct 414 ms 36588 KB Output is correct
46 Correct 397 ms 36364 KB Output is correct
47 Correct 397 ms 36700 KB Output is correct
48 Correct 234 ms 27080 KB Output is correct
49 Correct 365 ms 36008 KB Output is correct
50 Correct 411 ms 35724 KB Output is correct
51 Correct 472 ms 36692 KB Output is correct