oj.uz

Submission #752243

# Submission time Handle Problem Language Result Execution time Memory
752243 2023-06-02T15:05:48 Z tch1cherin Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 12764 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define Get(x, i, j) (x[i].empty() ? x.back()[j] : x[i][j])
#include <bits/stdc++.h>
using namespace std;
 
template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
 
struct edge {
  int from, to, weight, cost, id;
 
  edge() {}
 
  edge(int _from, int _to, int _weight, int _cost, int _id) : from(_from), to(_to), weight(_weight), cost(_cost), id(_id) {}
};
 
struct node {
  int distance, parent;
 
  node() {
    distance = INT_MAX;
    parent = -1;
  }
 
  node(int _distance, int _parent) : distance(_distance), parent(_parent) {}
};
 
vector<node> dijkstra(vector<vector<edge>> graph, int start) {
  int n = (int)graph.size();
  vector<node> answer(n);
  min_heap<pair<int, int>> q;
  q.emplace(0, start);
  answer[start].distance = 0;
  while (!q.empty()) {
    auto [d, u] = q.top();
    q.pop();
    if (answer[u].distance > d) {
      continue;
    }
    for (auto [from, to, weight, cost, id] : graph[u]) {
      if (answer[from].distance + weight < answer[to].distance) {
        answer[to] = node(answer[from].distance + weight, id);
        q.emplace(answer[to].distance, to);
      }
    }
  }
  return answer;
}
 
vector<vector<edge>> transpose(vector<vector<edge>> graph) {
  int n = (int)graph.size();
  vector<vector<edge>> new_graph(n);
  for (int u = 0; u < n; u++) {
    for (auto [from, to, weight, cost, id] : graph[u]) {
      new_graph[to].emplace_back(to, from, weight, cost, id);
    }
  }
  return new_graph;
}
 
vector<vector<int>> find_shortest_paths_without_each_edge(vector<vector<edge>> graph, int start) {
  int n = (int)graph.size();
  int m = 0;
  for (int u = 0; u < n; u++) {
    for (auto [from, to, weight, cost, id] : graph[u]) {
      m = max(m, 1 + id);
    }
  }
  vector<node> result = dijkstra(graph, start);
  vector<int> dist(n);
  for (int i = 0; i < n; i++) {
    dist[i] = result[i].distance;
  }
  vector<vector<int>> answer(m);
  vector<int> special;
  for (auto [distance, parent] : result) {
    if (parent != -1) {
      special.push_back(parent);
      vector<vector<edge>> new_graph = graph;
      for (int u = 0; u < n; u++) {
        for (int i = 0; i < (int)new_graph[u].size(); i++) {
          auto [from, to, weight, cost, id] = new_graph[u][i];
          if (id == parent) {
            new_graph[u].erase(new_graph[u].begin() + i);
            break;
          }  
        }
      }
      vector<node> new_result = dijkstra(new_graph, start);
      answer[parent] = vector<int>(n);
      for (int i = 0; i < n; i++) {
        answer[parent][i] = new_result[i].distance;  
      }
    }
  }
  answer.push_back(dist);
  return answer;
}
 
