oj.uz

Submission #553382

# Submission time Handle Problem Language Result Execution time Memory
553382 2022-04-25T16:34:31 Z Danilo21 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 447 ms 45024 KB 
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define en '\n'
#define sp ' '
#define tb '\t'
#define ri(n) int n; cin >> n
#define rl(n) ll n; cin >> n
#define rs(s) string s; cin >> s
#define rc(c) char c; cin >> c
#define rv(v) for (auto &x : v) cin >> x
#define pven(v) for (auto x : v) cout << x << en
#define pv(v) for (auto x : v) cout << x << sp; cout << en
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yes cout << "YES" << en
#define no cout << "NO" << en
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
#define ssort(a, b) if (a < b) swap(a, b)
#define bitcnt(a) __builtin_popcountll(a)
#define bithigh(a) 63-__builtin_clzll(a)
#define lg bithigh
ll highpow(ll a) { return 1LL << (ll)lg(a); }

using namespace std;

const ll LINF = 4e18;
const int mxN = 2e5+10, INF = 2e9, mod = (1 ? 1e9+7 : 998244353);
ll n, m, S, T, U, V, dp[mxN], dist[3][mxN], indeg[mxN];
vector<array<ll, 2> > g[mxN];
vector<int> b[mxN], dag[mxN], topo;

void Dijkstra(int S, ll* dist){

    priority_queue<array<ll, 2>,
            vector<array<ll, 2> >,
            greater<array<ll, 2> > > pq;
    for (int i = 0; i < n; i++) dist[i] = LINF;
    dist[S] = 0;
    pq.push({0, S});
    while (pq.size()){
        auto [d, s] = pq.top(); pq.pop();
        if (d > dist[s]) continue;
        for (auto [u, w] : g[s]){
            if (d + w < dist[u]){
                dist[u] = d + w;
                pq.push({d+w, u});
            }
        }
    }
}

void dfs(int s){

    indeg[s] = 0;
    for (int u : b[s]){
        dag[u].pb(s);
        indeg[s]++;
        if (!~indeg[u]) dfs(u);
    }
}

ll DP(){

    for (int s = 0; s < n; s++) dp[s] = LINF;
    ll ans = LINF;
    for (int s : topo){
        dp[s] = dist[0][s];
        for (int u : dag[s]) smin(dp[s], dp[u]);
        smin(ans, dp[s] + dist[1][s]);
    }
    return ans;
}

void Solve(){

    cin >> n >> m >> S >> T >> U >> V;
    S--; T--; U--; V--;
    for (int i = 0; i < m; i++){
        ri(u); ri(v); rl(w);
        u--; v--;
        g[u].pb({v, w});
        g[v].pb({u, w});
    }
    Dijkstra(U, dist[0]);
    Dijkstra(V, dist[1]);
    Dijkstra(S, dist[2]);
    for (int s = 0; s < n; s++)
        for (auto [u, w] : g[s])
            if (dist[2][s] + w == dist[2][u])
                b[u].pb(s);
    memset(indeg, -1, sizeof(indeg));
    dfs(T);
    queue<int> q;
    for (int s = 0; s < n; s++)
        if (!indeg[s])
            q.push(s);
    while (q.size()){
        int s = q.front(); q.pop();
        topo.pb(s);
        for (int u : dag[s]){
            indeg[u]--;
            if (!indeg[u]) q.push(u);
        }
    }
    reverse(all(topo));
    ll ans = dist[0][V];
    smin(ans, DP());
    swap(dist[0], dist[1]);
    smin(ans, DP());
    cout << ans << en;
}

int main(){

    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0); cerr.tie(0);
    cout << setprecision(12) << fixed;
    cerr << setprecision(12) << fixed;
    cerr << "Started!" << endl;

    int t = 1;
    //cin >> t;
    while (t--)
        Solve();

    return 0;
}

Compilation message

commuter_pass.cpp: In function 'long long int highpow(long long int)':
commuter_pass.cpp:26:22: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   26 | #define bithigh(a) 63-__builtin_clzll(a)
      |                      ^
commuter_pass.cpp:27:12: note: in expansion of macro 'bithigh'
   27 | #define lg bithigh
      |            ^~~~~~~
commuter_pass.cpp:28:38: note: in expansion of macro 'lg'
   28 | ll highpow(ll a) { return 1LL << (ll)lg(a); }
      |                                      ^~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 33592 KB Output is correct
