oj.uz

Submission #827586

# Submission time Handle Problem Language Result Execution time Memory
827586 2023-08-16T15:03:17 Z taher Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 5720 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 = 1165465792545;
const int N = 305;

vector<array<int, 4>> adj[N], inv[N];
long long d2[N][N], d1[N][N], dist[N];

int cntA[N], cntB[N], cntC[N], cntD[N];
int middleA[N], middleB[N], middleC[N], middleD[N];
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
 
  int n, m;
  cin >> n >> m;
  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;

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      d2[i][j] = inf;
      d1[i][j] = 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) {
    for (int i = 0; i < n; i++) {
      dist[i] = 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]];
  };

  for (int i = 0; i < n; i++) {
    middleA[i] = middleB[i] = middleC[i] = middleD[i] = -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];
      }
    }
  }
 
  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 18 ms 1364 KB Output is correct
2 Correct 13 ms 1336 KB Output is correct
3 Correct 27 ms 1364 KB Output is correct
4 Correct 28 ms 1364 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 12 ms 1328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 456 KB Output is correct
10 Correct 26 ms 1408 KB Output is correct
11 Correct 25 ms 1416 KB Output is correct
12 Correct 25 ms 1364 KB Output is correct
13 Correct 16 ms 1400 KB Output is correct
14 Correct 21 ms 1364 KB Output is correct
15 Correct 23 ms 1292 KB Output is correct
16 Correct 21 ms 1400 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5096 KB Output is correct
2 Correct 27 ms 5100 KB Output is correct
3 Correct 27 ms 5156 KB Output is correct
4 Correct 13 ms 1484 KB Output is correct
5 Correct 13 ms 1384 KB Output is correct
6 Correct 12 ms 1356 KB Output is correct
7 Correct 12 ms 1236 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 33 ms 5072 KB Output is correct
10 Correct 28 ms 4936 KB Output is correct
11 Correct 28 ms 5080 KB Output is correct
12 Correct 28 ms 5012 KB Output is correct
13 Correct 28 ms 5080 KB Output is correct
14 Correct 36 ms 5508 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1400 KB Output is correct
2 Correct 13 ms 1336 KB Output is correct
3 Correct 40 ms 4152 KB Output is correct
4 Correct 13 ms 1336 KB Output is correct
5 Correct 45 ms 4944 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 30 ms 4964 KB Output is correct
9 Correct 31 ms 4972 KB Output is correct
10 Correct 37 ms 5080 KB Output is correct
11 Correct 34 ms 5576 KB Output is correct
12 Correct 33 ms 5720 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 31 ms 5704 KB Output is correct
20 Correct 33 ms 5576 KB Output is correct
21 Correct 40 ms 5608 KB Output is correct
22 Correct 32 ms 5500 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1364 KB Output is correct
2 Correct 13 ms 1336 KB Output is correct
3 Correct 27 ms 1364 KB Output is correct
4 Correct 28 ms 1364 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 12 ms 1328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 456 KB Output is correct
10 Correct 26 ms 1408 KB Output is correct
11 Correct 25 ms 1416 KB Output is correct
12 Correct 25 ms 1364 KB Output is correct
13 Correct 16 ms 1400 KB Output is correct
14 Correct 21 ms 1364 KB Output is correct
15 Correct 23 ms 1292 KB Output is correct
16 Correct 21 ms 1400 KB Output is correct
17 Correct 27 ms 5096 KB Output is correct
18 Correct 27 ms 5100 KB Output is correct
19 Correct 27 ms 5156 KB Output is correct
20 Correct 13 ms 1484 KB Output is correct
21 Correct 13 ms 1384 KB Output is correct
22 Correct 12 ms 1356 KB Output is correct
23 Correct 12 ms 1236 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 33 ms 5072 KB Output is correct
26 Correct 28 ms 4936 KB Output is correct
27 Correct 28 ms 5080 KB Output is correct
28 Correct 28 ms 5012 KB Output is correct
29 Correct 28 ms 5080 KB Output is correct
30 Correct 36 ms 5508 KB Output is correct
31 Correct 23 ms 1400 KB Output is correct
32 Correct 13 ms 1336 KB Output is correct
33 Correct 40 ms 4152 KB Output is correct
34 Correct 13 ms 1336 KB Output is correct
35 Correct 45 ms 4944 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 30 ms 4964 KB Output is correct
39 Correct 31 ms 4972 KB Output is correct
40 Correct 37 ms 5080 KB Output is correct
41 Correct 34 ms 5576 KB Output is correct
42 Correct 33 ms 5720 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 31 ms 5704 KB Output is correct
50 Correct 33 ms 5576 KB Output is correct
51 Correct 40 ms 5608 KB Output is correct
52 Correct 32 ms 5500 KB Output is correct
53 Correct 246 ms 5560 KB Output is correct
54 Correct 259 ms 5656 KB Output is correct
55 Correct 240 ms 5560 KB Output is correct
56 Correct 28 ms 1364 KB Output is correct
57 Correct 30 ms 1364 KB Output is correct
58 Correct 128 ms 4580 KB Output is correct
59 Correct 147 ms 4524 KB Output is correct
60 Correct 145 ms 4592 KB Output is correct
61 Correct 133 ms 4608 KB Output is correct
62 Correct 132 ms 4592 KB Output is correct
63 Correct 138 ms 4588 KB Output is correct
64 Correct 996 ms 5184 KB Output is correct
65 Correct 923 ms 5184 KB Output is correct
66 Correct 967 ms 5232 KB Output is correct
67 Execution timed out 1067 ms 3288 KB Time limit exceeded
68 Halted 0 ms 0 KB -