oj.uz

Submission #846596

# Submission time Handle Problem Language Result Execution time Memory
846596 2023-09-08T05:36:28 Z damwuan Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 240 ms 35024 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define bit(n,i) ((n>>i)&1)
#define all(x) x.begin(),x.end()
//#pragma GCC optimize("O2,unroll-loops")
//#pragma GCC target("avx,avx2,bmi,bmi2,sse,sse2,sse3,ssse3,sse4,popcnt")
#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef double ld;
typedef pair<ld,ld> pdd;
typedef pair<ll,ll> pll;
const ll maxn=2e5+5;
const ll offset=1e18;
const ll block_sz=317;
const ll inf=1e18;
const ll mod=1e9+7;
int n,u,v,s,t,m;
priority_queue<pii,vector<pii>,greater<pii>> pq;
vector<pii> adj1[maxn];
vector<int> adj[maxn];
vector<int> L;
int inu[maxn],inv[maxn],deg[maxn];
bool dd[maxn];
vector<int> disktra(int x)
{
    vector<int> dist(n+1,inf);
    dist[x]=0;
    pq.push({0,x});
    while (!pq.empty())
    {
        int u=pq.top().se;
        int _=pq.top().fi;
        pq.pop();
        if (dist[u]!=_) continue;
        for(auto [v,w]:adj1[u] )
        {
            if (dist[v]>dist[u]+w)
            {
                dist[v]=dist[u]+w;
                pq.push({dist[v],v});
            }
        }
    }
    return dist;

}
void sol()
{
    cin >> n>>m>>s>>t>>u>>v;
    for1(i,1,m)
    {
        int a,b,c;cin >>a>>b>>c;
        adj1[a].pb({b,c});
        adj1[b].pb({a,c});
    }
    vector<int> Lu=disktra(u);
    vector<int> Lv=disktra(v);
    vector<int> Ls=disktra(s);
    vector<int> Lt=disktra(t);
    for1(x,1,n)
    {
        if (Ls[x]+Lt[x]==Ls[t])
        {
//           cerr<< x<<'\n';
           dd[x]=true;
           inu[x]=Lu[x];
           inv[x]=Lv[x];
           for(auto [y,w]: adj1[x])
           {
               if (dd[y])
               {
                   if (Ls[y]+w==Ls[x])
                   {
                        deg[x]++;
                        adj[y].pb(x);
                   }
                   else if (Ls[y]==Ls[x]+w)
                   {
                       deg[y]++;
                       adj[x].pb(y);
                   }
               }
           }
        }
    }
//    for1(i,1,n)
//    {
//        if (dd[i])
//        {
//            if (!adj[i].empty())cerr<< i<< ' '<< adj[i][0]<<'\n';
//        }
//    }
    vector<int> qq;
    int ans=Lu[v];
    qq.pb(s);
    while(!qq.empty())
    {
        int x=qq.back();
        //cerr<< x<< '\n';
        qq.pop_back();
        ans=min(ans,min(inu[x]+Lv[x],inv[x]+Lu[x]));
        //cerr << ans<<'\n';
        for(int y:adj[x])
        {
            deg[y]--;
            inu[y]=min(inu[y],inu[x]);
            inv[y]=min(inv[y],inv[x]);
            if (deg[y]==0)
            {
                qq.pb(y);
            }
        }
    }
    cout << ans;

}


