oj.uz

Submission #897926

# Submission time Handle Problem Language Result Execution time Memory
897926 2024-01-04T04:59:12 Z avighna Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 5312 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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 860 KB Output is correct
2 Correct 7 ms 820 KB Output is correct
3 Correct 7 ms 896 KB Output is correct
4 Correct 7 ms 856 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 12 ms 856 KB Output is correct
11 Correct 31 ms 900 KB Output is correct
12 Correct 8 ms 860 KB Output is correct
13 Correct 8 ms 896 KB Output is correct
14 Correct 7 ms 860 KB Output is correct
15 Correct 8 ms 860 KB Output is correct
16 Correct 8 ms 860 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 4956 KB Output is correct
2 Correct 27 ms 4852 KB Output is correct
3 Correct 21 ms 4956 KB Output is correct
4 Correct 8 ms 992 KB Output is correct
5 Correct 8 ms 892 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 8 ms 1112 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 63 ms 4956 KB Output is correct
10 Correct 44 ms 5164 KB Output is correct
11 Correct 28 ms 4956 KB Output is correct
12 Correct 29 ms 4952 KB Output is correct
13 Correct 25 ms 4956 KB Output is correct
14 Correct 26 ms 5212 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 860 KB Output is correct
2 Correct 7 ms 600 KB Output is correct
3 Correct 17 ms 3932 KB Output is correct
4 Correct 7 ms 604 KB Output is correct
5 Correct 20 ms 4900 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 34 ms 4952 KB Output is correct
9 Correct 39 ms 5208 KB Output is correct
10 Correct 20 ms 4952 KB Output is correct
11 Correct 26 ms 5060 KB Output is correct
12 Correct 20 ms 5212 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 21 ms 5312 KB Output is correct
20 Correct 23 ms 5080 KB Output is correct
21 Correct 21 ms 5212 KB Output is correct
22 Correct 22 ms 4956 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 860 KB Output is correct
2 Correct 7 ms 820 KB Output is correct
3 Correct 7 ms 896 KB Output is correct
4 Correct 7 ms 856 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 12 ms 856 KB Output is correct
11 Correct 31 ms 900 KB Output is correct
12 Correct 8 ms 860 KB Output is correct
13 Correct 8 ms 896 KB Output is correct
14 Correct 7 ms 860 KB Output is correct
15 Correct 8 ms 860 KB Output is correct
16 Correct 8 ms 860 KB Output is correct
17 Correct 20 ms 4956 KB Output is correct
18 Correct 27 ms 4852 KB Output is correct
19 Correct 21 ms 4956 KB Output is correct
20 Correct 8 ms 992 KB Output is correct
21 Correct 8 ms 892 KB Output is correct
22 Correct 8 ms 604 KB Output is correct
23 Correct 8 ms 1112 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 63 ms 4956 KB Output is correct
26 Correct 44 ms 5164 KB Output is correct
27 Correct 28 ms 4956 KB Output is correct
28 Correct 29 ms 4952 KB Output is correct
29 Correct 25 ms 4956 KB Output is correct
30 Correct 26 ms 5212 KB Output is correct
31 Correct 8 ms 860 KB Output is correct
32 Correct 7 ms 600 KB Output is correct
33 Correct 17 ms 3932 KB Output is correct
34 Correct 7 ms 604 KB Output is correct
35 Correct 20 ms 4900 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 34 ms 4952 KB Output is correct
39 Correct 39 ms 5208 KB Output is correct
40 Correct 20 ms 4952 KB Output is correct
41 Correct 26 ms 5060 KB Output is correct
42 Correct 20 ms 5212 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 21 ms 5312 KB Output is correct
50 Correct 23 ms 5080 KB Output is correct
51 Correct 21 ms 5212 KB Output is correct
52 Correct 22 ms 4956 KB Output is correct
53 Correct 20 ms 4956 KB Output is correct
54 Correct 23 ms 5244 KB Output is correct
55 Correct 19 ms 4956 KB Output is correct
56 Correct 7 ms 860 KB Output is correct
57 Correct 7 ms 900 KB Output is correct
58 Correct 46 ms 4188 KB Output is correct
59 Correct 49 ms 4184 KB Output is correct
60 Correct 70 ms 4188 KB Output is correct
61 Correct 54 ms 4184 KB Output is correct
62 Correct 454 ms 3928 KB Output is correct
63 Execution timed out 1035 ms 4184 KB Time limit exceeded
64 Halted 0 ms 0 KB -