void solve() {
  int n, m;
  cin >> n >> m;
  vector<vector<edge>> graph(n);
  for (int i = 0; i < m; i++) {
    int from, to, weight, cost;
    cin >> from >> to >> weight >> cost;
    from--, to--;
    graph[from].emplace_back(from, to, weight, cost, i);
  }
  vector<vector<edge>> rev_graph = transpose(graph);
  vector<vector<int>> result_a = find_shortest_paths_without_each_edge(graph, 0);
  vector<vector<int>> result_b = find_shortest_paths_without_each_edge(graph, n - 1);
  vector<vector<int>> rev_result_a = find_shortest_paths_without_each_edge(rev_graph, 0);
  vector<vector<int>> rev_result_b = find_shortest_paths_without_each_edge(rev_graph, n - 1);
  int ans = INT_MAX;
  if (result_a.back()[n - 1] != INT_MAX && result_b.back()[0] != INT_MAX) {
    ans = result_a.back()[n - 1] + result_b.back()[0];
  }
  for (int u = 0; u < n; u++) {
    for (auto [from, to, weight, cost, id] : graph[u]) {
      int AB = INT_MAX, BA = INT_MAX;
      AB = min(AB, Get(result_a, id, n - 1));
      if (Get(result_a, id, to) != INT_MAX && Get(rev_result_b, id, from) != INT_MAX) {
        AB = min(AB, Get(result_a, id, to) + Get(rev_result_b, id, from) + weight);
      }
      BA = min(BA, Get(result_b, id, 0));
      if (Get(result_b, id, to) != INT_MAX && Get(rev_result_a, id, from) != INT_MAX) {
        BA = min(BA, Get(result_b, id, to) + Get(rev_result_a, id, from) + weight); 
      }
      if (AB == INT_MAX || BA == INT_MAX) {
        continue;
      }
      ans = min(ans, AB + BA + cost);
    }
  }
  cout << (ans == INT_MAX ? -1 : ans) << "\n";
}
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 1156 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 50 ms 1188 KB Output is correct
4 Correct 49 ms 1132 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 5 ms 468 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 60 ms 1148 KB Output is correct
11 Correct 54 ms 1140 KB Output is correct
12 Correct 52 ms 1152 KB Output is correct
13 Correct 16 ms 852 KB Output is correct
14 Correct 33 ms 1068 KB Output is correct
15 Correct 31 ms 1052 KB Output is correct
16 Correct 34 ms 952 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 12592 KB Output is correct
2 Correct 604 ms 12764 KB Output is correct
3 Correct 625 ms 12624 KB Output is correct
4 Correct 43 ms 1392 KB Output is correct
5 Correct 28 ms 1140 KB Output is correct
6 Correct 8 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 192 ms 12464 KB Output is correct
10 Correct 204 ms 12416 KB Output is correct
11 Correct 410 ms 12388 KB Output is correct
12 Correct 530 ms 12360 KB Output is correct
13 Correct 479 ms 12284 KB Output is correct
14 Correct 464 ms 12724 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1168 KB Output is correct
2 Correct 10 ms 564 KB Output is correct
3 Correct 294 ms 9980 KB Output is correct
4 Correct 9 ms 488 KB Output is correct
5 Correct 386 ms 12424 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 219 ms 12432 KB Output is correct
9 Correct 178 ms 12464 KB Output is correct
10 Correct 293 ms 12220 KB Output is correct
11 Correct 244 ms 12316 KB Output is correct
12 Correct 257 ms 12644 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 276 ms 12692 KB Output is correct
20 Correct 252 ms 12376 KB Output is correct
21 Correct 256 ms 12428 KB Output is correct
22 Correct 253 ms 12284 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 1156 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 50 ms 1188 KB Output is correct
4 Correct 49 ms 1132 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 5 ms 468 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 60 ms 1148 KB Output is correct
11 Correct 54 ms 1140 KB Output is correct
12 Correct 52 ms 1152 KB Output is correct
13 Correct 16 ms 852 KB Output is correct
14 Correct 33 ms 1068 KB Output is correct
15 Correct 31 ms 1052 KB Output is correct
16 Correct 34 ms 952 KB Output is correct
17 Correct 597 ms 12592 KB Output is correct
18 Correct 604 ms 12764 KB Output is correct
19 Correct 625 ms 12624 KB Output is correct
20 Correct 43 ms 1392 KB Output is correct
21 Correct 28 ms 1140 KB Output is correct
22 Correct 8 ms 596 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 192 ms 12464 KB Output is correct
26 Correct 204 ms 12416 KB Output is correct
27 Correct 410 ms 12388 KB Output is correct
28 Correct 530 ms 12360 KB Output is correct
29 Correct 479 ms 12284 KB Output is correct
30 Correct 464 ms 12724 KB Output is correct
31 Correct 48 ms 1168 KB Output is correct
32 Correct 10 ms 564 KB Output is correct
33 Correct 294 ms 9980 KB Output is correct
34 Correct 9 ms 488 KB Output is correct
35 Correct 386 ms 12424 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 219 ms 12432 KB Output is correct
39 Correct 178 ms 12464 KB Output is correct
40 Correct 293 ms 12220 KB Output is correct
41 Correct 244 ms 12316 KB Output is correct
42 Correct 257 ms 12644 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 276 ms 12692 KB Output is correct
50 Correct 252 ms 12376 KB Output is correct
51 Correct 256 ms 12428 KB Output is correct
52 Correct 253 ms 12284 KB Output is correct
53 Correct 695 ms 12616 KB Output is correct
54 Correct 717 ms 12420 KB Output is correct
55 Correct 702 ms 12700 KB Output is correct
56 Correct 45 ms 1228 KB Output is correct
57 Correct 46 ms 1220 KB Output is correct
58 Correct 593 ms 10040 KB Output is correct
59 Correct 645 ms 10096 KB Output is correct
60 Correct 579 ms 10056 KB Output is correct
61 Correct 550 ms 10084 KB Output is correct
62 Correct 548 ms 10204 KB Output is correct
63 Correct 583 ms 10208 KB Output is correct
64 Execution timed out 1071 ms 6444 KB Time limit exceeded
65 Halted 0 ms 0 KB -