oj.uz

Submission #827567

# Submission time Handle Problem Language Result Execution time Memory
827567 2023-08-16T14:47:49 Z taher Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 5568 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "C:\GCC\debug.h"
#else
#define debug(...) void(42)
#endif

const long long inf = 123165465792545;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n, m;
  cin >> n >> m;
  vector<vector<array<int, 4>>> adj(n);
  vector<vector<array<int, 4>>> inv(n);
  vector<array<int, 4>> edges;
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    int c, d;
    cin >> c >> d;
    --u, --v;
    adj[u].push_back({v, c, d, i});
    inv[v].push_back({u, c, d, i});
    edges.push_back({u, v, c, d});
  }

  array<int, 2> perm;
  perm[0] = 0;
  perm[1] = n - 1;
  vector<vector<long long>> d2(n, vector<long long> (n, inf));
  vector<vector<long long>> d1(n, vector<long long> (n, inf));

  auto Floyd = [&]() {
    for (int i = 0; i < n; i++) {
      d2[i][i] = 0;
      d1[i][i] = 0;
    }
    for (int i = 0; i < n; i++) {
      for (auto v : adj[i]) {
        d2[i][v[0]] = min(d2[i][v[0]], 1LL * v[1]);
        d1[i][v[0]] = min(d1[i][v[0]], 1LL * (v[1] + 1));
      }
    }
    for (int k = 0; k < n; k++) {
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
          d2[i][j] = min(d2[i][j], d2[i][k] + d2[k][j]);
          d1[i][j] = min(d1[i][j], d1[i][k] + d1[k][j]);
        }
      }
    }
  };

  Floyd();
  auto Update = [&](int forbidden, int source, int to, int cost) {
    vector<long long> dist(n, inf);
    dist[perm[1]] = 0;
    priority_queue<array<long long, 2>, vector<array<long long, 2>>, greater<array<long long, 2>>> que;
    que.push({0, perm[1]});

    while (!que.empty()) {
      auto cur = que.top();
      que.pop();

      if (dist[cur[1]] != cur[0]) {
        continue;
      }

      if (cur[1] == source) {
        if (dist[to] > 1LL * cur[0] + cost) {
          dist[to] = 1LL * cur[0] + cost;
          que.push({dist[to], to});
        }
      }

      for (auto v : adj[cur[1]]) {
        if (v[3] == forbidden) {
          continue;      
        } else {
          if (dist[v[0]] > cur[0] + v[1]) {
            dist[v[0]] = cur[0] + v[1];
            que.push({dist[v[0]], v[0]});
          }
        }
      }
    }
    return dist[perm[0]];
  };

  vector<int> cntA(n);
  vector<int> cntB(n);
  vector<int> middleA(n, -1);
  vector<int> middleB(n, -1);
  for (int i = 0; i < n; i++) {
    for (auto v : inv[i]) {
      if (d1[perm[0]][v[0]] + (v[1] + 1) == d1[perm[0]][i]) {
        cntA[i]++;
        middleA[i] = v[0];
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (auto v : adj[i]) {
      if (d1[v[0]][perm[1]] + (v[1] + 1) == d1[i][perm[1]]) {
        cntB[i]++;
        middleB[i] = v[0];
      }
    }
  }

  vector<int> cntC(n);
  vector<int> cntD(n);
  vector<int> middleC(n, -1);
  vector<int> middleD(n, -1);
  for (int i = 0; i < n; i++) {
    for (auto v : inv[i]) {
      if (d1[perm[1]][v[0]] + (v[1] + 1) == d1[perm[1]][i]) {
        cntC[i]++;
        middleC[i] = v[0];
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (auto v : adj[i]) {
      if (d1[v[0]][perm[0]] + (v[1] + 1) == d1[i][perm[0]]) {
        cntD[i]++;
        middleD[i] = v[0];
      }
    }
  }

  long long res = inf;
  res = min(res, d2[perm[0]][perm[1]] + d2[perm[1]][perm[0]]);
  for (int i = 0; i < m; i++) {
    int u = edges[i][0];
    int v = edges[i][1];
    int c = edges[i][2];
    int d = edges[i][3];

    long long path_from_beg = 0;

    bool canA = true;
    bool canB = true;

    canA &= (cntA[v] > 1 || middleA[v] != u);
    canB &= (cntB[u] > 1 || middleB[u] != v);

    if (canA && canB) {
      path_from_beg = min(d2[perm[0]][perm[1]], d2[perm[0]][v] + d2[u][perm[1]] + c);
    } else {
      swap(perm[0], perm[1]);
      path_from_beg = Update(i, v, u, c);
      swap(perm[0], perm[1]);
    }

    canA = true;
    canB = true;

    canA &= (cntC[v] > 1 || middleC[v] != u);
    canB &= (cntD[u] > 1 || middleD[u] != v);

    long long path_from_end = 0;
    if (canA && canB) {
      path_from_end = min(d2[perm[1]][perm[0]], d2[perm[1]][v] + d2[u][perm[0]] + c);
    } else {
      path_from_end = Update(i, v, u, c);
    }

    long long tot = path_from_beg + path_from_end + d;
    res = min(res, tot);
  }

  if (res == inf) {
    cout << -1 << '\n';
  } else {
    cout << res << '\n';
  }
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1084 KB Output is correct
2 Correct 14 ms 1000 KB Output is correct
3 Correct 26 ms 1068 KB Output is correct
4 Correct 28 ms 1076 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 12 ms 980 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 25 ms 1064 KB Output is correct
11 Correct 24 ms 980 KB Output is correct
12 Correct 26 ms 1060 KB Output is correct
13 Correct 14 ms 980 KB Output is correct
14 Correct 20 ms 980 KB Output is correct
15 Correct 18 ms 1064 KB Output is correct
16 Correct 20 ms 1072 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5052 KB Output is correct
2 Correct 26 ms 5064 KB Output is correct
3 Correct 26 ms 5248 KB Output is correct
4 Correct 12 ms 1108 KB Output is correct
5 Correct 12 ms 1060 KB Output is correct
6 Correct 11 ms 980 KB Output is correct
7 Correct 11 ms 980 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 27 ms 5400 KB Output is correct
10 Correct 27 ms 5268 KB Output is correct
11 Correct 28 ms 5192 KB Output is correct
12 Correct 29 ms 5228 KB Output is correct
13 Correct 27 ms 5192 KB Output is correct
14 Correct 27 ms 5568 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1068 KB Output is correct
2 Correct 12 ms 912 KB Output is correct
3 Correct 41 ms 3900 KB Output is correct
4 Correct 11 ms 1000 KB Output is correct
5 Correct 45 ms 4912 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 29 ms 5052 KB Output is correct
9 Correct 31 ms 5096 KB Output is correct
10 Correct 34 ms 4980 KB Output is correct
11 Correct 33 ms 4936 KB Output is correct
12 Correct 34 ms 5064 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 0 ms 316 KB Output is correct
16 Correct 0 ms 320 KB Output is correct
17 Correct 0 ms 316 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 31 ms 5168 KB Output is correct
20 Correct 33 ms 4908 KB Output is correct
21 Correct 34 ms 4908 KB Output is correct
22 Correct 31 ms 4936 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1084 KB Output is correct
2 Correct 14 ms 1000 KB Output is correct
3 Correct 26 ms 1068 KB Output is correct
4 Correct 28 ms 1076 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 12 ms 980 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 25 ms 1064 KB Output is correct
11 Correct 24 ms 980 KB Output is correct
12 Correct 26 ms 1060 KB Output is correct
13 Correct 14 ms 980 KB Output is correct
14 Correct 20 ms 980 KB Output is correct
15 Correct 18 ms 1064 KB Output is correct
16 Correct 20 ms 1072 KB Output is correct
17 Correct 27 ms 5052 KB Output is correct
18 Correct 26 ms 5064 KB Output is correct
19 Correct 26 ms 5248 KB Output is correct
20 Correct 12 ms 1108 KB Output is correct
21 Correct 12 ms 1060 KB Output is correct
22 Correct 11 ms 980 KB Output is correct
23 Correct 11 ms 980 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 27 ms 5400 KB Output is correct
26 Correct 27 ms 5268 KB Output is correct
27 Correct 28 ms 5192 KB Output is correct
28 Correct 29 ms 5228 KB Output is correct
29 Correct 27 ms 5192 KB Output is correct
30 Correct 27 ms 5568 KB Output is correct
31 Correct 17 ms 1068 KB Output is correct
32 Correct 12 ms 912 KB Output is correct
33 Correct 41 ms 3900 KB Output is correct
34 Correct 11 ms 1000 KB Output is correct
35 Correct 45 ms 4912 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 29 ms 5052 KB Output is correct
39 Correct 31 ms 5096 KB Output is correct
40 Correct 34 ms 4980 KB Output is correct
41 Correct 33 ms 4936 KB Output is correct
42 Correct 34 ms 5064 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 320 KB Output is correct
45 Correct 0 ms 316 KB Output is correct
46 Correct 0 ms 320 KB Output is correct
47 Correct 0 ms 316 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 31 ms 5168 KB Output is correct
50 Correct 33 ms 4908 KB Output is correct
51 Correct 34 ms 4908 KB Output is correct
52 Correct 31 ms 4936 KB Output is correct
53 Correct 246 ms 4972 KB Output is correct
54 Correct 252 ms 4936 KB Output is correct
55 Correct 238 ms 5040 KB Output is correct
56 Correct 28 ms 1064 KB Output is correct
57 Correct 29 ms 1060 KB Output is correct
58 Correct 132 ms 4140 KB Output is correct
59 Correct 133 ms 4028 KB Output is correct
60 Correct 138 ms 4140 KB Output is correct
61 Correct 125 ms 4040 KB Output is correct
62 Correct 132 ms 4168 KB Output is correct
63 Correct 139 ms 4040 KB Output is correct
64 Correct 986 ms 4732 KB Output is correct
65 Correct 905 ms 4784 KB Output is correct
66 Correct 939 ms 4772 KB Output is correct
67 Execution timed out 1068 ms 3272 KB Time limit exceeded
68 Halted 0 ms 0 KB -