oj.uz

답안 #757083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
757083 2023-06-12T14:20:54 Z gun_gan Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 606 ms 20320 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 1e5 + 5;

int N, M, S, T, U, V;
ll d[5][MX], dd[MX];
vector<pair<int,int>> g[MX];

void work(int s, int t) {
      for(int i = 1; i <= N; i++) d[t][i] = 1e18;

      priority_queue<pair<ll, ll>> pq;
      pq.push({0, s});
      d[t][s] = 0;
      while(!pq.empty()) {    
            auto [c, v] = pq.top(); pq.pop();
            c = -c;
            if(d[t][v] < c) continue;
            for(auto [u, w] : g[v]) {
                  if(d[t][u] > c + w) {
                        d[t][u] = c + w;
                        pq.push({-d[t][u], u});
                  }
            }
      }
}

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

      cin >> N >> M >> S >> T >> U >> V;

      for(int i = 0; i < M; i++) {
            int u, v, w;
            cin >> u >> v >> w;
            g[u].push_back({v, w});
            g[v].push_back({u, w});
      }

      ll ans = 1e18;
      for(int it = 0; it < 2; it++) {
            work(S, 0);
            work(T, 1);
            work(U, 2);
            work(V, 3);

            // solve
            priority_queue<pair<ll, ll>> pq;

            for(int i = 1; i <= N; i++) {
                  if(d[0][i] + d[1][i] == d[0][T]) {
                        dd[i] = d[2][i];
                        pq.push({-dd[i], i}); 
                  } else {
                        dd[i] = 1e18;
                  }
            }

            while(!pq.empty()) {
                  auto [c, v] = pq.top(); pq.pop();
                  c = -c;
                  if(dd[v] < c) continue;
                  for(auto [u, w] : g[v]) {
                        if(d[0][v] + w + d[1][u] == d[0][T] && dd[u] > c) { // in shortest path
                              dd[u] = c;
                              pq.push({-dd[u], u});
                        }
                  }
            }

            for(int i = 1; i <= N; i++) {
                  ans = min(ans, dd[i] + d[3][i]);
            }
            ans = min(ans, d[2][V]);

            swap(U, V);
      }

      cout << ans << '\n';
      
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 442 ms 19784 KB Output is correct
2 Correct 489 ms 18492 KB Output is correct
3 Correct 535 ms 19540 KB Output is correct
4 Correct 456 ms 19788 KB Output is correct
5 Correct 506 ms 18100 KB Output is correct
6 Correct 465 ms 19972 KB Output is correct
7 Correct 527 ms 18344 KB Output is correct
8 Correct 507 ms 18276 KB Output is correct
9 Correct 451 ms 18960 KB Output is correct
10 Correct 402 ms 18940 KB Output is correct
11 Correct 237 ms 13404 KB Output is correct
12 Correct 504 ms 18996 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 543 ms 18568 KB Output is correct
2 Correct 513 ms 18236 KB Output is correct
3 Correct 542 ms 18208 KB Output is correct
4 Correct 557 ms 18324 KB Output is correct
5 Correct 547 ms 18272 KB Output is correct
6 Correct 606 ms 18504 KB Output is correct
7 Correct 534 ms 19472 KB Output is correct
8 Correct 509 ms 18272 KB Output is correct
9 Correct 549 ms 18176 KB Output is correct
10 Correct 559 ms 18260 KB Output is correct
11 Correct 265 ms 13656 KB Output is correct
12 Correct 580 ms 18692 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 3796 KB Output is correct
2 Correct 3 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 16 ms 4720 KB Output is correct
5 Correct 10 ms 3712 KB Output is correct
6 Correct 3 ms 2772 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 4 ms 2772 KB Output is correct
9 Correct 3 ms 2772 KB Output is correct
10 Correct 10 ms 3668 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 3 ms 2644 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 442 ms 19784 KB Output is correct
2 Correct 489 ms 18492 KB Output is correct
3 Correct 535 ms 19540 KB Output is correct
4 Correct 456 ms 19788 KB Output is correct
5 Correct 506 ms 18100 KB Output is correct
6 Correct 465 ms 19972 KB Output is correct
7 Correct 527 ms 18344 KB Output is correct
8 Correct 507 ms 18276 KB Output is correct
9 Correct 451 ms 18960 KB Output is correct
10 Correct 402 ms 18940 KB Output is correct
11 Correct 237 ms 13404 KB Output is correct
12 Correct 504 ms 18996 KB Output is correct
13 Correct 543 ms 18568 KB Output is correct
14 Correct 513 ms 18236 KB Output is correct
15 Correct 542 ms 18208 KB Output is correct
16 Correct 557 ms 18324 KB Output is correct
17 Correct 547 ms 18272 KB Output is correct
18 Correct 606 ms 18504 KB Output is correct
19 Correct 534 ms 19472 KB Output is correct
20 Correct 509 ms 18272 KB Output is correct
21 Correct 549 ms 18176 KB Output is correct
22 Correct 559 ms 18260 KB Output is correct
23 Correct 265 ms 13656 KB Output is correct
24 Correct 580 ms 18692 KB Output is correct
25 Correct 10 ms 3796 KB Output is correct
26 Correct 3 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 16 ms 4720 KB Output is correct
29 Correct 10 ms 3712 KB Output is correct
30 Correct 3 ms 2772 KB Output is correct
31 Correct 3 ms 2772 KB Output is correct
32 Correct 4 ms 2772 KB Output is correct
33 Correct 3 ms 2772 KB Output is correct
34 Correct 10 ms 3668 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 3 ms 2644 KB Output is correct
39 Correct 3 ms 2688 KB Output is correct
40 Correct 440 ms 20320 KB Output is correct
41 Correct 487 ms 18892 KB Output is correct
42 Correct 456 ms 18936 KB Output is correct
43 Correct 274 ms 15400 KB Output is correct
44 Correct 264 ms 15408 KB Output is correct
45 Correct 494 ms 19992 KB Output is correct
46 Correct 412 ms 19744 KB Output is correct
47 Correct 450 ms 19628 KB Output is correct
48 Correct 303 ms 14752 KB Output is correct
49 Correct 340 ms 19836 KB Output is correct
50 Correct 498 ms 19756 KB Output is correct
51 Correct 478 ms 19804 KB Output is correct