oj.uz

답안 #897959

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897959 2024-01-04T06:04:40 Z avighna Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 9044 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const ll N = 201, M = 50001;

ll n, m;

struct Edge {
  ll u, v, i, c;
};

vector<pair<ll, pair<ll, bool>>> adj[N];
ll c[M], d[M];
Edge edges[M];

ll sssp(ll source, ll i, ll dest) {
  vector<ll> dist(n + 1, 1e15);
  dist[source] = 0;
  priority_queue<pair<ll, ll>> pq;
  pq.push({0, source});
  while (!pq.empty()) {
    ll node = pq.top().second, _dist = -pq.top().first;
    pq.pop();
    if (node == dest) {
      return dist[node];
    }
    for (auto &nb : adj[node]) {
      if (nb.second.second) {
        if (nb.second.first != i) {
          continue;
        }
      } else if (nb.second.first == i) {
        continue;
      }
      if (dist[nb.first] > _dist + c[nb.second.first]) {
        dist[nb.first] = _dist + c[nb.second.first];
        pq.push({-dist[nb.first], nb.first});
      }
    }
  }
  return dist[dest];
}

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

  cin >> n >> m;
  for (ll i = 1; i <= n; ++i) {
    adj[i].clear();
  }
  vector<vector<ll>> dist(n + 1, vector<ll>(n + 1, 1e15));
  vector<Edge> edges(m);
  for (ll i = 1; i <= n; ++i) {
    dist[i][i] = 0;
  }
  for (ll i = 0, u, v; i < m; ++i) {
    cin >> u >> v >> c[i] >> d[i];
    adj[u].push_back({v, {i, 0}}), adj[v].push_back({u, {i, 1}});
    edges[i].u = u, edges[i].v = v, edges[i].i = i, edges[i].c = c[i];
    dist[u][v] = min(dist[u][v], c[i]);
  }

  for (ll k = 1; k <= n; ++k) {
    for (ll i = 1; i <= n; ++i) {
      for (ll j = 1; j <= n; ++j) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }
    }
  }

  ll ans = min((ll)1e15, dist[1][n] + dist[n][1]);
  for (auto &[u, v, i, c] : edges) {
    ll d1 = min(dist[1][n], dist[1][v] + c + dist[u][n]);
    ll d2 = min(dist[n][1], dist[n][v] + c + dist[u][1]);
    if (d1 + d2 + d[i] < ans) {
      ll actual = d[i] + sssp(1, i, n) + sssp(n, i, 1);
      ans = min(ans, actual);
    }
  }
  if (ans == (ll)(1e15)) {
    ans = -1;
  }
  cout << ans << "\n";
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2904 KB Output is correct
2 Correct 9 ms 2652 KB Output is correct
3 Correct 8 ms 2908 KB Output is correct
4 Correct 8 ms 2960 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 7 ms 2648 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 11 ms 2908 KB Output is correct
11 Correct 21 ms 2988 KB Output is correct
12 Correct 8 ms 2908 KB Output is correct
13 Correct 8 ms 2908 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 8 ms 2908 KB Output is correct
16 Correct 8 ms 2908 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 8736 KB Output is correct
2 Correct 22 ms 8540 KB Output is correct
3 Correct 22 ms 8536 KB Output is correct
4 Correct 8 ms 2908 KB Output is correct
5 Correct 8 ms 2924 KB Output is correct
6 Correct 7 ms 2904 KB Output is correct
7 Correct 7 ms 2648 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 36 ms 8796 KB Output is correct
10 Correct 33 ms 8784 KB Output is correct
11 Correct 29 ms 9044 KB Output is correct
12 Correct 23 ms 8732 KB Output is correct
13 Correct 23 ms 8796 KB Output is correct
14 Correct 24 ms 8892 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 2908 KB Output is correct
2 Correct 7 ms 2880 KB Output is correct
3 Correct 18 ms 7260 KB Output is correct
4 Correct 7 ms 2652 KB Output is correct
5 Correct 22 ms 8752 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 28 ms 8540 KB Output is correct
9 Correct 30 ms 8528 KB Output is correct
10 Correct 22 ms 8540 KB Output is correct
11 Correct 22 ms 8540 KB Output is correct
12 Correct 23 ms 8796 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2516 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 22 ms 8792 KB Output is correct
20 Correct 22 ms 8540 KB Output is correct
21 Correct 21 ms 8608 KB Output is correct
22 Correct 22 ms 8672 KB Output is correct

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2904 KB Output is correct
2 Correct 9 ms 2652 KB Output is correct
3 Correct 8 ms 2908 KB Output is correct
4 Correct 8 ms 2960 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 7 ms 2648 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 11 ms 2908 KB Output is correct
11 Correct 21 ms 2988 KB Output is correct
12 Correct 8 ms 2908 KB Output is correct
13 Correct 8 ms 2908 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 8 ms 2908 KB Output is correct
16 Correct 8 ms 2908 KB Output is correct
17 Correct 24 ms 8736 KB Output is correct
18 Correct 22 ms 8540 KB Output is correct
19 Correct 22 ms 8536 KB Output is correct
20 Correct 8 ms 2908 KB Output is correct
21 Correct 8 ms 2924 KB Output is correct
22 Correct 7 ms 2904 KB Output is correct
23 Correct 7 ms 2648 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 36 ms 8796 KB Output is correct
26 Correct 33 ms 8784 KB Output is correct
27 Correct 29 ms 9044 KB Output is correct
28 Correct 23 ms 8732 KB Output is correct
29 Correct 23 ms 8796 KB Output is correct
30 Correct 24 ms 8892 KB Output is correct
31 Correct 10 ms 2908 KB Output is correct
32 Correct 7 ms 2880 KB Output is correct
33 Correct 18 ms 7260 KB Output is correct
34 Correct 7 ms 2652 KB Output is correct
35 Correct 22 ms 8752 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 0 ms 2396 KB Output is correct
38 Correct 28 ms 8540 KB Output is correct
39 Correct 30 ms 8528 KB Output is correct
40 Correct 22 ms 8540 KB Output is correct
41 Correct 22 ms 8540 KB Output is correct
42 Correct 23 ms 8796 KB Output is correct
43 Correct 0 ms 2396 KB Output is correct
44 Correct 0 ms 2396 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 0 ms 2516 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 22 ms 8792 KB Output is correct
50 Correct 22 ms 8540 KB Output is correct
51 Correct 21 ms 8608 KB Output is correct
52 Correct 22 ms 8672 KB Output is correct
53 Correct 23 ms 8540 KB Output is correct
54 Correct 21 ms 8540 KB Output is correct
55 Correct 21 ms 8416 KB Output is correct
56 Correct 8 ms 2904 KB Output is correct
57 Correct 8 ms 2904 KB Output is correct
58 Correct 35 ms 7516 KB Output is correct
59 Correct 38 ms 7516 KB Output is correct
60 Correct 48 ms 7512 KB Output is correct
61 Correct 51 ms 7516 KB Output is correct
62 Correct 308 ms 7516 KB Output is correct
63 Correct 751 ms 7772 KB Output is correct
64 Correct 320 ms 8044 KB Output is correct
65 Correct 845 ms 8064 KB Output is correct
66 Execution timed out 1032 ms 8296 KB Time limit exceeded
67 Halted 0 ms 0 KB -