oj.uz

Submission #897654

# Submission time Handle Problem Language Result Execution time Memory
897654 2024-01-03T14:22:06 Z avighna Olympic Bus (JOI20_ho_t4) C++17
5 / 100
 1000 ms 5192 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();
  }
  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};
  }

  ll ans = 1e15;
  ans = min(ans, sssp(1)[n] + sssp(n)[1]);
  for (ll i = 0; i < m; ++i) {
    adj[edges[i].first].erase(adj[edges[i].first].find({edges[i].second, i}));
    adj[edges[i].second].insert({edges[i].first, i});
    ans = min(ans, d[i] + sssp(1)[n] + sssp(n)[1]);
    adj[edges[i].second].erase(adj[edges[i].second].find({edges[i].first, i}));
    adj[edges[i].first].insert({edges[i].second, i});
  }
  if (ans == (ll)(1e15)) {
    ans = -1;
  }
  cout << ans << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 48 ms 560 KB Output is correct
4 Correct 55 ms 348 KB Output is correct
5 Correct 44 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 99 ms 564 KB Output is correct
11 Correct 82 ms 348 KB Output is correct
12 Correct 82 ms 556 KB Output is correct
13 Correct 23 ms 600 KB Output is correct
14 Correct 31 ms 348 KB Output is correct
15 Correct 30 ms 344 KB Output is correct
16 Correct 31 ms 344 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1053 ms 5192 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Execution timed out 1094 ms 3944 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 48 ms 560 KB Output is correct
4 Correct 55 ms 348 KB Output is correct
5 Correct 44 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 99 ms 564 KB Output is correct
11 Correct 82 ms 348 KB Output is correct
12 Correct 82 ms 556 KB Output is correct
13 Correct 23 ms 600 KB Output is correct
14 Correct 31 ms 348 KB Output is correct
15 Correct 30 ms 344 KB Output is correct
16 Correct 31 ms 344 KB Output is correct
17 Execution timed out 1053 ms 5192 KB Time limit exceeded
18 Halted 0 ms 0 KB -