oj.uz

Submission #752316

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

// Trash code from https://www.geeksforgeeks.org/pairing-heap/
struct HeapNode {
    pair<int, int> key;
    HeapNode *leftChild;
    HeapNode *nextSibling;
 
    HeapNode():
        leftChild(NULL), nextSibling(NULL) {}
 
    // creates a new node
    HeapNode(pair<int, int> key_, HeapNode *leftChild_, HeapNode *nextSibling_):
        key(key_), leftChild(leftChild_), nextSibling(nextSibling_) {}
         
        // Adds a child and sibling to the node
    void addChild(HeapNode *node) {
        if(leftChild == NULL)
            leftChild = node;
        else {
            node->nextSibling = leftChild;
            leftChild = node;
        }
    }
};
 
// Returns true if root of the tree
// is null otherwise returns false
bool Empty(HeapNode *node) {
    return (node == NULL);
}
 
// Function to merge two heaps
HeapNode *Merge(HeapNode *A, HeapNode *B)
{
    // If any of the two-nodes is null
    // the return the not null node
    if(A == NULL) return B;
    if(B == NULL) return A;
     
    // To maintain the min heap condition compare   
    // the nodes and node with minimum value become 
    // parent of the other node
    if(A->key.first < B->key.first) {                 
        A->addChild(B);
        return A;        
    }
    else {
        B->addChild(A);
        return B;
    }
 
    return NULL; // Unreachable
}
 
// Returns the root value of the heap
pair<int, int> Top(HeapNode *node) {
    return node->key;
}
 
// Function to insert the new node in the heap
HeapNode *Insert(HeapNode *node, pair<int, int> key) {
    return Merge(node, new HeapNode(key, NULL, NULL));
}
 
// This method is used when we want to delete root node
HeapNode *TwoPassMerge(HeapNode *node) {
    if(node == NULL || node->nextSibling == NULL)
        return node;
    else {
        HeapNode *A, *B, *newNode;
        A = node;
        B = node->nextSibling;
        newNode = node->nextSibling->nextSibling;
 
        A->nextSibling = NULL;
        B->nextSibling = NULL;
 
        return Merge(Merge(A, B), TwoPassMerge(newNode));
    }
 
    return NULL; // Unreachable
}
 
// Function to delete the root node in heap
HeapNode *Delete(HeapNode *node) {
    return TwoPassMerge(node->leftChild);
}
 
struct PairingHeap {
    HeapNode *root;
 
    PairingHeap():
        root(NULL) {}
 
    bool Empty(void) {
        return ::Empty(root);
    }
 
    pair<int, int> Top(void) {
        return ::Top(root);
    }
 
    void Insert(pair<int, int> key) {
        root = ::Insert(root, key);
    }
 
    void Delete(void) {
        root = ::Delete(root);
    }
 
