oj.uz

답안 #897925

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897925 2024-01-04T04:58:27 Z avighna Olympic Bus (JOI20_ho_t4) C++17
0 / 100
 381 ms 5108 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;
};

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

vector<ll> sssp(ll source, ll i) {
  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();
    for (auto &nb : adj[node]) {
      if (edges[nb.second].u != node) {
        if (nb.second != i) {
          continue;
        }
      } else if (nb.second == i) {
        continue;
      }
      if (dist[nb.first] > _dist + c[nb.second]) {
        dist[nb.first] = _dist + c[nb.second];
        pq.push({-dist[nb.first], nb.first});
      }
    }
  }
  return dist;
}

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));
  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});
    adj[v].push_back({u, i});
    edges[i].u = u, edges[i].v = v, edges[i].i = 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]);
  sort(edges, edges + m, [&dist](const Edge &e1, const Edge &e2) {
    ll u1 = e1.u, u2 = e2.u, v1 = e1.v, v2 = e2.v, i1 = e1.i, i2 = e2.i;
    ll d1 = min(dist[1][n], dist[1][v1] + c[i1] + dist[u1][n]) +
            min(dist[n][1], dist[n][v1] + c[i1] + dist[u1][1]) + d[i1];
    ll d2 = min(dist[1][n], dist[1][v2] + c[i2] + dist[u2][n]) +
            min(dist[n][1], dist[n][v2] + c[i2] + dist[u2][1]) + d[i2];
    return d1 < d2;
  });
  for (ll i = 0; i < m; ++i) {
    ll u = edges[i].u, v = edges[i].v;
    if (min(dist[1][n], dist[1][v] + c[i] + dist[u][n]) +
            min(dist[n][1], dist[n][v] + c[i] + dist[u][1]) + d[i] <
        ans) {
      ans = min(ans, d[i] + sssp(1, i)[n] + sssp(n, i)[1]);
    }
  }
  if (ans == (ll)(1e15)) {
    ans = -1;
  }
  cout << ans << "\n";
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 856 KB Output is correct
2 Correct 7 ms 604 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 8 ms 860 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 5108 KB Output is correct
2 Incorrect 29 ms 4952 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 856 KB Output is correct
2 Correct 7 ms 604 KB Output is correct
3 Correct 30 ms 3932 KB Output is correct
4 Correct 7 ms 604 KB Output is correct
5 Correct 28 ms 4864 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 381 ms 5056 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 856 KB Output is correct
2 Correct 7 ms 604 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 8 ms 860 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -