oj.uz

Submission #752297

# Submission time Handle Problem Language Result Execution time Memory
752297 2023-06-02T16:57:41 Z tch1cherin Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 12844 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;
 
struct cmp {
  bool operator()(pair<int, int> a, pair<int, int> b) {
    return a.first > b.first;
  }
};

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);
  answer[start].distance = 0;
  priority_queue<pair<int, int>, vector<pair<int, int>>, cmp> q;
  q.emplace(0, start);
  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 && flag; u++) {
         for (int i = 0; i < (int)new_graph[u].size() && flag; 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();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1188 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 55 ms 1196 KB Output is correct
4 Correct 59 ms 1192 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 6 ms 548 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 58 ms 1232 KB Output is correct
11 Correct 58 ms 1152 KB Output is correct
12 Correct 61 ms 1184 KB Output is correct
13 Correct 17 ms 832 KB Output is correct
14 Correct 33 ms 980 KB Output is correct
15 Correct 35 ms 968 KB Output is correct
16 Correct 33 ms 1004 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 649 ms 12616 KB Output is correct
2 Correct 600 ms 12636 KB Output is correct
3 Correct 580 ms 12736 KB Output is correct
4 Correct 43 ms 1368 KB Output is correct
5 Correct 26 ms 1068 KB Output is correct
6 Correct 9 ms 720 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 181 ms 12440 KB Output is correct
10 Correct 183 ms 12400 KB Output is correct
11 Correct 402 ms 12332 KB Output is correct
12 Correct 423 ms 12388 KB Output is correct
13 Correct 420 ms 12288 KB Output is correct
14 Correct 394 ms 12844 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 1100 KB Output is correct
2 Correct 8 ms 596 KB Output is correct
3 Correct 236 ms 10040 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 292 ms 12544 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 157 ms 12464 KB Output is correct
9 Correct 147 ms 12488 KB Output is correct
10 Correct 233 ms 12516 KB Output is correct
11 Correct 194 ms 12244 KB Output is correct
12 Correct 198 ms 12508 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 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 251 ms 12680 KB Output is correct
20 Correct 212 ms 12412 KB Output is correct
21 Correct 207 ms 12384 KB Output is correct
22 Correct 200 ms 12328 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1188 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 55 ms 1196 KB Output is correct
4 Correct 59 ms 1192 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 6 ms 548 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 58 ms 1232 KB Output is correct
11 Correct 58 ms 1152 KB Output is correct
12 Correct 61 ms 1184 KB Output is correct
13 Correct 17 ms 832 KB Output is correct
14 Correct 33 ms 980 KB Output is correct
15 Correct 35 ms 968 KB Output is correct
16 Correct 33 ms 1004 KB Output is correct
17 Correct 649 ms 12616 KB Output is correct
18 Correct 600 ms 12636 KB Output is correct
19 Correct 580 ms 12736 KB Output is correct
20 Correct 43 ms 1368 KB Output is correct
21 Correct 26 ms 1068 KB Output is correct
22 Correct 9 ms 720 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 181 ms 12440 KB Output is correct
26 Correct 183 ms 12400 KB Output is correct
27 Correct 402 ms 12332 KB Output is correct
28 Correct 423 ms 12388 KB Output is correct
29 Correct 420 ms 12288 KB Output is correct
30 Correct 394 ms 12844 KB Output is correct
31 Correct 35 ms 1100 KB Output is correct
32 Correct 8 ms 596 KB Output is correct
33 Correct 236 ms 10040 KB Output is correct
34 Correct 5 ms 468 KB Output is correct
35 Correct 292 ms 12544 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 157 ms 12464 KB Output is correct
39 Correct 147 ms 12488 KB Output is correct
40 Correct 233 ms 12516 KB Output is correct
41 Correct 194 ms 12244 KB Output is correct
42 Correct 198 ms 12508 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 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 251 ms 12680 KB Output is correct
50 Correct 212 ms 12412 KB Output is correct
51 Correct 207 ms 12384 KB Output is correct
52 Correct 200 ms 12328 KB Output is correct
53 Correct 633 ms 12376 KB Output is correct
54 Correct 629 ms 12520 KB Output is correct
55 Correct 619 ms 12552 KB Output is correct
56 Correct 47 ms 1184 KB Output is correct
57 Correct 46 ms 1108 KB Output is correct
58 Correct 507 ms 10228 KB Output is correct
59 Correct 511 ms 10140 KB Output is correct
60 Correct 527 ms 10072 KB Output is correct
61 Correct 469 ms 10160 KB Output is correct
62 Correct 500 ms 10116 KB Output is correct
63 Correct 507 ms 10076 KB Output is correct
64 Correct 12 ms 1468 KB Output is correct
65 Correct 17 ms 1536 KB Output is correct
66 Execution timed out 1081 ms 6416 KB Time limit exceeded
67 Halted 0 ms 0 KB -