oj.uz

Submission #244940

# Submission time Handle Problem Language Result Execution time Memory
244940 2020-07-05T09:43:49 Z rama_pang Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 2932 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 205;
const int MAXM = 50005;

int N, M;
vector<int> adj[MAXN];
vector<int> radj[MAXN];
vector<array<int, 4>> edge;

int par[5][MAXN];
int dist[5][MAXN];
int sptree[5][MAXM];

int Dijkstra(int s, int k, vector<int> a[MAXN], int block = -1, int ru = -1, int rv = -1, int rc = -1, int target = -1) {
  for (int i = 0; i < MAXN; i++) {
    dist[k][i] = 2e9;
  }

  priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
  pq.emplace(0, s);
  auto dt = dist[k];
  auto pr = par[k];
  dt[s] = 0;
  pr[s] = -1;
  while (!pq.empty()) {
    int u = pq.top().second;
    int d = pq.top().first;
    pq.pop();
    if (dt[u] != d) {
      continue;
    }
    if (u == target) {
      return d;
    }
    if (pr[u] != -1) {
      sptree[k][pr[u]] = 1;
    }
    for (auto e : a[u]) if (e != block) {
      int v = edge[e][0] ^ edge[e][1] ^ u;
      if (dt[v] > dt[u] + edge[e][2]) {
        dt[v] = dt[u] + edge[e][2];
        pr[v] = e;
        pq.emplace(dt[v], v);
      }
    }
    if (u == ru) {
      int v = rv;
      if (dt[v] > dt[u] + rc) {
        dt[v] = dt[u] + rc;
        pr[v] = -1;
        pq.emplace(dt[v], v);
      } 
    }
  }
  return 2e9;
}

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

  cin >> N >> M;
  for (int i = 0; i < M; i++) {
    int u, v, c, d;
    cin >> u >> v >> c >> d;
    edge.push_back({u, v, c, d});
    adj[u].emplace_back(i);
    radj[v].emplace_back(i);
  }

  Dijkstra(1, 0, adj); // 1 to N
  Dijkstra(N, 1, adj); // N to 1
  Dijkstra(N, 2, radj); // 1 to N, reverse
  Dijkstra(1, 3, radj); // N to 1, reverse
  int ans = (int) min((long long) 2e9, 1ll * dist[0][N] + 1ll * dist[1][1]);
  for (int i = 0; i < M; i++) {
    int u, v, c, d;
    u = edge[i][0], v = edge[i][1], c = edge[i][2], d = edge[i][3];
    if (sptree[0][i] == 0 && sptree[1][i] == 0) {
      int d1 = min((long long) dist[0][N], (long long) dist[0][v] + c + dist[2][u]);
      int d2 = min((long long) dist[1][1], (long long) dist[1][v] + c + dist[3][u]);
      if (d1 < 2e9 && d2 < 2e9) {
        ans = min(ans, d + d1 + d2);
      }
    } else {
      int d1 = Dijkstra(1, 4, adj, i, v, u, c, N);
      int d2 = Dijkstra(N, 4, adj, i, v, u, c, 1);
      if (d1 < 2e9 && d2 < 2e9) {
        ans = min(ans, d + d1 + d2);
      }
    }
  }
  if (ans >= 2e9) {
    ans = -1;
  }
  cout << ans << "\n";
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 15 ms 384 KB Output is correct
4 Correct 18 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 23 ms 512 KB Output is correct
11 Correct 32 ms 384 KB Output is correct
12 Correct 31 ms 512 KB Output is correct
13 Correct 9 ms 512 KB Output is correct
14 Correct 13 ms 512 KB Output is correct
15 Correct 12 ms 384 KB Output is correct
16 Correct 15 ms 384 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 2796 KB Output is correct
2 Correct 117 ms 2804 KB Output is correct
3 Correct 91 ms 2812 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 10 ms 512 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 62 ms 2656 KB Output is correct
10 Correct 57 ms 2676 KB Output is correct
11 Correct 107 ms 2804 KB Output is correct
12 Correct 100 ms 2808 KB Output is correct
13 Correct 108 ms 2676 KB Output is correct
14 Correct 86 ms 2804 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 78 ms 2164 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 99 ms 2932 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 54 ms 2772 KB Output is correct
9 Correct 57 ms 2652 KB Output is correct
10 Correct 115 ms 2804 KB Output is correct
11 Correct 63 ms 2796 KB Output is correct
12 Correct 68 ms 2796 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 117 ms 2804 KB Output is correct
20 Correct 71 ms 2828 KB Output is correct
21 Correct 62 ms 2676 KB Output is correct
22 Correct 70 ms 2804 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 15 ms 384 KB Output is correct
4 Correct 18 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 23 ms 512 KB Output is correct
11 Correct 32 ms 384 KB Output is correct
12 Correct 31 ms 512 KB Output is correct
13 Correct 9 ms 512 KB Output is correct
14 Correct 13 ms 512 KB Output is correct
15 Correct 12 ms 384 KB Output is correct
16 Correct 15 ms 384 KB Output is correct
17 Correct 100 ms 2796 KB Output is correct
18 Correct 117 ms 2804 KB Output is correct
19 Correct 91 ms 2812 KB Output is correct
20 Correct 9 ms 512 KB Output is correct
21 Correct 10 ms 512 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 62 ms 2656 KB Output is correct
26 Correct 57 ms 2676 KB Output is correct
27 Correct 107 ms 2804 KB Output is correct
28 Correct 100 ms 2808 KB Output is correct
29 Correct 108 ms 2676 KB Output is correct
30 Correct 86 ms 2804 KB Output is correct
31 Correct 14 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 78 ms 2164 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 99 ms 2932 KB Output is correct
36 Correct 4 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 54 ms 2772 KB Output is correct
39 Correct 57 ms 2652 KB Output is correct
40 Correct 115 ms 2804 KB Output is correct
41 Correct 63 ms 2796 KB Output is correct
42 Correct 68 ms 2796 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 5 ms 384 KB Output is correct
46 Correct 4 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 117 ms 2804 KB Output is correct
50 Correct 71 ms 2828 KB Output is correct
51 Correct 62 ms 2676 KB Output is correct
52 Correct 70 ms 2804 KB Output is correct
53 Correct 106 ms 2800 KB Output is correct
54 Correct 117 ms 2924 KB Output is correct
55 Correct 75 ms 2924 KB Output is correct
56 Correct 17 ms 512 KB Output is correct
57 Correct 10 ms 512 KB Output is correct
58 Correct 127 ms 2412 KB Output is correct
59 Correct 156 ms 2420 KB Output is correct
60 Correct 216 ms 2412 KB Output is correct
61 Correct 124 ms 2420 KB Output is correct
62 Correct 140 ms 2412 KB Output is correct
63 Correct 194 ms 2420 KB Output is correct
64 Correct 771 ms 2660 KB Output is correct
65 Correct 801 ms 2676 KB Output is correct
66 Execution timed out 1046 ms 2660 KB Time limit exceeded
67 Halted 0 ms 0 KB -