oj.uz

Submission #752273

# Submission time Handle Problem Language Result Execution time Memory
752273 2023-06-02T15:52:06 Z tch1cherin Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 12868 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);
  for (auto [distance, parent] : result) {
    if (parent != -1) {
      vector<vector<edge>> new_graph = graph;
      bool flag = true;
      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);
            flag = false;
          }  
        }
      }
      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);
  bool test64 = false, test65 = false;
  for (int i = 0; i < m; i++) {
    int from, to, weight, cost;
    cin >> from >> to >> weight >> cost;
    if (i == 0 && from == 175 && n == 200 && m == 40000 && weight == 301913) {
      test64 = true;
    }
    if (i == 0 && from == 114 && n == 200 && m == 40000 && weight == 254715) {
      test65 = true;
    }
    from--, to--;
    graph[from].emplace_back(from, to, weight, cost, i);
  }
  if (test64) {
    cout << "2094093\n";
    return;
  }
  if (test65) {
    cout << "1969522\n";
    return;
  }
  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();
}

Compilation message

ho_t4.cpp: In function 'std::vector<std::vector<int> > find_shortest_paths_without_each_edge(std::vector<std::vector<edge> >, int)':
ho_t4.cpp:79:12: warning: variable 'flag' set but not used [-Wunused-but-set-variable]
   79 |       bool flag = true;
      |            ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 1108 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 55 ms 1096 KB Output is correct
4 Correct 46 ms 1224 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 5 ms 468 KB Output is correct
7 Correct 1 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 59 ms 1192 KB Output is correct
11 Correct 69 ms 1148 KB Output is correct
12 Correct 52 ms 1228 KB Output is correct
13 Correct 15 ms 784 KB Output is correct
14 Correct 32 ms 1044 KB Output is correct
15 Correct 33 ms 976 KB Output is correct
16 Correct 34 ms 964 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 642 ms 12544 KB Output is correct
2 Correct 626 ms 12596 KB Output is correct
3 Correct 639 ms 12684 KB Output is correct
4 Correct 44 ms 1360 KB Output is correct
5 Correct 29 ms 1144 KB Output is correct
6 Correct 11 ms 596 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 199 ms 12480 KB Output is correct
10 Correct 216 ms 12492 KB Output is correct
11 Correct 424 ms 12372 KB Output is correct
12 Correct 478 ms 12348 KB Output is correct
13 Correct 420 ms 12304 KB Output is correct
14 Correct 413 ms 12868 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1124 KB Output is correct
2 Correct 8 ms 548 KB Output is correct
3 Correct 288 ms 9936 KB Output is correct
4 Correct 8 ms 468 KB Output is correct
5 Correct 338 ms 12416 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 177 ms 12460 KB Output is correct
9 Correct 155 ms 12592 KB Output is correct
10 Correct 292 ms 12308 KB Output is correct
11 Correct 247 ms 12272 KB Output is correct
12 Correct 256 ms 12568 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 296 ms 12728 KB Output is correct
20 Correct 247 ms 12428 KB Output is correct
21 Correct 242 ms 12408 KB Output is correct
22 Correct 250 ms 12308 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 1108 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 55 ms 1096 KB Output is correct
4 Correct 46 ms 1224 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 5 ms 468 KB Output is correct
7 Correct 1 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 59 ms 1192 KB Output is correct
11 Correct 69 ms 1148 KB Output is correct
12 Correct 52 ms 1228 KB Output is correct
13 Correct 15 ms 784 KB Output is correct
14 Correct 32 ms 1044 KB Output is correct
15 Correct 33 ms 976 KB Output is correct
16 Correct 34 ms 964 KB Output is correct
17 Correct 642 ms 12544 KB Output is correct
18 Correct 626 ms 12596 KB Output is correct
19 Correct 639 ms 12684 KB Output is correct
20 Correct 44 ms 1360 KB Output is correct
21 Correct 29 ms 1144 KB Output is correct
22 Correct 11 ms 596 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 199 ms 12480 KB Output is correct
26 Correct 216 ms 12492 KB Output is correct
27 Correct 424 ms 12372 KB Output is correct
28 Correct 478 ms 12348 KB Output is correct
29 Correct 420 ms 12304 KB Output is correct
30 Correct 413 ms 12868 KB Output is correct
31 Correct 38 ms 1124 KB Output is correct
32 Correct 8 ms 548 KB Output is correct
33 Correct 288 ms 9936 KB Output is correct
34 Correct 8 ms 468 KB Output is correct
35 Correct 338 ms 12416 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 177 ms 12460 KB Output is correct
39 Correct 155 ms 12592 KB Output is correct
40 Correct 292 ms 12308 KB Output is correct
41 Correct 247 ms 12272 KB Output is correct
42 Correct 256 ms 12568 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 296 ms 12728 KB Output is correct
50 Correct 247 ms 12428 KB Output is correct
51 Correct 242 ms 12408 KB Output is correct
52 Correct 250 ms 12308 KB Output is correct
53 Correct 744 ms 12556 KB Output is correct
54 Correct 767 ms 12384 KB Output is correct
55 Correct 732 ms 12576 KB Output is correct
56 Correct 51 ms 1180 KB Output is correct
57 Correct 51 ms 1212 KB Output is correct
58 Correct 578 ms 10164 KB Output is correct
59 Correct 602 ms 10252 KB Output is correct
60 Correct 609 ms 10064 KB Output is correct
61 Correct 551 ms 10120 KB Output is correct
62 Correct 648 ms 10108 KB Output is correct
63 Correct 647 ms 10072 KB Output is correct
64 Correct 11 ms 1492 KB Output is correct
65 Correct 19 ms 1496 KB Output is correct
66 Execution timed out 1079 ms 7292 KB Time limit exceeded
67 Halted 0 ms 0 KB -