oj.uz

답안 #977399

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977399 2024-05-07T21:20:17 Z 0x34c Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 494 ms 56464 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define piii pair<int, pii>
#define endl '\n'
#define int ll

using namespace std;

const int INF = 1e9*2e6 + 100;

struct node {
    int v, w, dw, x;
};

class Compare {
public:
    bool operator()(node &a, node &b)
    {
        if(a.w == b.w) return a.dw > b.dw;
        return a.w > b.w;
    }
};

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int N, M;
    cin >> N >> M;

    int S, T, U, V;
    cin >> S >> T >> U >> V;
    --S; --T; --U; --V;

    vector<vector<pii>> graph(N);
    for(int i = 0; i < M; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        --a; --b;

        graph[a].push_back({b, c});
        graph[b].push_back({a, c});
    }


    auto dijkstra = [graph](int S, vector<int> &dist) {
        priority_queue<pii, vector<pii>, greater<pii>> pq;
        pq.push({0, S});
        dist[S] = 0;

        while(!pq.empty()) {
            int w, v;
            tie(w, v) = pq.top(); pq.pop();

            for(pii u : graph[v]) {
                if(dist[u.first] > w + u.second) {
                    dist[u.first] = w + u.second;
                    pq.push({dist[u.first], u.first});
                }
            }
        }
    };

    vector<int> distV(N, INF), distU(N, INF);
    dijkstra(V, distV); dijkstra(U, distU);

    vector<vector<pii>> dist(N, vector<pii>(1LL << 2, {INF, INF}));
    dist[S][0] = {0, 0};


    priority_queue<node, vector<node>, Compare> pq;
    pq.push({S, 0, 0, 0});

    while(!pq.empty()) {
        int v = pq.top().v, w = pq.top().w, dw = pq.top().dw, x = pq.top().x;
        pq.pop();
        

        // go to state 1
        if(!(x & 1) && (dist[v][x | 1].first > w || (dist[v][x | 1].first == w && dist[v][x | 1].second > dw + distU[v]))) {
            dist[v][x | 1] = {w, dw + distU[v]};
            pq.push({v, w, dw + distU[v], x|1});
        }

        // go to state 2
        if(!(x & 2) && (dist[v][x | 2].first > w || (dist[v][x | 2].first == w && dist[v][x | 2].second > dw + distV[v]))) {
            dist[v][x | 2] = {w, dw + distV[v]};
            pq.push({v, w, dw + distV[v], x|2});
        }

        for(pii u : graph[v]) {
            if((dist[u.first][x].first > w + u.second) || (dist[u.first][x].first == w + u.second && dist[u.first][x].second > dw)) {
                dist[u.first][x] = {w + u.second, dw};
                pq.push({u.first, w + u.second, dw, x});
            }
        }
    }

    cout << min(distV[U], dist[T][3].second) << endl;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 407 ms 56464 KB Output is correct
2 Correct 494 ms 47872 KB Output is correct
3 Correct 398 ms 47432 KB Output is correct
4 Correct 374 ms 46592 KB Output is correct
5 Correct 438 ms 47804 KB Output is correct
6 Correct 423 ms 55024 KB Output is correct
7 Correct 416 ms 47588 KB Output is correct
8 Correct 416 ms 47136 KB Output is correct
9 Correct 383 ms 47372 KB Output is correct
10 Correct 284 ms 48048 KB Output is correct
11 Correct 120 ms 29000 KB Output is correct
12 Correct 410 ms 48760 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 467 ms 47656 KB Output is correct
2 Correct 435 ms 46084 KB Output is correct
3 Correct 447 ms 47376 KB Output is correct
4 Correct 456 ms 46604 KB Output is correct
5 Correct 446 ms 47792 KB Output is correct
6 Correct 360 ms 47696 KB Output is correct
7 Correct 457 ms 46832 KB Output is correct
8 Correct 428 ms 47104 KB Output is correct
9 Correct 445 ms 47604 KB Output is correct
10 Correct 414 ms 46088 KB Output is correct
11 Correct 104 ms 28656 KB Output is correct
12 Correct 352 ms 47436 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 3544 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 40 ms 6440 KB Output is correct
5 Correct 8 ms 2904 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 6 ms 2752 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 407 ms 56464 KB Output is correct
2 Correct 494 ms 47872 KB Output is correct
3 Correct 398 ms 47432 KB Output is correct
4 Correct 374 ms 46592 KB Output is correct
5 Correct 438 ms 47804 KB Output is correct
6 Correct 423 ms 55024 KB Output is correct
7 Correct 416 ms 47588 KB Output is correct
8 Correct 416 ms 47136 KB Output is correct
9 Correct 383 ms 47372 KB Output is correct
10 Correct 284 ms 48048 KB Output is correct
11 Correct 120 ms 29000 KB Output is correct
12 Correct 410 ms 48760 KB Output is correct
13 Correct 467 ms 47656 KB Output is correct
14 Correct 435 ms 46084 KB Output is correct
15 Correct 447 ms 47376 KB Output is correct
16 Correct 456 ms 46604 KB Output is correct
17 Correct 446 ms 47792 KB Output is correct
18 Correct 360 ms 47696 KB Output is correct
19 Correct 457 ms 46832 KB Output is correct
20 Correct 428 ms 47104 KB Output is correct
21 Correct 445 ms 47604 KB Output is correct
22 Correct 414 ms 46088 KB Output is correct
23 Correct 104 ms 28656 KB Output is correct
24 Correct 352 ms 47436 KB Output is correct
25 Correct 17 ms 3544 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 40 ms 6440 KB Output is correct
29 Correct 8 ms 2904 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 2 ms 860 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 6 ms 2752 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 600 KB Output is correct
40 Correct 435 ms 54268 KB Output is correct
41 Correct 376 ms 48040 KB Output is correct
42 Correct 445 ms 48428 KB Output is correct
43 Correct 101 ms 28860 KB Output is correct
44 Correct 118 ms 28756 KB Output is correct
45 Correct 325 ms 46376 KB Output is correct
46 Correct 394 ms 47000 KB Output is correct
47 Correct 355 ms 47660 KB Output is correct
48 Correct 114 ms 28340 KB Output is correct
49 Correct 325 ms 54776 KB Output is correct
50 Correct 332 ms 47848 KB Output is correct
51 Correct 278 ms 48036 KB Output is correct