oj.uz

Submission #752321

# Submission time Handle Problem Language Result Execution time Memory
752321 2023-06-02T18:41:23 Z tch1cherin Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 158284 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt,fma")
#include <bits/stdc++.h>
using namespace std;

const int N = 200, M = 50000;
vector<int> graph[2][N];
int deg[N], rev_deg[N], path[N], dist[N], _from[M], _to[M], weight[M], cost[M];
int dist_w[4][M][N], dist_i[4][N];
int n, m;

int from(int g, int id) {
  return g == 0 ? _from[id] : _to[id];
}

int to(int g, int id) {
  return g == 0 ? _to[id] : _from[id];
}

void dijkstra(int start, int g, bool flag, int del = -1) {
  fill(dist, dist + n, INT_MAX);
  if (flag) fill(path, path + n, -1);
  dist[start] = 0;
  struct P {
      int t;
      int v;
      bool operator>(const P& x) const {
          return t == x.t ? v > x.v : t > x.t;
      }
      P(int _t, int _v) : t(_t), v(_v) {}
  };
  priority_queue<P, vector<P>, greater<P>> q;
  q.emplace(0, start);
  while (!q.empty()) {
    auto [d, u] = q.top();
    q.pop();
    if (dist[u] > d) {
      continue;
    }
    for (int e : graph[g][u]) {
      if (e != del && dist[u] + weight[e] < dist[to(g, e)]) {
        dist[to(g, e)] = dist[u] + weight[e];
        if (flag) path[to(g, e)] = e;
        q.emplace(dist[to(g, e)], to(g, e));
      }
    }
  }
}

void _solve(int g, int start, int it) {
  dijkstra(start, g, true);
  memcpy(dist_i[it], dist, sizeof dist);
  for (int i = 0; i < n; i++) {
    if (path[i] != -1) {
      dijkstra(start, g, false, path[i]);
      memcpy(dist_w[it][path[i]], dist, sizeof dist);
    }
  }
}

int Get(int it, int id, int u) {
  return dist_w[it][id][u] == -1 ? dist_i[it][u] : dist_w[it][id][u];
}

