oj.uz

Submission #502691

# Submission time Handle Problem Language Result Execution time Memory
502691 2022-01-06T12:55:00 Z XII Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 350 ms 18728 KB 
/// https://oj.uz/problem/view/JOI18_commuter_pass
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define ALL(x) (x).begin(), (x).end()

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORU(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)

#define IOS cin.tie(0)->sync_with_stdio(false);
#define PROB "JOI18_commuter_pass"
void Fi(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp", "r", stdin);
        freopen(PROB".out", "w", stdout);
    }
}

const ll INF = 1e18;
const int N = 1e5 + 1;
bool vis[N];
int n, m;
int S, T, U, V;
using pi = pair<int, int>;
vector<pi> adj[N];

ll du[N], dv[N], ds[N];
ll dp[2][N], ans;

using pli = pair<ll, int>;
priority_queue<pli, vector<pli>, greater<pli>> pq;

void dijkstra1(const int &s, ll d[]){
    fill(d + 1, d + n + 1, INF);
    fill(vis + 1, vis + n + 1, false);
    pq.emplace(0, s); d[s] = 0;
    while(!pq.empty()){
        auto [wu, u] = pq.top(); pq.pop();
        if(wu != d[u] || vis[u]) continue;
        vis[u] = true;
        for(auto [wv, v]: adj[u]) if(!vis[v]){
            if(d[v] > wu + wv){
                d[v] = wu + wv;
                pq.emplace(d[v], v);
            }
        }
    }
}

void dijkstra2(const int &s, const int &t, ll d[]){
    fill(d + 1, d + n + 1, INF);
    fill(dp[0] + 1, dp[0] + n + 1, INF);
    fill(dp[1] + 1, dp[1] + n + 1, INF);
    fill(vis + 1, vis + n + 1, false);

    pq.emplace(0, s);
    d[s] = 0;
    dp[0][s] = du[s];
    dp[1][s] = dv[s];

    while(!pq.empty()){
        auto [wu, u] = pq.top(); pq.pop();
        if(wu != d[u] || vis[u]) continue;
        vis[u] = true;
        for(auto [wv, v]: adj[u]) if(!vis[v]){
            if(d[v] > wu + wv){
                dp[0][v] = min(du[v], dp[0][u]);
                dp[1][v] = min(dv[v], dp[1][u]);
                d[v] = wu + wv;
                pq.emplace(d[v], v);
            } else if(d[v] == wu + wv){
                if(min(du[v], dp[0][u]) + min(dv[v], dp[1][u]) < dp[0][v] + dp[1][v]){
                    dp[0][v] = min(du[v], dp[0][u]);
                    dp[1][v] = min(dv[v], dp[1][u]);
                }
            }
        }
    }
    ans = min(ans, dp[0][t] + dp[1][t]);
}

int main(){
    IOS;
    Fi();
    cin >> n >> m >> S >> T >> U >> V;
    FORU(i, 1, m){
        int u, v, w; cin >> u >> v >> w;
        adj[u].eb(w, v);
        adj[v].eb(w, u);
    }
    dijkstra1(U, du);
    dijkstra1(V, dv);
    ans = du[V];
    dijkstra2(S, T, ds);
    dijkstra2(T, S, ds);
    cout << ans;
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'void Fi()':
commuter_pass.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen(PROB".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:22:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         freopen(PROB".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 17896 KB Output is correct
2 Correct 268 ms 17460 KB Output is correct
3 Correct 276 ms 18728 KB Output is correct
4 Correct 321 ms 17976 KB Output is correct
5 Correct 263 ms 17216 KB Output is correct
6 Correct 285 ms 18072 KB Output is correct
7 Correct 312 ms 17372 KB Output is correct
8 Correct 294 ms 17452 KB Output is correct
9 Correct 288 ms 18112 KB Output is correct
10 Correct 258 ms 18208 KB Output is correct
11 Correct 111 ms 11768 KB Output is correct
12 Correct 276 ms 18056 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 17672 KB Output is correct
2 Correct 350 ms 17416 KB Output is correct
3 Correct 297 ms 17332 KB Output is correct
4 Correct 301 ms 17472 KB Output is correct
5 Correct 281 ms 17372 KB Output is correct
6 Correct 271 ms 17820 KB Output is correct
7 Correct 325 ms 17332 KB Output is correct
8 Correct 280 ms 17460 KB Output is correct
9 Correct 314 ms 17344 KB Output is correct
10 Correct 265 ms 17376 KB Output is correct
11 Correct 100 ms 11868 KB Output is correct
12 Correct 325 ms 17748 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3708 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 14 ms 4760 KB Output is correct
5 Correct 8 ms 3788 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 3 ms 2764 KB Output is correct
8 Correct 4 ms 2764 KB Output is correct
9 Correct 2 ms 2764 KB Output is correct
10 Correct 8 ms 3740 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2684 KB Output is correct
14 Correct 2 ms 2764 KB Output is correct
15 Correct 2 ms 2692 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 17896 KB Output is correct
2 Correct 268 ms 17460 KB Output is correct
3 Correct 276 ms 18728 KB Output is correct
4 Correct 321 ms 17976 KB Output is correct
5 Correct 263 ms 17216 KB Output is correct
6 Correct 285 ms 18072 KB Output is correct
7 Correct 312 ms 17372 KB Output is correct
8 Correct 294 ms 17452 KB Output is correct
9 Correct 288 ms 18112 KB Output is correct
10 Correct 258 ms 18208 KB Output is correct
11 Correct 111 ms 11768 KB Output is correct
12 Correct 276 ms 18056 KB Output is correct
13 Correct 289 ms 17672 KB Output is correct
14 Correct 350 ms 17416 KB Output is correct
15 Correct 297 ms 17332 KB Output is correct
16 Correct 301 ms 17472 KB Output is correct
17 Correct 281 ms 17372 KB Output is correct
18 Correct 271 ms 17820 KB Output is correct
19 Correct 325 ms 17332 KB Output is correct
20 Correct 280 ms 17460 KB Output is correct
21 Correct 314 ms 17344 KB Output is correct
22 Correct 265 ms 17376 KB Output is correct
23 Correct 100 ms 11868 KB Output is correct
24 Correct 325 ms 17748 KB Output is correct
25 Correct 8 ms 3708 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 14 ms 4760 KB Output is correct
29 Correct 8 ms 3788 KB Output is correct
30 Correct 2 ms 2764 KB Output is correct
31 Correct 3 ms 2764 KB Output is correct
32 Correct 4 ms 2764 KB Output is correct
33 Correct 2 ms 2764 KB Output is correct
34 Correct 8 ms 3740 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 2 ms 2684 KB Output is correct
38 Correct 2 ms 2764 KB Output is correct
39 Correct 2 ms 2692 KB Output is correct
40 Correct 239 ms 18352 KB Output is correct
41 Correct 261 ms 18036 KB Output is correct
42 Correct 278 ms 18116 KB Output is correct
43 Correct 97 ms 11876 KB Output is correct
44 Correct 102 ms 11904 KB Output is correct
45 Correct 247 ms 16956 KB Output is correct
46 Correct 248 ms 16740 KB Output is correct
47 Correct 309 ms 17768 KB Output is correct
48 Correct 136 ms 11280 KB Output is correct
49 Correct 272 ms 17876 KB Output is correct
50 Correct 245 ms 17072 KB Output is correct
51 Correct 239 ms 16932 KB Output is correct