2 Correct 316 ms 34680 KB Output is correct
3 Correct 333 ms 41512 KB Output is correct
4 Correct 326 ms 37232 KB Output is correct
5 Correct 306 ms 39212 KB Output is correct
6 Correct 338 ms 37260 KB Output is correct
7 Correct 316 ms 39512 KB Output is correct
8 Correct 328 ms 39292 KB Output is correct
9 Correct 311 ms 37832 KB Output is correct
10 Correct 271 ms 38004 KB Output is correct
11 Correct 124 ms 35628 KB Output is correct
12 Correct 306 ms 37772 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 36860 KB Output is correct
2 Correct 340 ms 37272 KB Output is correct
3 Correct 336 ms 36636 KB Output is correct
4 Correct 344 ms 37092 KB Output is correct
5 Correct 370 ms 38036 KB Output is correct
6 Correct 324 ms 40580 KB Output is correct
7 Correct 359 ms 45024 KB Output is correct
8 Correct 324 ms 40608 KB Output is correct
9 Correct 373 ms 41428 KB Output is correct
10 Correct 363 ms 40164 KB Output is correct
11 Correct 194 ms 38040 KB Output is correct
12 Correct 385 ms 44700 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 20436 KB Output is correct
2 Correct 11 ms 19156 KB Output is correct
3 Correct 14 ms 19092 KB Output is correct
4 Correct 34 ms 22576 KB Output is correct
5 Correct 28 ms 20764 KB Output is correct
6 Correct 11 ms 19156 KB Output is correct
7 Correct 12 ms 19296 KB Output is correct
8 Correct 14 ms 19284 KB Output is correct
9 Correct 11 ms 19168 KB Output is correct
10 Correct 18 ms 20880 KB Output is correct
11 Correct 11 ms 19156 KB Output is correct
12 Correct 10 ms 19156 KB Output is correct
13 Correct 14 ms 19156 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 12 ms 19108 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 33592 KB Output is correct
2 Correct 316 ms 34680 KB Output is correct
3 Correct 333 ms 41512 KB Output is correct
4 Correct 326 ms 37232 KB Output is correct
5 Correct 306 ms 39212 KB Output is correct
6 Correct 338 ms 37260 KB Output is correct
7 Correct 316 ms 39512 KB Output is correct
8 Correct 328 ms 39292 KB Output is correct
9 Correct 311 ms 37832 KB Output is correct
10 Correct 271 ms 38004 KB Output is correct
11 Correct 124 ms 35628 KB Output is correct
12 Correct 306 ms 37772 KB Output is correct
13 Correct 335 ms 36860 KB Output is correct
14 Correct 340 ms 37272 KB Output is correct
15 Correct 336 ms 36636 KB Output is correct
16 Correct 344 ms 37092 KB Output is correct
17 Correct 370 ms 38036 KB Output is correct
18 Correct 324 ms 40580 KB Output is correct
19 Correct 359 ms 45024 KB Output is correct
20 Correct 324 ms 40608 KB Output is correct
21 Correct 373 ms 41428 KB Output is correct
22 Correct 363 ms 40164 KB Output is correct
23 Correct 194 ms 38040 KB Output is correct
24 Correct 385 ms 44700 KB Output is correct
25 Correct 18 ms 20436 KB Output is correct
26 Correct 11 ms 19156 KB Output is correct
27 Correct 14 ms 19092 KB Output is correct
28 Correct 34 ms 22576 KB Output is correct
29 Correct 28 ms 20764 KB Output is correct
30 Correct 11 ms 19156 KB Output is correct
31 Correct 12 ms 19296 KB Output is correct
32 Correct 14 ms 19284 KB Output is correct
33 Correct 11 ms 19168 KB Output is correct
34 Correct 18 ms 20880 KB Output is correct
35 Correct 11 ms 19156 KB Output is correct
36 Correct 10 ms 19156 KB Output is correct
37 Correct 14 ms 19156 KB Output is correct
38 Correct 11 ms 19156 KB Output is correct
39 Correct 12 ms 19108 KB Output is correct
40 Correct 347 ms 36984 KB Output is correct
41 Correct 314 ms 37660 KB Output is correct
42 Correct 336 ms 37856 KB Output is correct
43 Correct 229 ms 38324 KB Output is correct
44 Correct 193 ms 38300 KB Output is correct
45 Correct 439 ms 41124 KB Output is correct
46 Correct 447 ms 40872 KB Output is correct
47 Correct 295 ms 37228 KB Output is correct
48 Correct 170 ms 35352 KB Output is correct
49 Correct 291 ms 36720 KB Output is correct
50 Correct 301 ms 40288 KB Output is correct
51 Correct 410 ms 41112 KB Output is correct