oj.uz

Submission #946810

# Submission time Handle Problem Language Result Execution time Memory
946810 2024-03-15T05:24:11 Z vjudge1 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 248 ms 30108 KB 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <fstream>
#include <unordered_map>
#define ll long long
#define int long long
#define all(v) v.begin(), v.end()
#define nl '\n'
#define pb push_back
#define sz(s) (int)(s).size()
#define f first
#define s second
using namespace std;
const ll N = 1e5 + 50, MX = 1e18;
bool was[N], grd[N], use[N], had[N];
ll du[N], dv[N], ds[N], dt[N];
vector <pair <int, int> > g[N], Q[N];
vector <int> top;
ll dp[N][2];
ll n;
ll s, t, u, v;
void dfs(ll curv){
    use[curv]=1;
    for(auto [x,w]:g[curv]){
        if(!use[x])dfs(x);
    }
    if(grd[curv])top.pb(curv);
}
void filv(){
    for (int i = 1; i <= n; i++) {
        was[i]=0;
        //dv[i]=MX;
    }
    dv[v]=0;
    priority_queue< pair<long long, int> > st;
    st.push({0, v});
    while(st.size() != 0) {
        int curv = st.top().second;
        st.pop();
        if(was[curv]) continue;
        was[curv] = 1;
        for(auto [to, w]: g[curv]) {
            if(dv[to] > dv[curv] + w) {
                //s.erase({d[to], to});
                dv[to] = dv[curv] + w;
                st.push({-dv[to], to});
            }
        }
    }
}
void filu(){
    for (int i = 1; i <= n; i++) {
        was[i]=0;
        //du[i]=MX;
    }
    du[u]=0;
    priority_queue< pair<long long, int> > st;
    st.push({0, u});
    while(st.size() != 0) {
        int curv = st.top().second;
        st.pop();
        if(was[curv]) continue;
        was[curv] = 1;
        for(auto [to, w]: g[curv]) {
            if(du[to] > du[curv] + w) {
                //s.erase({d[to], to});
                du[to] = du[curv] + w;
                st.push({-du[to], to});
            }
        }
    }
}
void fils(){
    for (int i = 1; i <= n; i++) {
        was[i]=0;
        //ds[i]=MX;
    }
    ds[s]=0;
    priority_queue< pair<long long, int> > st;
    st.push({0, s});
    while(st.size() != 0) {
        int curv = st.top().second;
        st.pop();
        if(was[curv]) continue;
        was[curv] = 1;
        for(auto [to, w]: g[curv]) {
            if(ds[to] > ds[curv] + w) {
                //s.erase({d[to], to});
                ds[to] = ds[curv] + w;
                st.push({-ds[to], to});
            }
        }
    }
}
void filt(){
    for (int i = 1; i <= n; i++) {
        was[i]=0;
        dp[i][0]=dp[i][1]=MX;
        //dt[i]=MX;
    }
    dt[t]=0;
    priority_queue< pair<long long, int> > st;
    st.push({0, t});
    while(st.size() != 0) {
        int curv = st.top().second;
        st.pop();
        if(was[curv]) continue;
        was[curv] = 1;
        for(auto [to, w]: g[curv]) {
            if(dt[to] > dt[curv] + w) {
                //s.erase({d[to], to});
                dt[to] = dt[curv] + w;
                st.push({-dt[to], to});
            }
        }
    }
}
void solve(){
    ll m;
    cin >> n >> m;
    cin >> s >> t >> u >> v;
    for(int i = 1; i <= m; i++){
        ll a, b, x;
        cin >> a >> b >> x;
        g[a].pb({b,x});
        g[b].pb({a, x});
    }
    for(int i = 1; i <= n; i++){
        dt[i] = ds[i] = du[i] = dv[i] = MX;
    }
    filt(), filu(), filv(), fils();
    for(int i = 1; i <= n; i++){
        if(ds[i] + dt[i] == ds[t]){
            grd[i]=1;
            //cout << i << nl;
        }
    }
    for(int i = 1; i <= n; i++){
        if(grd[i]) {
            for (auto [x,w]: g[i]) {
                if (dt[x] + w + ds[i] == ds[t]) {
                    Q[i].pb({x, w});
                }
            }
        }
    }
    for(int i = 1; i <= n; i++){
        g[i].clear();
    }
    for(int i = 1; i <= n; i++){
        for(auto [x, w]: Q[i]){
            g[i].pb({x, 0});
        }
    }
    for(int i = 1; i <= n; i++){
        for(auto [x, w]: g[i]){
            //cout << i << " " << x << " " << w << nl;
        }
    }
    for(int i = 1; i <= n; i++){
        if(!use[i] && grd[i])dfs(i);
    }
    for(auto x:top){
        dp[x][0] = du[x];
        dp[x][1] = dv[x];
        for (auto [to, w]: g[x]) {
            dp[x][0] = min(dp[x][0], dp[to][0]);
            dp[x][1] = min(dp[x][1], dp[to][1]);
        }
    }
    ll mn = du[v];
    for(auto x: top){
        mn = min(mn, dp[x][0] + dv[x]);
        mn = min(mn, dp[x][1] + du[x]);
    }
    cout << mn;
}
signed main(){
    //freopen("lca.in", "r", stdin);
    //freopen("lca.out", "w", stdout);
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll ql=1;
    //cin >> ql;
    //tst++;
    while(ql--){
        solve();
    }
}

