oj.uz

Submission #870589

# Submission time Handle Problem Language Result Execution time Memory
870589 2023-11-08T12:38:58 Z atom Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 228 ms 26752 KB 
#include "bits/stdc++.h"
// @JASPER'S BOILERPLATE
using namespace std;
using ll = long long;

#define fi first
#define se second
#ifdef JASPER
#include "debug.h"
#else
#define debug(...) 166
#endif

using pii = pair < int, int >;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;

int n, m;
int s[4];
vector <pair <int, int>> adj[N];
ll dis[N][4];

void dijkstra(int x) {
    for (int i = 1; i <= n; ++i) dis[i][x] = INF;
    using T = pair<ll, int>;
    priority_queue <T, vector <T>, greater <T>> q;
    dis[s[x]][x] = 0;
    q.push({0, s[x]});
    // debug(s[x]);
    while (!q.empty()) {
        auto [du, u] = q.top(); q.pop();
        if (du != dis[u][x]) continue;
        // debug(du, u);
        for (auto [w, v] : adj[u]) {
            if (dis[v][x] > dis[u][x] + w) {
                dis[v][x] = dis[u][x] + w;
                q.push({dis[v][x], v});
            }
        }
    }
}	

vector <int> dag[N];
ll dpU[N], dpV[N];
ll ans;
bool vis[N];
// dpU represents min dis(u, i) on path (s, i)
// dpV represents min dis(v, i) on path (s, i)
// ans = min(dpU() + dis(v, y), dpV() + dis(u, y))
void dfs(int x, int p) {
    debug(x);
    if (vis[x]) return;
    vis[x] = 1;
    for (int y : dag[x]) {
        if (y != p) {
            dfs(y, x);
            dpU[x] = min({dpU[x], dpU[y], dis[y][2]});
            dpV[x] = min({dpV[x], dpV[y], dis[y][3]});
        }
    }
    ans = min(ans, dpU[x] + dis[x][3]);
    ans = min(ans, dpV[x] + dis[x][2]);
}

void run_case() {
    cin >> n >> m;
    for (int i = 0; i <= 3; ++i) cin >> s[i];
    for (int i = 1; i <= m; ++i) {
    	int u, v, w;
    	cin >> u >> v >> w;
    	adj[u].push_back({w, v});
    	adj[v].push_back({w, u});
    }

   	for (int i = 0; i <= 3; ++i)
        dijkstra(i);
    
    // 
    for (int x = 1; x <= n; ++x) {
        for (auto [w, y] : adj[x]) {
            if (dis[x][0] + w + dis[y][1] == dis[s[1]][0]) {
                dag[x].push_back(y);
            }
        }
    }
    // // taking route directly from u->v
    ans = dis[s[2]][3];
    debug(ans);
    fill(dpU, dpU + n + 5, INF);
    fill(dpV, dpV + n + 5, INF); 
    dfs(s[0], 0);
    cout << ans << "\n";
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    #ifdef JASPER
        freopen("in1", "r", stdin);
    #endif

    int Test = 1;
    //cin >> Test;
    for (int test = 1; test <= Test; test++){

        run_case();
    }
}

Compilation message

commuter_pass.cpp: In function 'void dfs(int, int)':
commuter_pass.cpp:11:20: warning: statement has no effect [-Wunused-value]
   11 | #define debug(...) 166
      |                    ^~~
commuter_pass.cpp:52:5: note: in expansion of macro 'debug'
   52 |     debug(x);
      |     ^~~~~
commuter_pass.cpp: In function 'void run_case()':
commuter_pass.cpp:11:20: warning: statement has no effect [-Wunused-value]
   11 | #define debug(...) 166
      |                    ^~~
commuter_pass.cpp:89:5: note: in expansion of macro 'debug'
   89 |     debug(ans);
      |     ^~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 19164 KB Output is correct
