oj.uz

Submission #985166

# Submission time Handle Problem Language Result Execution time Memory
985166 2024-05-17T11:57:14 Z CrazyBotBoy Cyberland (APIO23_cyberland) C++17
20 / 100
 988 ms 2097152 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <tuple>
#include <limits>

using namespace std;
 
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    const double INF = numeric_limits<double>::infinity();
    
    //list representation of the graph
    vector<vector<pair<int, int>>> graph(N);
    for (int i = 0; i < M; ++i) {
        graph[x[i]].emplace_back(y[i], c[i]);
        graph[y[i]].emplace_back(x[i], c[i]);
    }
    
    //store as (current cost, current country, remaining K)
    priority_queue<tuple<double, int, int>, vector<tuple<double, int, int>>, greater<>> pq;
    pq.emplace(0.0, 0, K);
    
    //store the minimum cost
    vector<vector<double>> dist(N, vector<double>(K + 1, INF));
    dist[0][K] = 0.0;
    
    while (!pq.empty()) {
        auto [current_cost, u, remaining_k] = pq.top();
        pq.pop();
        
        if (u == H) {
            return current_cost;
        }
        
        // If a cheaper way to get here
        if (current_cost > dist[u][remaining_k]) {
            continue;
        }
        
        for (auto &[v, travel_time] : graph[u]) {
            double new_cost = current_cost + travel_time;
            
            //Normal travel
            if (new_cost < dist[v][remaining_k]) {
                dist[v][remaining_k] = new_cost;
                pq.emplace(new_cost, v, remaining_k);
            }
            
            //Use zeroing ability
            if (arr[v] == 0 && current_cost < dist[v][remaining_k]) {
                dist[v][remaining_k] = current_cost;
                pq.emplace(current_cost, v, remaining_k);
            }
            
            //Use halving ability
            if (arr[v] == 2 && remaining_k > 0) {
                double halved_cost = current_cost + travel_time / 2.0;
                if (halved_cost < dist[v][remaining_k - 1]) {
                    dist[v][remaining_k - 1] = halved_cost;
                    pq.emplace(halved_cost, v, remaining_k - 1);
                }
            }
        }
    }
    
    // If unreachable
    return -1.0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 860 KB Correct.
2 Correct 15 ms 856 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1884 KB Correct.
2 Correct 25 ms 1884 KB Correct.
3 Correct 22 ms 1836 KB Correct.
4 Correct 23 ms 1860 KB Correct.
5 Correct 23 ms 1836 KB Correct.
6 Correct 19 ms 4752 KB Correct.
7 Correct 25 ms 4960 KB Correct.
8 Correct 16 ms 8028 KB Correct.
9 Correct 23 ms 1480 KB Correct.
10 Correct 22 ms 1360 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1680 KB Correct.
2 Correct 32 ms 1840 KB Correct.
3 Correct 22 ms 1848 KB Correct.
4 Correct 21 ms 4244 KB Correct.
5 Correct 20 ms 1372 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 988 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -