oj.uz

Submission #983209

# Submission time Handle Problem Language Result Execution time Memory
983209 2024-05-15T09:28:25 Z vjudge1 Cyberland (APIO23_cyberland) C++17
0 / 100
 1163 ms 2484 KB 
#include <vector>
#include <queue>
#include <limits>

using namespace std;

const int INF = numeric_limits<int>::max();

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    // Initialize the priority queue to store (time, country) pairs
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    
    // Initialize the distance array with infinity
    vector<int> dist(N, INF);
    
    // Start from your country (country 0)
    pq.push({0, 0});
    dist[0] = 0; // Time to reach your country is 0
    
    // Dijkstra's algorithm
    while (!pq.empty()) {
        int curr_time = pq.top().first;
        int curr_country = pq.top().second;
        pq.pop();
        
        // If we reached Cyberland, return the time
        if (curr_country == H) return curr_time;
        
        // Iterate over neighboring countries
        for (int i = 0; i < M; ++i) {
            if (x[i] == curr_country || y[i] == curr_country) {
                int next_country = (x[i] == curr_country) ? y[i] : x[i];
                int time_to_next = c[i];
                
                // Apply special abilities if available
                if (arr[curr_country] == 2 && K > 0) {
                    time_to_next /= 2;
                    --K; // Reduce the number of times we can use divide-by-2 ability
                }
                
                // Update the time to reach the neighboring country if needed
                if (curr_time + time_to_next < dist[next_country]) {
                    dist[next_country] = curr_time + time_to_next;
                    pq.push({dist[next_country], next_country});
                }
            }
        }
    }
    
    // If Cyberland is unreachable, return -1
    return -1;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 604 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 348 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 42 ms 344 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1163 ms 2484 KB Double -1.67438e+08 violates the range [-1, 1e+18]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 344 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 348 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 600 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 480 KB Wrong Answer.
2 Halted 0 ms 0 KB -