oj.uz

답안 #793541

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793541 2023-07-26T00:20:44 Z kebine Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 270 ms 25568 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second

int a[4];
bool vis[100005];
ll dist[4][100005], b[4][100005];
vector<pair<int, ll>> adj[100005];
priority_queue<pair<ll, int>> pq;

void bfs(int type) {
    pq.push({0, a[type]});
    while (!pq.empty()) {
        int x = pq.top().se;
        ll d = -pq.top().fi;
        pq.pop();
        if (dist[type][x] != d) continue;
        for (auto u : adj[x]) if (d + u.se < dist[type][u.fi]) dist[type][u.fi] = d + u.se, pq.push({-(d + u.se), u.fi}); 
    }
}

int main() { 
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < 4; i++) cin >> a[i];
    for (int i = 0; i < 4; i++) {
        for (int j = 1; j <= n; j++) {
            if (j != a[i]) dist[i][j] = 1e18;
            b[i][j] = 1e18;
        }
    }
    for (int i = 0; i < m; i++) {
        int x, y;
        ll w;
        cin >> x >> y >> w;
        adj[x].push_back({y, w});
        adj[y].push_back({x, w});
    }
    for (int i = 0; i < 4; i++) bfs(i);
    ll ans = dist[2][a[3]];
    b[0][a[0]] = dist[0][a[2]], b[1][a[0]] = dist[0][a[3]], b[2][a[0]] = dist[0][a[2]], b[3][a[0]] = dist[0][a[3]];
    vis[a[0]] = 1;
    pq.push({0, a[0]});
    while (!pq.empty()) {
        int x = pq.top().se;
        pq.pop();
        ans = min(ans, min(b[0][x] + b[1][x], b[2][x] + b[3][x]));
        for (auto u : adj[x]) {
            if (dist[0][x] + u.se + dist[1][u.fi] != dist[0][a[1]]) continue;
            ll t1 = min(b[0][x], dist[2][u.fi]), t2 = min(b[1][x], dist[3][u.fi]), t3 = min(b[2][x], dist[2][u.fi]), t4 = min(b[3][x], dist[3][u.fi]);
            if (b[0][u.fi] > t1) b[0][u.fi] = t1, b[1][u.fi] = t2;
            else if (b[0][u.fi] == t1) b[1][u.fi] = min(b[1][u.fi], t2);
            if (b[3][u.fi] > t4) b[2][u.fi] = t3, b[3][u.fi] = t4;
            else if (b[3][u.fi] == t4) b[2][u.fi] = min(b[2][u.fi], t3);
            if (!vis[u.fi]) pq.push({-dist[0][u.fi], u.fi}); 
            vis[u.fi] = 1;
        }
    }
    cout << ans << "\n";
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 211 ms 25280 KB Output is correct
2 Correct 266 ms 23916 KB Output is correct
3 Correct 241 ms 25112 KB Output is correct
4 Correct 188 ms 25272 KB Output is correct
5 Correct 212 ms 23856 KB Output is correct
6 Correct 250 ms 25204 KB Output is correct
7 Correct 228 ms 23804 KB Output is correct
8 Correct 270 ms 23888 KB Output is correct
9 Correct 213 ms 24832 KB Output is correct
10 Correct 206 ms 24900 KB Output is correct
11 Correct 80 ms 16280 KB Output is correct
12 Correct 210 ms 24644 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 243 ms 24180 KB Output is correct
2 Correct 230 ms 24012 KB Output is correct
3 Correct 239 ms 23880 KB Output is correct
4 Correct 244 ms 23888 KB Output is correct
5 Correct 251 ms 23864 KB Output is correct
6 Correct 264 ms 24172 KB Output is correct
7 Correct 260 ms 23876 KB Output is correct
8 Correct 244 ms 23932 KB Output is correct
9 Correct 262 ms 23884 KB Output is correct
10 Correct 236 ms 23892 KB Output is correct
11 Correct 86 ms 16312 KB Output is correct
12 Correct 249 ms 24188 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4436 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 11 ms 6228 KB Output is correct
5 Correct 7 ms 4436 KB Output is correct
6 Correct 2 ms 2812 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 2 ms 2788 KB Output is correct
10 Correct 7 ms 4436 KB Output is correct
11 Correct 1 ms 2684 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 211 ms 25280 KB Output is correct
2 Correct 266 ms 23916 KB Output is correct
3 Correct 241 ms 25112 KB Output is correct
4 Correct 188 ms 25272 KB Output is correct
5 Correct 212 ms 23856 KB Output is correct
6 Correct 250 ms 25204 KB Output is correct
7 Correct 228 ms 23804 KB Output is correct
8 Correct 270 ms 23888 KB Output is correct
9 Correct 213 ms 24832 KB Output is correct
10 Correct 206 ms 24900 KB Output is correct
11 Correct 80 ms 16280 KB Output is correct
12 Correct 210 ms 24644 KB Output is correct
13 Correct 243 ms 24180 KB Output is correct
14 Correct 230 ms 24012 KB Output is correct
15 Correct 239 ms 23880 KB Output is correct
16 Correct 244 ms 23888 KB Output is correct
17 Correct 251 ms 23864 KB Output is correct
18 Correct 264 ms 24172 KB Output is correct
19 Correct 260 ms 23876 KB Output is correct
20 Correct 244 ms 23932 KB Output is correct
21 Correct 262 ms 23884 KB Output is correct
22 Correct 236 ms 23892 KB Output is correct
23 Correct 86 ms 16312 KB Output is correct
24 Correct 249 ms 24188 KB Output is correct
25 Correct 7 ms 4436 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 2 ms 2772 KB Output is correct
28 Correct 11 ms 6228 KB Output is correct
29 Correct 7 ms 4436 KB Output is correct
30 Correct 2 ms 2812 KB Output is correct
31 Correct 2 ms 2900 KB Output is correct
32 Correct 3 ms 2900 KB Output is correct
33 Correct 2 ms 2788 KB Output is correct
34 Correct 7 ms 4436 KB Output is correct
35 Correct 1 ms 2684 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2772 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 2 ms 2772 KB Output is correct
40 Correct 231 ms 25568 KB Output is correct
41 Correct 197 ms 24636 KB Output is correct
42 Correct 201 ms 24664 KB Output is correct
43 Correct 107 ms 16384 KB Output is correct
44 Correct 108 ms 16384 KB Output is correct
45 Correct 211 ms 23876 KB Output is correct
46 Correct 230 ms 23620 KB Output is correct
47 Correct 200 ms 25180 KB Output is correct
48 Correct 101 ms 15752 KB Output is correct
49 Correct 168 ms 25240 KB Output is correct
50 Correct 228 ms 23836 KB Output is correct
51 Correct 234 ms 23748 KB Output is correct