Compilation message

commuter_pass.cpp: In function 'void solve()':
commuter_pass.cpp:181:18: warning: structured binding declaration set but not used [-Wunused-but-set-variable]
  181 |         for(auto [x, w]: g[i]){
      |                  ^~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 27324 KB Output is correct
2 Correct 194 ms 25820 KB Output is correct
3 Correct 219 ms 28580 KB Output is correct
4 Correct 194 ms 27172 KB Output is correct
5 Correct 201 ms 25960 KB Output is correct
6 Correct 222 ms 27356 KB Output is correct
7 Correct 202 ms 26284 KB Output is correct
8 Correct 248 ms 26012 KB Output is correct
9 Correct 220 ms 26484 KB Output is correct
10 Correct 154 ms 26440 KB Output is correct
11 Correct 67 ms 20664 KB Output is correct
12 Correct 187 ms 26368 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 25964 KB Output is correct
2 Correct 210 ms 25660 KB Output is correct
3 Correct 219 ms 25684 KB Output is correct
4 Correct 213 ms 25708 KB Output is correct
5 Correct 218 ms 25804 KB Output is correct
6 Correct 225 ms 27768 KB Output is correct
7 Correct 225 ms 29124 KB Output is correct
8 Correct 248 ms 25576 KB Output is correct
9 Correct 230 ms 26032 KB Output is correct
10 Correct 225 ms 25716 KB Output is correct
11 Correct 76 ms 21756 KB Output is correct
12 Correct 229 ms 28824 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10328 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 11 ms 12124 KB Output is correct
5 Correct 7 ms 10332 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 3 ms 8792 KB Output is correct
9 Correct 2 ms 8792 KB Output is correct
10 Correct 7 ms 10332 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 2 ms 8536 KB Output is correct
13 Correct 3 ms 8536 KB Output is correct
14 Correct 3 ms 8536 KB Output is correct
15 Correct 2 ms 8536 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 27324 KB Output is correct
2 Correct 194 ms 25820 KB Output is correct
3 Correct 219 ms 28580 KB Output is correct
4 Correct 194 ms 27172 KB Output is correct
5 Correct 201 ms 25960 KB Output is correct
6 Correct 222 ms 27356 KB Output is correct
7 Correct 202 ms 26284 KB Output is correct
8 Correct 248 ms 26012 KB Output is correct
9 Correct 220 ms 26484 KB Output is correct
10 Correct 154 ms 26440 KB Output is correct
11 Correct 67 ms 20664 KB Output is correct
12 Correct 187 ms 26368 KB Output is correct
13 Correct 235 ms 25964 KB Output is correct
14 Correct 210 ms 25660 KB Output is correct
15 Correct 219 ms 25684 KB Output is correct
16 Correct 213 ms 25708 KB Output is correct
17 Correct 218 ms 25804 KB Output is correct
18 Correct 225 ms 27768 KB Output is correct
19 Correct 225 ms 29124 KB Output is correct
20 Correct 248 ms 25576 KB Output is correct
21 Correct 230 ms 26032 KB Output is correct
22 Correct 225 ms 25716 KB Output is correct
23 Correct 76 ms 21756 KB Output is correct
24 Correct 229 ms 28824 KB Output is correct
25 Correct 7 ms 10328 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 11 ms 12124 KB Output is correct
29 Correct 7 ms 10332 KB Output is correct
30 Correct 2 ms 8796 KB Output is correct
31 Correct 2 ms 8796 KB Output is correct
32 Correct 3 ms 8792 KB Output is correct
33 Correct 2 ms 8792 KB Output is correct
34 Correct 7 ms 10332 KB Output is correct
35 Correct 1 ms 8540 KB Output is correct
36 Correct 2 ms 8536 KB Output is correct
37 Correct 3 ms 8536 KB Output is correct
38 Correct 3 ms 8536 KB Output is correct
39 Correct 2 ms 8536 KB Output is correct
40 Correct 174 ms 27196 KB Output is correct
41 Correct 183 ms 26216 KB Output is correct
42 Correct 198 ms 26400 KB Output is correct
43 Correct 80 ms 23336 KB Output is correct
44 Correct 82 ms 23824 KB Output is correct
45 Correct 192 ms 30080 KB Output is correct
46 Correct 189 ms 29692 KB Output is correct
47 Correct 200 ms 27040 KB Output is correct
48 Correct 86 ms 21712 KB Output is correct
49 Correct 162 ms 26848 KB Output is correct
50 Correct 239 ms 28888 KB Output is correct
51 Correct 202 ms 30108 KB Output is correct