oj.uz

Submission #985353

# Submission time Handle Problem Language Result Execution time Memory
985353 2024-05-17T16:38:23 Z CrazyBotBoy Cyberland (APIO23_cyberland) C++17
15 / 100
 1054 ms 2097152 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <limits>
#include <tuple>
#include <iomanip>

const double INF = std::numeric_limits<double>::infinity();

struct State {
    double time;
    int country;
    int div2_used;

    bool operator>(const State& other) const {
        return time > other.time;
    }
};

double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
    std::vector<std::vector<std::pair<int, double>>> graph(N);

    // Build the graph
    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]);
    }

    // Priority queue for Dijkstra-like algorithm
    std::priority_queue<State, std::vector<State>, std::greater<State>> pq;
    pq.push({0, 0, 0});

    // Distance table to store the minimum time to reach each country with a certain number of divide-by-2 used
    std::vector<std::vector<double>> dist(N, std::vector<double>(K + 1, INF));
    dist[0][0] = 0;

    while (!pq.empty()) {
        auto [current_time, current_country, div2_used] = pq.top();
        pq.pop();

        if (current_country == H) {
            return current_time;
        }

        // Early exit if we already have found a better way
        if (current_time > dist[current_country][div2_used]) {
            continue;
        }

        // Explore all adjacent countries
        for (const auto& [next_country, travel_time] : graph[current_country]) {
            double next_time = current_time + travel_time;

            // Case 1: Without using any special ability
            if (next_time < dist[next_country][div2_used]) {
                dist[next_country][div2_used] = next_time;
                pq.push({next_time, next_country, div2_used});
            }

            // Case 2: Using special abilities
            if (arr[next_country] == 0) {
                next_time = 0;
                if (next_time < dist[next_country][div2_used]) {
                    dist[next_country][div2_used] = next_time;
                    pq.push({next_time, next_country, div2_used});
                }
            } else if (arr[next_country] == 2 && div2_used < K) {
                next_time = current_time / 2.0;
                if (next_time < dist[next_country][div2_used + 1]) {
                    dist[next_country][div2_used + 1] = next_time;
                    pq.push({next_time, next_country, div2_used + 1});
                }
            }
        }
    }

    return -1;  // If we exhaust the priority queue and don't find a way to H
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1572 KB Correct.
2 Correct 25 ms 1852 KB Correct.
3 Correct 24 ms 1840 KB Correct.
4 Correct 24 ms 1876 KB Correct.
5 Correct 25 ms 2044 KB Correct.
6 Correct 18 ms 5020 KB Correct.
7 Correct 35 ms 4872 KB Correct.
8 Correct 14 ms 8280 KB Correct.
9 Correct 25 ms 1372 KB Correct.
10 Correct 27 ms 1224 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1816 KB Correct.
2 Correct 24 ms 1744 KB Correct.
3 Correct 25 ms 1852 KB Correct.
4 Correct 25 ms 4504 KB Correct.
5 Correct 22 ms 1376 KB Correct.

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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