oj.uz

답안 #922113

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922113 2024-02-05T05:41:13 Z 406 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 294 ms 29344 KB 
#include <bits/stdc++.h>
#define int int64_t
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)

using namespace std;
using ar = array<int, 2>;

const int64_t INF = 1ll << 60;
const int N = 2e5 + 5;

int n, m, S, T, U, V, d[4][N], mnd, X[N], tmp[2][N];
vector<ar> adj[N];

void dij(int x, int d[]) {
        fill(d, d + N, INF);
        priority_queue<ar> q;
        q.push({d[x] = 0, x});
        while (q.size()) {
                auto [di, v] = q.top();
                q.pop();
                if (-di > d[v]) continue;
                for (auto [u, w]: adj[v]) {
                        w += d[v];
                        if (w < d[u]) {
                                d[u] = w;
                                q.push({-d[u], u});
                        }
                }
        }
}

signed main() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr); 
        cin >> n >> m >> S >> T >> U >> V;
        --S, --T, --U, --V;
        FOR(i, 0, m) {
                int u, v, w;
                cin >> u >> v >> w;
                --u, --v;
                adj[v].push_back({u, w});
                adj[u].push_back({v, w});
        }
        dij(T, d[0]);
        dij(S, d[1]);
        dij(U, d[2]);
        dij(V, d[3]);

        FOR(v, 0, n) for (auto &[u, w]: adj[v]) 
                w = w + d[0][v] + d[1][u] == d[0][S] ? 0 : w;
        iota(X, X + n, 0);
        sort(X, X + n, [&](const int u, const int v) {return d[0][u] < d[0][v];});
        for (int i = n - 1; i >= 0; --i) {
                int v = X[i];
                tmp[0][v] = d[2][v];
                tmp[1][v] = d[3][v];
                for (auto [u, w]: adj[v]) if (!w) {
                        FOR(i, 0, 2) 
                                tmp[i][v] = min(tmp[i][v], tmp[i][u]);
                }
        }
        int mn = INF;
        FOR(v, 0, n) mn = min({d[3][v] + tmp[0][v], d[2][v] + tmp[1][v], mn});
        cout << mn << '\n';
        return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 250 ms 28792 KB Output is correct
2 Correct 232 ms 27748 KB Output is correct
3 Correct 220 ms 29344 KB Output is correct
4 Correct 256 ms 28568 KB Output is correct
5 Correct 201 ms 27656 KB Output is correct
6 Correct 272 ms 28828 KB Output is correct
7 Correct 206 ms 27456 KB Output is correct
8 Correct 238 ms 27644 KB Output is correct
9 Correct 258 ms 28468 KB Output is correct
10 Correct 229 ms 28612 KB Output is correct
11 Correct 66 ms 21000 KB Output is correct
12 Correct 226 ms 28604 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 294 ms 27916 KB Output is correct
2 Correct 240 ms 27772 KB Output is correct
3 Correct 232 ms 27720 KB Output is correct
4 Correct 256 ms 27560 KB Output is correct
5 Correct 226 ms 27740 KB Output is correct
6 Correct 253 ms 27956 KB Output is correct
7 Correct 218 ms 27588 KB Output is correct
8 Correct 257 ms 27768 KB Output is correct
9 Correct 235 ms 27740 KB Output is correct
10 Correct 262 ms 27808 KB Output is correct
11 Correct 75 ms 21080 KB Output is correct
12 Correct 213 ms 28000 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 13148 KB Output is correct
2 Correct 5 ms 11356 KB Output is correct
3 Correct 5 ms 11352 KB Output is correct
4 Correct 14 ms 14684 KB Output is correct
5 Correct 10 ms 13148 KB Output is correct
6 Correct 5 ms 11348 KB Output is correct
7 Correct 7 ms 11612 KB Output is correct
8 Correct 6 ms 11612 KB Output is correct
9 Correct 5 ms 11356 KB Output is correct
10 Correct 9 ms 13148 KB Output is correct
11 Correct 5 ms 11356 KB Output is correct
12 Correct 5 ms 11316 KB Output is correct
13 Correct 5 ms 11352 KB Output is correct
14 Correct 5 ms 11356 KB Output is correct
15 Correct 5 ms 11356 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 250 ms 28792 KB Output is correct
2 Correct 232 ms 27748 KB Output is correct
3 Correct 220 ms 29344 KB Output is correct
4 Correct 256 ms 28568 KB Output is correct
5 Correct 201 ms 27656 KB Output is correct
6 Correct 272 ms 28828 KB Output is correct
7 Correct 206 ms 27456 KB Output is correct
8 Correct 238 ms 27644 KB Output is correct
9 Correct 258 ms 28468 KB Output is correct
10 Correct 229 ms 28612 KB Output is correct
11 Correct 66 ms 21000 KB Output is correct
12 Correct 226 ms 28604 KB Output is correct
13 Correct 294 ms 27916 KB Output is correct
14 Correct 240 ms 27772 KB Output is correct
15 Correct 232 ms 27720 KB Output is correct
16 Correct 256 ms 27560 KB Output is correct
17 Correct 226 ms 27740 KB Output is correct
18 Correct 253 ms 27956 KB Output is correct
19 Correct 218 ms 27588 KB Output is correct
20 Correct 257 ms 27768 KB Output is correct
21 Correct 235 ms 27740 KB Output is correct
22 Correct 262 ms 27808 KB Output is correct
23 Correct 75 ms 21080 KB Output is correct
24 Correct 213 ms 28000 KB Output is correct
25 Correct 10 ms 13148 KB Output is correct
26 Correct 5 ms 11356 KB Output is correct
27 Correct 5 ms 11352 KB Output is correct
28 Correct 14 ms 14684 KB Output is correct
29 Correct 10 ms 13148 KB Output is correct
30 Correct 5 ms 11348 KB Output is correct
31 Correct 7 ms 11612 KB Output is correct
32 Correct 6 ms 11612 KB Output is correct
33 Correct 5 ms 11356 KB Output is correct
34 Correct 9 ms 13148 KB Output is correct
35 Correct 5 ms 11356 KB Output is correct
36 Correct 5 ms 11316 KB Output is correct
37 Correct 5 ms 11352 KB Output is correct
38 Correct 5 ms 11356 KB Output is correct
39 Correct 5 ms 11356 KB Output is correct
40 Correct 204 ms 28640 KB Output is correct
41 Correct 232 ms 28672 KB Output is correct
42 Correct 201 ms 28344 KB Output is correct
43 Correct 69 ms 21144 KB Output is correct
44 Correct 69 ms 21004 KB Output is correct
45 Correct 223 ms 28516 KB Output is correct
46 Correct 177 ms 27384 KB Output is correct
47 Correct 215 ms 28596 KB Output is correct
48 Correct 68 ms 20560 KB Output is correct
49 Correct 172 ms 28128 KB Output is correct
50 Correct 193 ms 27600 KB Output is correct
51 Correct 267 ms 27724 KB Output is correct