oj.uz

답안 #897917

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

using namespace std;

#define ll long long

const ll N = 201, M = 50001;

ll n, m;

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

vector<ll> sssp(ll source) {
  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 (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].insert({v, i});
    edges[i] = {u, v};
    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 (ll i = 0; i < m; ++i) {
    ll u = edges[i].first, v = edges[i].second;
    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) {
      adj[u].erase(adj[u].find({v, i}));
      adj[v].insert({u, i});
      ans = min(ans, d[i] + sssp(1)[n] + sssp(n)[1]);
      adj[v].erase(adj[v].find({edges[i].first, i}));
      adj[u].insert({v, i});
    }
  }
  if (ans == (ll)(1e15)) {
    ans = -1;
  }
  cout << ans << "\n";
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 856 KB Output is correct
2 Correct 10 ms 600 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 11 ms 860 KB Output is correct
11 Correct 22 ms 860 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 7 ms 856 KB Output is correct
14 Correct 8 ms 860 KB Output is correct
15 Correct 7 ms 856 KB Output is correct
16 Correct 8 ms 856 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 5468 KB Output is correct
2 Correct 37 ms 5468 KB Output is correct
3 Correct 27 ms 6628 KB Output is correct
4 Correct 11 ms 860 KB Output is correct
5 Correct 8 ms 860 KB Output is correct
6 Correct 9 ms 864 KB Output is correct
7 Correct 8 ms 604 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 90 ms 6640 KB Output is correct
10 Correct 64 ms 6488 KB Output is correct
11 Correct 40 ms 6484 KB Output is correct
12 Correct 39 ms 6480 KB Output is correct
13 Correct 33 ms 6480 KB Output is correct
14 Correct 33 ms 6492 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 860 KB Output is correct
2 Correct 7 ms 604 KB Output is correct
3 Correct 28 ms 4444 KB Output is correct
4 Correct 7 ms 600 KB Output is correct
5 Correct 29 ms 6236 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 54 ms 6396 KB Output is correct
9 Correct 60 ms 6236 KB Output is correct
10 Correct 29 ms 6236 KB Output is correct
11 Correct 33 ms 6236 KB Output is correct
12 Correct 29 ms 6308 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 472 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 35 ms 6216 KB Output is correct
20 Correct 32 ms 6236 KB Output is correct
21 Correct 37 ms 6484 KB Output is correct
22 Correct 30 ms 6232 KB Output is correct

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 856 KB Output is correct
2 Correct 10 ms 600 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 11 ms 860 KB Output is correct
11 Correct 22 ms 860 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 7 ms 856 KB Output is correct
14 Correct 8 ms 860 KB Output is correct
15 Correct 7 ms 856 KB Output is correct
16 Correct 8 ms 856 KB Output is correct
17 Correct 26 ms 5468 KB Output is correct
18 Correct 37 ms 5468 KB Output is correct
19 Correct 27 ms 6628 KB Output is correct
20 Correct 11 ms 860 KB Output is correct
21 Correct 8 ms 860 KB Output is correct
22 Correct 9 ms 864 KB Output is correct
23 Correct 8 ms 604 KB Output is correct
24 Correct 0 ms 468 KB Output is correct
25 Correct 90 ms 6640 KB Output is correct
26 Correct 64 ms 6488 KB Output is correct
27 Correct 40 ms 6484 KB Output is correct
28 Correct 39 ms 6480 KB Output is correct
29 Correct 33 ms 6480 KB Output is correct
30 Correct 33 ms 6492 KB Output is correct
31 Correct 7 ms 860 KB Output is correct
32 Correct 7 ms 604 KB Output is correct
33 Correct 28 ms 4444 KB Output is correct
34 Correct 7 ms 600 KB Output is correct
35 Correct 29 ms 6236 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 54 ms 6396 KB Output is correct
39 Correct 60 ms 6236 KB Output is correct
40 Correct 29 ms 6236 KB Output is correct
41 Correct 33 ms 6236 KB Output is correct
42 Correct 29 ms 6308 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 472 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 35 ms 6216 KB Output is correct
50 Correct 32 ms 6236 KB Output is correct
51 Correct 37 ms 6484 KB Output is correct
52 Correct 30 ms 6232 KB Output is correct
53 Correct 29 ms 6224 KB Output is correct
54 Correct 36 ms 6336 KB Output is correct
55 Correct 35 ms 6224 KB Output is correct
56 Correct 7 ms 856 KB Output is correct
57 Correct 8 ms 860 KB Output is correct
58 Correct 71 ms 5360 KB Output is correct
59 Correct 62 ms 5372 KB Output is correct
60 Correct 81 ms 5200 KB Output is correct
61 Correct 73 ms 5372 KB Output is correct
62 Correct 576 ms 5380 KB Output is correct
63 Execution timed out 1056 ms 5364 KB Time limit exceeded
64 Halted 0 ms 0 KB -