oj.uz

Submission #752234

# Submission time Handle Problem Language Result Execution time Memory
752234 2023-06-02T14:32:54 Z tch1cherin Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 13936 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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) {}
};

struct result {
  int edge;
  vector<int> distances; 
};

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);
  auto get = [](vector<vector<int>>& x, int i, int j) {
    if (x[i].empty()) {
      return x.back()[j];
    } else {
      return x[i][j];
    }
  };
  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 43 ms 1112 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 49 ms 1228 KB Output is correct
4 Correct 64 ms 1160 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 6 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 61 ms 1232 KB Output is correct
11 Correct 54 ms 1200 KB Output is correct
12 Correct 56 ms 1192 KB Output is correct
13 Correct 18 ms 852 KB Output is correct
14 Correct 35 ms 1020 KB Output is correct
15 Correct 33 ms 1000 KB Output is correct
16 Correct 42 ms 1012 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 643 ms 13808 KB Output is correct
2 Correct 656 ms 13560 KB Output is correct
3 Correct 630 ms 13772 KB Output is correct
4 Correct 46 ms 1472 KB Output is correct
5 Correct 29 ms 1160 KB Output is correct
6 Correct 9 ms 712 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 262 ms 13640 KB Output is correct
10 Correct 194 ms 13644 KB Output is correct
11 Correct 421 ms 13532 KB Output is correct
12 Correct 509 ms 13620 KB Output is correct
13 Correct 430 ms 13456 KB Output is correct
14 Correct 447 ms 13936 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1136 KB Output is correct
2 Correct 9 ms 596 KB Output is correct
3 Correct 292 ms 10736 KB Output is correct
4 Correct 8 ms 480 KB Output is correct
5 Correct 382 ms 13324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 180 ms 13388 KB Output is correct
9 Correct 171 ms 13516 KB Output is correct
10 Correct 276 ms 13276 KB Output is correct
11 Correct 234 ms 13208 KB Output is correct
12 Correct 271 ms 13452 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 237 ms 13684 KB Output is correct
20 Correct 224 ms 13476 KB Output is correct
21 Correct 256 ms 13256 KB Output is correct
22 Correct 287 ms 13244 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1112 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 49 ms 1228 KB Output is correct
4 Correct 64 ms 1160 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 6 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 61 ms 1232 KB Output is correct
11 Correct 54 ms 1200 KB Output is correct
12 Correct 56 ms 1192 KB Output is correct
13 Correct 18 ms 852 KB Output is correct
14 Correct 35 ms 1020 KB Output is correct
15 Correct 33 ms 1000 KB Output is correct
16 Correct 42 ms 1012 KB Output is correct
17 Correct 643 ms 13808 KB Output is correct
18 Correct 656 ms 13560 KB Output is correct
19 Correct 630 ms 13772 KB Output is correct
20 Correct 46 ms 1472 KB Output is correct
21 Correct 29 ms 1160 KB Output is correct
22 Correct 9 ms 712 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 262 ms 13640 KB Output is correct
26 Correct 194 ms 13644 KB Output is correct
27 Correct 421 ms 13532 KB Output is correct
28 Correct 509 ms 13620 KB Output is correct
29 Correct 430 ms 13456 KB Output is correct
30 Correct 447 ms 13936 KB Output is correct
31 Correct 46 ms 1136 KB Output is correct
32 Correct 9 ms 596 KB Output is correct
33 Correct 292 ms 10736 KB Output is correct
34 Correct 8 ms 480 KB Output is correct
35 Correct 382 ms 13324 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 180 ms 13388 KB Output is correct
39 Correct 171 ms 13516 KB Output is correct
40 Correct 276 ms 13276 KB Output is correct
41 Correct 234 ms 13208 KB Output is correct
42 Correct 271 ms 13452 KB Output is correct
43 Correct 1 ms 320 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 320 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 237 ms 13684 KB Output is correct
50 Correct 224 ms 13476 KB Output is correct
51 Correct 256 ms 13256 KB Output is correct
52 Correct 287 ms 13244 KB Output is correct
53 Correct 745 ms 13472 KB Output is correct
54 Correct 911 ms 13384 KB Output is correct
55 Correct 844 ms 13528 KB Output is correct
56 Correct 47 ms 1204 KB Output is correct
57 Correct 63 ms 1188 KB Output is correct
58 Correct 584 ms 10868 KB Output is correct
59 Correct 652 ms 10924 KB Output is correct
60 Correct 691 ms 10952 KB Output is correct
61 Correct 571 ms 11052 KB Output is correct
62 Correct 621 ms 10920 KB Output is correct
63 Correct 627 ms 11008 KB Output is correct
64 Execution timed out 1062 ms 7132 KB Time limit exceeded
65 Halted 0 ms 0 KB -