2 Correct 200 ms 17944 KB Output is correct
3 Correct 199 ms 26752 KB Output is correct
4 Correct 158 ms 22716 KB Output is correct
5 Correct 180 ms 21144 KB Output is correct
6 Correct 189 ms 23052 KB Output is correct
7 Correct 175 ms 21252 KB Output is correct
8 Correct 168 ms 21276 KB Output is correct
9 Correct 215 ms 22092 KB Output is correct
10 Correct 136 ms 22088 KB Output is correct
11 Correct 58 ms 19536 KB Output is correct
12 Correct 169 ms 22004 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 18844 KB Output is correct
2 Correct 204 ms 19164 KB Output is correct
3 Correct 191 ms 18392 KB Output is correct
4 Correct 200 ms 19020 KB Output is correct
5 Correct 211 ms 19532 KB Output is correct
6 Correct 180 ms 22168 KB Output is correct
7 Correct 228 ms 22788 KB Output is correct
8 Correct 203 ms 18892 KB Output is correct
9 Correct 188 ms 19584 KB Output is correct
10 Correct 201 ms 18648 KB Output is correct
11 Correct 66 ms 19792 KB Output is correct
12 Correct 210 ms 22592 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8284 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 11 ms 9808 KB Output is correct
5 Correct 7 ms 8760 KB Output is correct
6 Correct 2 ms 7772 KB Output is correct
7 Correct 2 ms 7772 KB Output is correct
8 Correct 3 ms 7772 KB Output is correct
9 Correct 2 ms 7732 KB Output is correct
10 Correct 8 ms 8664 KB Output is correct
11 Correct 2 ms 7732 KB Output is correct
12 Correct 2 ms 7724 KB Output is correct
13 Correct 3 ms 7516 KB Output is correct
14 Correct 2 ms 7772 KB Output is correct
15 Correct 2 ms 7768 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 19164 KB Output is correct
2 Correct 200 ms 17944 KB Output is correct
3 Correct 199 ms 26752 KB Output is correct
4 Correct 158 ms 22716 KB Output is correct
5 Correct 180 ms 21144 KB Output is correct
6 Correct 189 ms 23052 KB Output is correct
7 Correct 175 ms 21252 KB Output is correct
8 Correct 168 ms 21276 KB Output is correct
9 Correct 215 ms 22092 KB Output is correct
10 Correct 136 ms 22088 KB Output is correct
11 Correct 58 ms 19536 KB Output is correct
12 Correct 169 ms 22004 KB Output is correct
13 Correct 188 ms 18844 KB Output is correct
14 Correct 204 ms 19164 KB Output is correct
15 Correct 191 ms 18392 KB Output is correct
16 Correct 200 ms 19020 KB Output is correct
17 Correct 211 ms 19532 KB Output is correct
18 Correct 180 ms 22168 KB Output is correct
19 Correct 228 ms 22788 KB Output is correct
20 Correct 203 ms 18892 KB Output is correct
21 Correct 188 ms 19584 KB Output is correct
22 Correct 201 ms 18648 KB Output is correct
23 Correct 66 ms 19792 KB Output is correct
24 Correct 210 ms 22592 KB Output is correct
25 Correct 6 ms 8284 KB Output is correct
26 Correct 2 ms 7772 KB Output is correct
27 Correct 2 ms 7516 KB Output is correct
28 Correct 11 ms 9808 KB Output is correct
29 Correct 7 ms 8760 KB Output is correct
30 Correct 2 ms 7772 KB Output is correct
31 Correct 2 ms 7772 KB Output is correct
32 Correct 3 ms 7772 KB Output is correct
33 Correct 2 ms 7732 KB Output is correct
34 Correct 8 ms 8664 KB Output is correct
35 Correct 2 ms 7732 KB Output is correct
36 Correct 2 ms 7724 KB Output is correct
37 Correct 3 ms 7516 KB Output is correct
38 Correct 2 ms 7772 KB Output is correct
39 Correct 2 ms 7768 KB Output is correct
40 Correct 186 ms 23400 KB Output is correct
41 Correct 218 ms 22052 KB Output is correct
42 Correct 162 ms 22128 KB Output is correct
43 Correct 68 ms 22000 KB Output is correct
44 Correct 68 ms 22048 KB Output is correct
45 Correct 156 ms 22324 KB Output is correct
46 Correct 153 ms 22028 KB Output is correct
47 Correct 174 ms 22724 KB Output is correct
48 Correct 69 ms 19180 KB Output is correct
49 Correct 156 ms 23012 KB Output is correct
50 Correct 154 ms 21464 KB Output is correct
51 Correct 196 ms 22292 KB Output is correct