oj.uz

답안 #941638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941638 2024-03-09T08:14:38 Z May27_th Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 272 ms 36652 KB 
#include<bits/stdc++.h>
#define taskname "A"
using namespace std;

void World_Final();
void Solve();

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    if (fopen(taskname".in", "r")) {
        freopen(taskname".in", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    World_Final();
}

void World_Final(){
    int Tests = 1;
    //cin >> Tests;
    for (int i = 1; i <= Tests; i ++) {
        //cout << i << "\n";
        Solve();
    }
}

const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 10;
const int64_t INF = 1e18;
int N, M, S, T, U, V; vector<pair<int, int>> G[MAXN]; int64_t D[MAXN][5], F[MAXN][5];
pair<int64_t, int> Trace[MAXN];
void Dijkstra(int START, int t){
    for (int i = 1; i <= N; i ++) D[i][t] = INF; D[START][t] = 0;
    priority_queue<pair<int64_t, int>> pq; pq.push(make_pair(0, START));
    while (!pq.empty()) {
        int64_t d; int u; tie(d, u) = pq.top(); pq.pop();
        if (-d != D[u][t]) continue;
        for (auto [v, w] : G[u]) {
            if (D[v][t] > D[u][t] + w) {
                D[v][t] = D[u][t] + w;
                pq.push(make_pair(-D[v][t], v));
            }
        }
    }
}
void Solve(){
    cin >> N >> M >> S >> T >> U >> V;
    for (int i = 1; i <= M; i ++) {
        int u, v, w; cin >> u >> v >> w;
        G[u].push_back(make_pair(v, w));
        G[v].push_back(make_pair(u, w));
    } Dijkstra(S, 0); Dijkstra(T, 1);
    for (int i = 1; i <= N; i ++) {
        for (int t = 0; t <= 2; t ++) {
            F[i][t] = INF;
        }
    }
    F[U][0] = 0;
    priority_queue<pair<int64_t, pair<int, int>>> pq; pq.push(make_pair(0, make_pair(U, 0)));
    while (!pq.empty()) {
        int64_t d = pq.top().first;
        int u, t; tie(u, t) = pq.top().second;
        pq.pop();
        if (-d != F[u][t]) continue;
        for (auto [v, w] : G[u]) {
            if (t == 0) {
                if (F[v][0] > F[u][0] + w) {
                    F[v][0] = F[u][0] + w;
                    pq.push(make_pair(-F[v][t], make_pair(v, t)));
                } if (F[v][1] > F[u][0]) {
                    int64_t minDist = min(D[u][0] + w + D[v][1], D[u][1] + w + D[v][0]);
                    if (minDist == D[T][0]) {
                        F[v][1] = F[u][0];
                        Trace[v] = make_pair(w, u);
                        pq.push(make_pair(-F[v][1], make_pair(v, 1)));
                    }
                }
            } else if (t == 1) {
                if (F[v][1] > F[u][1]) {
                    int64_t tot = Trace[u].first + w;
                    int st = Trace[u].second;
                    int64_t minDist = min(D[st][0] + D[v][1], D[st][1] + D[v][0]) + tot;
                    if (minDist == D[T][0]) {
                        F[v][1] = F[u][1];
                        Trace[v] = make_pair(tot, st);
                        //cout << u << " " << v << " " << w << "\n";
                        pq.push(make_pair(-F[v][1], make_pair(v, 1)));
                    }
                } if (F[v][2] > F[u][1] + w) {
                    F[v][2] = F[u][1] + w;
                    pq.push(make_pair(-F[v][2], make_pair(v, 2)));
                }
            } else if (t == 2) {
                if (F[v][2] > F[u][2] + w) {
                    F[v][2] = F[u][2] + w;
                    pq.push(make_pair(-F[v][2], make_pair(v, 2)));
                }
            }
        }
    }
    //cout << F[V][0] << " " << F[V][1] << " " << F[V][2] << "\n";
    cout << min({F[V][0], F[V][1], F[V][2]});
}

Compilation message

commuter_pass.cpp: In function 'void Dijkstra(int, int)':
commuter_pass.cpp:32:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   32 |     for (int i = 1; i <= N; i ++) D[i][t] = INF; D[START][t] = 0;
      |     ^~~
commuter_pass.cpp:32:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   32 |     for (int i = 1; i <= N; i ++) D[i][t] = INF; D[START][t] = 0;
      |                                                  ^
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:11:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         freopen(taskname".in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:12:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 196 ms 33284 KB Output is correct
2 Correct 215 ms 29168 KB Output is correct
3 Correct 243 ms 33036 KB Output is correct
4 Correct 186 ms 28816 KB Output is correct
5 Correct 242 ms 31232 KB Output is correct
6 Correct 207 ms 32180 KB Output is correct
7 Correct 252 ms 30768 KB Output is correct
8 Correct 246 ms 31628 KB Output is correct
9 Correct 215 ms 28876 KB Output is correct
10 Correct 170 ms 28976 KB Output is correct
11 Correct 123 ms 23900 KB Output is correct
12 Correct 235 ms 28932 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 29172 KB Output is correct
2 Correct 230 ms 29124 KB Output is correct
3 Correct 272 ms 32316 KB Output is correct
4 Correct 226 ms 29108 KB Output is correct
5 Correct 240 ms 29080 KB Output is correct
6 Correct 225 ms 30076 KB Output is correct
7 Correct 253 ms 30220 KB Output is correct
8 Correct 257 ms 29068 KB Output is correct
9 Correct 240 ms 29080 KB Output is correct
10 Correct 246 ms 28956 KB Output is correct
11 Correct 98 ms 25284 KB Output is correct
12 Correct 238 ms 30532 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 10076 KB Output is correct
2 Correct 2 ms 9308 KB Output is correct
3 Correct 2 ms 9308 KB Output is correct
4 Correct 11 ms 10584 KB Output is correct
5 Correct 7 ms 10076 KB Output is correct
6 Correct 2 ms 9308 KB Output is correct
7 Correct 3 ms 9308 KB Output is correct
8 Correct 4 ms 9316 KB Output is correct
9 Correct 2 ms 9308 KB Output is correct
10 Correct 7 ms 10436 KB Output is correct
11 Correct 2 ms 9304 KB Output is correct
12 Correct 2 ms 9308 KB Output is correct
13 Correct 2 ms 9308 KB Output is correct
14 Correct 2 ms 9308 KB Output is correct
15 Correct 3 ms 9388 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 196 ms 33284 KB Output is correct
2 Correct 215 ms 29168 KB Output is correct
3 Correct 243 ms 33036 KB Output is correct
4 Correct 186 ms 28816 KB Output is correct
5 Correct 242 ms 31232 KB Output is correct
6 Correct 207 ms 32180 KB Output is correct
7 Correct 252 ms 30768 KB Output is correct
8 Correct 246 ms 31628 KB Output is correct
9 Correct 215 ms 28876 KB Output is correct
10 Correct 170 ms 28976 KB Output is correct
11 Correct 123 ms 23900 KB Output is correct
12 Correct 235 ms 28932 KB Output is correct
13 Correct 246 ms 29172 KB Output is correct
14 Correct 230 ms 29124 KB Output is correct
15 Correct 272 ms 32316 KB Output is correct
16 Correct 226 ms 29108 KB Output is correct
17 Correct 240 ms 29080 KB Output is correct
18 Correct 225 ms 30076 KB Output is correct
19 Correct 253 ms 30220 KB Output is correct
20 Correct 257 ms 29068 KB Output is correct
21 Correct 240 ms 29080 KB Output is correct
22 Correct 246 ms 28956 KB Output is correct
23 Correct 98 ms 25284 KB Output is correct
24 Correct 238 ms 30532 KB Output is correct
25 Correct 7 ms 10076 KB Output is correct
26 Correct 2 ms 9308 KB Output is correct
27 Correct 2 ms 9308 KB Output is correct
28 Correct 11 ms 10584 KB Output is correct
29 Correct 7 ms 10076 KB Output is correct
30 Correct 2 ms 9308 KB Output is correct
31 Correct 3 ms 9308 KB Output is correct
32 Correct 4 ms 9316 KB Output is correct
33 Correct 2 ms 9308 KB Output is correct
34 Correct 7 ms 10436 KB Output is correct
35 Correct 2 ms 9304 KB Output is correct
36 Correct 2 ms 9308 KB Output is correct
37 Correct 2 ms 9308 KB Output is correct
38 Correct 2 ms 9308 KB Output is correct
39 Correct 3 ms 9388 KB Output is correct
40 Correct 195 ms 35720 KB Output is correct
41 Correct 231 ms 31968 KB Output is correct
42 Correct 198 ms 32064 KB Output is correct
43 Correct 103 ms 27080 KB Output is correct
44 Correct 95 ms 27176 KB Output is correct
45 Correct 234 ms 34276 KB Output is correct
46 Correct 232 ms 33712 KB Output is correct
47 Correct 244 ms 33852 KB Output is correct
48 Correct 112 ms 26664 KB Output is correct
49 Correct 206 ms 36652 KB Output is correct
50 Correct 258 ms 35204 KB Output is correct
51 Correct 227 ms 35428 KB Output is correct