Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <queue>
- using namespace std;
- struct node {
- int idx, shortest_path;
- node() {}
- node(int _idx, int _shortest_path) {
- idx = _idx;
- shortest_path = _shortest_path;
- }
- bool operator < (const node & tmp) const {
- return shortest_path > tmp.shortest_path;
- }
- };
- int main() {
- int n, V;
- cin >> n >> V;
- vector<int> portals(n);
- for(int i = 0; i < n; i++) {
- cin >> portals[i];
- }
- priority_queue<node> pq;
- pq.push(node(0, 0));
- vector<bool> visited(n, false);
- vector<bool> portal_visited(11, false);
- while(!pq.empty()) {
- node current_node = pq.top();
- pq.pop();
- if(current_node.idx == n - 1) {
- cout << current_node.shortest_path << endl;
- return 0;
- }
- if(visited[current_node.idx]) {
- continue;
- }
- visited[current_node.idx] = true;
- if(current_node.idx + 1 < n) {
- pq.push(node(current_node.idx + 1, current_node.shortest_path + 1));
- }
- if(current_node.idx - 1 >= 0) {
- pq.push(node(current_node.idx - 1, current_node.shortest_path + 1));
- }
- if(!portal_visited[portals[current_node.idx]]) {
- for(int i = 0; i < n; i++) {
- if(portals[i] == portals[current_node.idx]) {
- pq.push(node(i, current_node.shortest_path + V));
- }
- }
- portal_visited[portals[current_node.idx]] = true;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