void solve() {
  cin >> n >> m;
  memset(dist_w, -1, sizeof dist_w);
  for (int i = 0; i < m; i++) {
    cin >> _from[i] >> _to[i] >> weight[i] >> cost[i];
    _from[i]--, _to[i]--;
    deg[_from[i]]++, rev_deg[_to[i]]++;
  }
  for (int i = 0; i < n; i++) {
    graph[0][i].reserve(deg[i]);
    graph[1][i].reserve(rev_deg[i]);
  }
  for (int i = 0; i < m; i++) {
    graph[0][_from[i]].push_back(i);
    graph[1][_to[i]].push_back(i);
  }
  _solve(0, 0, 0);
  _solve(0, n - 1, 1);
  _solve(1, 0, 2);
  _solve(1, n - 1, 3);
  int ans = INT_MAX;
  if (dist_i[0][n - 1] != INT_MAX && dist_i[1][0] != INT_MAX) {
    ans = dist_i[0][n - 1] + dist_i[1][0];
  }
  for (int u = 0; u < n; u++) {
    for (int id : graph[0][u]) {
      int AB = INT_MAX, BA = INT_MAX;
      AB = min(AB, Get(0, id, n - 1));
      if (Get(0, id, to(0, id)) != INT_MAX && Get(3, id, from(0, id)) != INT_MAX) {
        AB = min(AB, Get(0, id, to(0, id)) + Get(3, id, from(0, id)) + weight[id]);
      }
      BA = min(BA, Get(1, id, 0));
      if (Get(1, id, to(0, id)) != INT_MAX && Get(2, id, from(0, id)) != INT_MAX) {
        BA = min(BA, Get(1, id, to(0, id)) + Get(2, id, from(0, id)) + weight[id]); 
      }
      if (AB == INT_MAX || BA == INT_MAX) {
        continue;
      }
      ans = min(ans, AB + BA + cost[id]);
    }
  }
  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 79 ms 156884 KB Output is correct
2 Correct 71 ms 156808 KB Output is correct
3 Correct 81 ms 156928 KB Output is correct
4 Correct 83 ms 156924 KB Output is correct
5 Correct 69 ms 156876 KB Output is correct
6 Correct 61 ms 156880 KB Output is correct
7 Correct 61 ms 156820 KB Output is correct
8 Correct 61 ms 156796 KB Output is correct
9 Correct 63 ms 156896 KB Output is correct
10 Correct 91 ms 156848 KB Output is correct
11 Correct 110 ms 156932 KB Output is correct
12 Correct 90 ms 156924 KB Output is correct
13 Correct 64 ms 156840 KB Output is correct
14 Correct 71 ms 156884 KB Output is correct
15 Correct 71 ms 156972 KB Output is correct
16 Correct 73 ms 156932 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 673 ms 158076 KB Output is correct
2 Correct 545 ms 158064 KB Output is correct
3 Correct 549 ms 158068 KB Output is correct
4 Correct 94 ms 156844 KB Output is correct
5 Correct 77 ms 156868 KB Output is correct
6 Correct 64 ms 156796 KB Output is correct
7 Correct 59 ms 156820 KB Output is correct
8 Correct 60 ms 156812 KB Output is correct
9 Correct 187 ms 158056 KB Output is correct
10 Correct 179 ms 158060 KB Output is correct
11 Correct 376 ms 158060 KB Output is correct
12 Correct 382 ms 158116 KB Output is correct
13 Correct 391 ms 158056 KB Output is correct
14 Correct 410 ms 158092 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 156924 KB Output is correct
2 Correct 60 ms 156820 KB Output is correct
3 Correct 193 ms 157752 KB Output is correct
4 Correct 68 ms 156812 KB Output is correct
5 Correct 200 ms 157996 KB Output is correct
6 Correct 61 ms 156792 KB Output is correct
7 Correct 63 ms 156876 KB Output is correct
8 Correct 130 ms 158076 KB Output is correct
9 Correct 99 ms 158112 KB Output is correct
10 Correct 140 ms 158060 KB Output is correct
11 Correct 167 ms 158100 KB Output is correct
12 Correct 158 ms 158056 KB Output is correct
13 Correct 67 ms 156848 KB Output is correct
14 Correct 59 ms 156856 KB Output is correct
15 Correct 59 ms 156820 KB Output is correct
16 Correct 62 ms 156796 KB Output is correct
17 Correct 62 ms 156796 KB Output is correct
18 Correct 60 ms 156776 KB Output is correct
19 Correct 144 ms 158024 KB Output is correct
20 Correct 155 ms 158060 KB Output is correct
21 Correct 153 ms 158088 KB Output is correct
22 Correct 141 ms 158120 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 156884 KB Output is correct
2 Correct 71 ms 156808 KB Output is correct
3 Correct 81 ms 156928 KB Output is correct
4 Correct 83 ms 156924 KB Output is correct
5 Correct 69 ms 156876 KB Output is correct
6 Correct 61 ms 156880 KB Output is correct
7 Correct 61 ms 156820 KB Output is correct
8 Correct 61 ms 156796 KB Output is correct
9 Correct 63 ms 156896 KB Output is correct
10 Correct 91 ms 156848 KB Output is correct
11 Correct 110 ms 156932 KB Output is correct
12 Correct 90 ms 156924 KB Output is correct
13 Correct 64 ms 156840 KB Output is correct
14 Correct 71 ms 156884 KB Output is correct
15 Correct 71 ms 156972 KB Output is correct
16 Correct 73 ms 156932 KB Output is correct
17 Correct 673 ms 158076 KB Output is correct
18 Correct 545 ms 158064 KB Output is correct
19 Correct 549 ms 158068 KB Output is correct
20 Correct 94 ms 156844 KB Output is correct
21 Correct 77 ms 156868 KB Output is correct
22 Correct 64 ms 156796 KB Output is correct
23 Correct 59 ms 156820 KB Output is correct
24 Correct 60 ms 156812 KB Output is correct
25 Correct 187 ms 158056 KB Output is correct
26 Correct 179 ms 158060 KB Output is correct
27 Correct 376 ms 158060 KB Output is correct
28 Correct 382 ms 158116 KB Output is correct
29 Correct 391 ms 158056 KB Output is correct
30 Correct 410 ms 158092 KB Output is correct
31 Correct 70 ms 156924 KB Output is correct
32 Correct 60 ms 156820 KB Output is correct
33 Correct 193 ms 157752 KB Output is correct
34 Correct 68 ms 156812 KB Output is correct
35 Correct 200 ms 157996 KB Output is correct
36 Correct 61 ms 156792 KB Output is correct
37 Correct 63 ms 156876 KB Output is correct
38 Correct 130 ms 158076 KB Output is correct
39 Correct 99 ms 158112 KB Output is correct
40 Correct 140 ms 158060 KB Output is correct
41 Correct 167 ms 158100 KB Output is correct
42 Correct 158 ms 158056 KB Output is correct
43 Correct 67 ms 156848 KB Output is correct
44 Correct 59 ms 156856 KB Output is correct
45 Correct 59 ms 156820 KB Output is correct
46 Correct 62 ms 156796 KB Output is correct
47 Correct 62 ms 156796 KB Output is correct
48 Correct 60 ms 156776 KB Output is correct
49 Correct 144 ms 158024 KB Output is correct
50 Correct 155 ms 158060 KB Output is correct
51 Correct 153 ms 158088 KB Output is correct
52 Correct 141 ms 158120 KB Output is correct
53 Correct 650 ms 158068 KB Output is correct
54 Correct 785 ms 158068 KB Output is correct
55 Correct 687 ms 158064 KB Output is correct
56 Correct 80 ms 156916 KB Output is correct
57 Correct 81 ms 156812 KB Output is correct
58 Correct 652 ms 157848 KB Output is correct
59 Correct 648 ms 157848 KB Output is correct
60 Correct 575 ms 157968 KB Output is correct
61 Correct 505 ms 157876 KB Output is correct
62 Correct 539 ms 157856 KB Output is correct
63 Correct 547 ms 157800 KB Output is correct
64 Execution timed out 1066 ms 158284 KB Time limit exceeded
65 Halted 0 ms 0 KB -