oj.uz

Submission #601495

# Submission time Handle Problem Language Result Execution time Memory
601495 2022-07-22T05:57:12 Z narvalo Ferries (NOI13_ferries) C++17
40 / 40
 305 ms 29604 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

const int INF = (int)1e18;

int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n , m;
  cin >> n >> m;
  vector<vector<pair<int , int>>> adj(n) , rev(n);
  vector<vector<int>> edges(n);
  for (int i = 0 ; i < m ; i += 1) {
    int a , b , c;
    cin >> a >> b >> c; 
    a -= 1 , b -= 1;
    edges[a].push_back(c);
    adj[a].emplace_back(b , c);
    rev[b].emplace_back(a , c);
  }
  for (int i = 0 ; i < n ; i += 1) {
    sort(edges[i].begin() , edges[i].end());
  }
  #define pi pair<int , int>
  priority_queue<pi , vector<pi> , greater<pi>> pq;
  vector<int> d(n , INF);
  d[n - 1] = 0;
  pq.emplace(d[n - 1] , n - 1);
  while (!pq.empty()) {
    auto t = pq.top();
    pq.pop();
    if (d[t.second] != t.first) continue;
    for (int i = 0 ; i < (int)rev[t.second].size() ; i += 1) {
      auto node = rev[t.second][i];
      if (d[node.first] > t.first + edges[node.first].back()) {
        d[node.first] = t.first + edges[node.first].back();
        pq.emplace(d[node.first] , node.first);
      }
      edges[node.first].pop_back();
    }
  }
  cout << d[0] << '\n';
  return 0; 
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 9 ms 2764 KB Output is correct
4 Correct 101 ms 24536 KB Output is correct
5 Correct 101 ms 24416 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 9 ms 2668 KB Output is correct
4 Correct 45 ms 12408 KB Output is correct
5 Correct 99 ms 18508 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3156 KB Output is correct
2 Correct 14 ms 3156 KB Output is correct
3 Correct 260 ms 28420 KB Output is correct
4 Correct 286 ms 28812 KB Output is correct
5 Correct 260 ms 28736 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 28536 KB Output is correct
2 Correct 294 ms 28592 KB Output is correct
3 Correct 305 ms 29604 KB Output is correct
4 Correct 287 ms 29564 KB Output is correct
5 Correct 305 ms 29588 KB Output is correct