Submission #990674

#	Time	Username	Problem	Language	Result	Execution time	Memory
990674		Ibrohim0704	Cyberland (APIO23_cyberland)	C++17	0 / 100	924 ms	2264 KiB

cyberland

#include <iostream>
#include <vector>
#include <queue>
#include <limits>

using namespace std;

struct Node {
    int country;
    int passingTime;

    Node(int c, int t) : country(c), passingTime(t) {}
    bool operator>(const Node& other) const {
        return passingTime > other.passingTime;
    }
};

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    priority_queue<Node, vector<Node>, greater<Node>> pq;
    vector<bool> visited(N, false);

    pq.push(Node(0, 0));

    while (!pq.empty()) {
        Node current = pq.top();
        pq.pop();
        if (current.country == H) {
            return current.passingTime;
        }
        visited[current.country] = true;
        for (int i = 0; i < M; ++i) {
            int neighbor;
            int roadTime;
            if (x[i] == current.country) {
                neighbor = y[i];
                roadTime = c[i];
            } else if (y[i] == current.country) {
                neighbor = x[i];
                roadTime = c[i];
            } else {
                continue;
            }

            int passingTime = current.passingTime + roadTime;
            if (arr[neighbor] == 2 && K > 0) {
                passingTime /= 2;
                K--; 
            } else if (arr[neighbor] == 0) {
                passingTime = 0;
            }

            if (!visited[neighbor]) {
                pq.push(Node(neighbor, passingTime));
            }
        }
    }
    return -1;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3