    void Join(PairingHeap other) {
        root = ::Merge(root, other.root);
    }
     
};

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;
  PairingHeap q;
  q.Insert({0, start});
  while (!q.Empty()) {
    auto [d, u] = q.Top();
    q.Delete();
    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.Insert({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 70 ms 161800 KB Output is correct
2 Correct 63 ms 157036 KB Output is correct
3 Correct 95 ms 163940 KB Output is correct
4 Correct 97 ms 164316 KB Output is correct
5 Correct 62 ms 157260 KB Output is correct
6 Correct 67 ms 157268 KB Output is correct
7 Correct 63 ms 156776 KB Output is correct
8 Correct 70 ms 156812 KB Output is correct
9 Correct 68 ms 156808 KB Output is correct
10 Correct 96 ms 166968 KB Output is correct
11 Correct 97 ms 166792 KB Output is correct
12 Correct 96 ms 166672 KB Output is correct
13 Correct 73 ms 158332 KB Output is correct
14 Correct 90 ms 161448 KB Output is correct
15 Correct 86 ms 161196 KB Output is correct
16 Correct 79 ms 161416 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 180440 KB Output is correct
2 Correct 485 ms 179652 KB Output is correct
3 Correct 516 ms 180208 KB Output is correct
4 Correct 85 ms 164084 KB Output is correct
5 Correct 72 ms 161308 KB Output is correct
6 Correct 63 ms 157992 KB Output is correct
7 Correct 64 ms 156876 KB Output is correct
8 Correct 63 ms 156816 KB Output is correct
9 Correct 158 ms 163004 KB Output is correct
10 Correct 157 ms 162992 KB Output is correct
11 Correct 328 ms 172080 KB Output is correct
12 Correct 353 ms 171580 KB Output is correct
13 Correct 326 ms 172108 KB Output is correct
14 Correct 334 ms 171976 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 161832 KB Output is correct
2 Correct 62 ms 157756 KB Output is correct
3 Correct 138 ms 162720 KB Output is correct
4 Correct 66 ms 157296 KB Output is correct
5 Correct 161 ms 162988 KB Output is correct
6 Correct 62 ms 156876 KB Output is correct
7 Correct 67 ms 156784 KB Output is correct
8 Correct 103 ms 159208 KB Output is correct
9 Correct 97 ms 159260 KB Output is correct
10 Correct 129 ms 161076 KB Output is correct
11 Correct 126 ms 161156 KB Output is correct
12 Correct 130 ms 161180 KB Output is correct
13 Correct 81 ms 156876 KB Output is correct
14 Correct 62 ms 156800 KB Output is correct
15 Correct 61 ms 156840 KB Output is correct
16 Correct 62 ms 156804 KB Output is correct
17 Correct 61 ms 156764 KB Output is correct
18 Correct 63 ms 156920 KB Output is correct
19 Correct 134 ms 161124 KB Output is correct
20 Correct 135 ms 161100 KB Output is correct
21 Correct 126 ms 161188 KB Output is correct
22 Correct 128 ms 161188 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 161800 KB Output is correct
2 Correct 63 ms 157036 KB Output is correct
3 Correct 95 ms 163940 KB Output is correct
4 Correct 97 ms 164316 KB Output is correct
5 Correct 62 ms 157260 KB Output is correct
6 Correct 67 ms 157268 KB Output is correct
7 Correct 63 ms 156776 KB Output is correct
8 Correct 70 ms 156812 KB Output is correct
9 Correct 68 ms 156808 KB Output is correct
10 Correct 96 ms 166968 KB Output is correct
11 Correct 97 ms 166792 KB Output is correct
12 Correct 96 ms 166672 KB Output is correct
13 Correct 73 ms 158332 KB Output is correct
14 Correct 90 ms 161448 KB Output is correct
15 Correct 86 ms 161196 KB Output is correct
16 Correct 79 ms 161416 KB Output is correct
17 Correct 499 ms 180440 KB Output is correct
18 Correct 485 ms 179652 KB Output is correct
19 Correct 516 ms 180208 KB Output is correct
20 Correct 85 ms 164084 KB Output is correct
21 Correct 72 ms 161308 KB Output is correct
22 Correct 63 ms 157992 KB Output is correct
23 Correct 64 ms 156876 KB Output is correct
24 Correct 63 ms 156816 KB Output is correct
25 Correct 158 ms 163004 KB Output is correct
26 Correct 157 ms 162992 KB Output is correct
27 Correct 328 ms 172080 KB Output is correct
28 Correct 353 ms 171580 KB Output is correct
29 Correct 326 ms 172108 KB Output is correct
30 Correct 334 ms 171976 KB Output is correct
31 Correct 71 ms 161832 KB Output is correct
32 Correct 62 ms 157756 KB Output is correct
33 Correct 138 ms 162720 KB Output is correct
34 Correct 66 ms 157296 KB Output is correct
35 Correct 161 ms 162988 KB Output is correct
36 Correct 62 ms 156876 KB Output is correct
37 Correct 67 ms 156784 KB Output is correct
38 Correct 103 ms 159208 KB Output is correct
39 Correct 97 ms 159260 KB Output is correct
40 Correct 129 ms 161076 KB Output is correct
41 Correct 126 ms 161156 KB Output is correct
42 Correct 130 ms 161180 KB Output is correct
43 Correct 81 ms 156876 KB Output is correct
44 Correct 62 ms 156800 KB Output is correct
45 Correct 61 ms 156840 KB Output is correct
46 Correct 62 ms 156804 KB Output is correct
47 Correct 61 ms 156764 KB Output is correct
48 Correct 63 ms 156920 KB Output is correct
49 Correct 134 ms 161124 KB Output is correct
50 Correct 135 ms 161100 KB Output is correct
51 Correct 126 ms 161188 KB Output is correct
52 Correct 128 ms 161188 KB Output is correct
53 Correct 615 ms 183812 KB Output is correct
54 Correct 586 ms 183416 KB Output is correct
55 Correct 692 ms 182952 KB Output is correct
56 Correct 113 ms 164044 KB Output is correct
57 Correct 103 ms 164416 KB Output is correct
58 Correct 464 ms 182084 KB Output is correct
59 Correct 511 ms 184564 KB Output is correct
60 Correct 542 ms 184504 KB Output is correct
61 Correct 483 ms 180808 KB Output is correct
62 Correct 564 ms 183244 KB Output is correct
63 Correct 538 ms 184408 KB Output is correct
64 Execution timed out 1074 ms 220216 KB Time limit exceeded
65 Halted 0 ms 0 KB -