int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
//    freopen("GROUPDIV.inp","r",stdin);
//    freopen("GROUPDIV.out","w",stdout);

    int t=1;//cin >> t;
    while (t--)
    {
        sol();
    }
}
/*

3 1
12345678
?11
*/

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 33208 KB Output is correct
2 Correct 206 ms 32708 KB Output is correct
3 Correct 204 ms 34244 KB Output is correct
4 Correct 178 ms 32948 KB Output is correct
5 Correct 212 ms 33216 KB Output is correct
6 Correct 236 ms 32936 KB Output is correct
7 Correct 200 ms 33708 KB Output is correct
8 Correct 193 ms 33516 KB Output is correct
9 Correct 173 ms 33352 KB Output is correct
10 Correct 159 ms 33456 KB Output is correct
11 Correct 63 ms 25940 KB Output is correct
12 Correct 179 ms 33236 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 32968 KB Output is correct
2 Correct 188 ms 32716 KB Output is correct
3 Correct 240 ms 32744 KB Output is correct
4 Correct 207 ms 32528 KB Output is correct
5 Correct 191 ms 32976 KB Output is correct
6 Correct 183 ms 33992 KB Output is correct
7 Correct 240 ms 34012 KB Output is correct
8 Correct 191 ms 32672 KB Output is correct
9 Correct 212 ms 32804 KB Output is correct
10 Correct 216 ms 32616 KB Output is correct
11 Correct 91 ms 26764 KB Output is correct
12 Correct 192 ms 34052 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16220 KB Output is correct
2 Correct 3 ms 14428 KB Output is correct
3 Correct 4 ms 14684 KB Output is correct
4 Correct 13 ms 18084 KB Output is correct
5 Correct 8 ms 16220 KB Output is correct
6 Correct 4 ms 14684 KB Output is correct
7 Correct 4 ms 14684 KB Output is correct
8 Correct 4 ms 14772 KB Output is correct
9 Correct 4 ms 14684 KB Output is correct
10 Correct 8 ms 16156 KB Output is correct
11 Correct 3 ms 14428 KB Output is correct
12 Correct 4 ms 14564 KB Output is correct
13 Correct 3 ms 14428 KB Output is correct
14 Correct 5 ms 14428 KB Output is correct
15 Correct 3 ms 14428 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 33208 KB Output is correct
2 Correct 206 ms 32708 KB Output is correct
3 Correct 204 ms 34244 KB Output is correct
4 Correct 178 ms 32948 KB Output is correct
5 Correct 212 ms 33216 KB Output is correct
6 Correct 236 ms 32936 KB Output is correct
7 Correct 200 ms 33708 KB Output is correct
8 Correct 193 ms 33516 KB Output is correct
9 Correct 173 ms 33352 KB Output is correct
10 Correct 159 ms 33456 KB Output is correct
11 Correct 63 ms 25940 KB Output is correct
12 Correct 179 ms 33236 KB Output is correct
13 Correct 193 ms 32968 KB Output is correct
14 Correct 188 ms 32716 KB Output is correct
15 Correct 240 ms 32744 KB Output is correct
16 Correct 207 ms 32528 KB Output is correct
17 Correct 191 ms 32976 KB Output is correct
18 Correct 183 ms 33992 KB Output is correct
19 Correct 240 ms 34012 KB Output is correct
20 Correct 191 ms 32672 KB Output is correct
21 Correct 212 ms 32804 KB Output is correct
22 Correct 216 ms 32616 KB Output is correct
23 Correct 91 ms 26764 KB Output is correct
24 Correct 192 ms 34052 KB Output is correct
25 Correct 10 ms 16220 KB Output is correct
26 Correct 3 ms 14428 KB Output is correct
27 Correct 4 ms 14684 KB Output is correct
28 Correct 13 ms 18084 KB Output is correct
29 Correct 8 ms 16220 KB Output is correct
30 Correct 4 ms 14684 KB Output is correct
31 Correct 4 ms 14684 KB Output is correct
32 Correct 4 ms 14772 KB Output is correct
33 Correct 4 ms 14684 KB Output is correct
34 Correct 8 ms 16156 KB Output is correct
35 Correct 3 ms 14428 KB Output is correct
36 Correct 4 ms 14564 KB Output is correct
37 Correct 3 ms 14428 KB Output is correct
38 Correct 5 ms 14428 KB Output is correct
39 Correct 3 ms 14428 KB Output is correct
40 Correct 226 ms 33176 KB Output is correct
41 Correct 173 ms 33272 KB Output is correct
42 Correct 189 ms 33336 KB Output is correct
43 Correct 67 ms 27984 KB Output is correct
44 Correct 75 ms 27852 KB Output is correct
45 Correct 169 ms 35016 KB Output is correct
46 Correct 166 ms 34760 KB Output is correct
47 Correct 205 ms 33292 KB Output is correct
48 Correct 84 ms 27504 KB Output is correct
49 Correct 138 ms 32572 KB Output is correct
50 Correct 201 ms 34116 KB Output is correct
51 Correct 188 ms 35024 KB Output is correct