제출 #1158424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158424		countless	Cyberland (APIO23_cyberland)	C++20	44 / 100	957 ms	2162688 KiB

cyberland

#include "cyberland.h"

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

using namespace std;

typedef long long ll;
typedef long double ld;

const ld INF = 1e18;

struct T {
    ld dist;
    int k;
    int node;

    bool operator>(const T &other) const {
        if (dist != other.dist) return dist > other.dist;
        if (k != other.k) return k > other.k;
        return node > other.node;
    }
};

ld divByPow2(int x, int k) {
    if (k > 30) return (ld)0;

    return (ld)(x / (1LL << k));
}

void checkReal(int start, int H, vector<vector<pair<int, int>>> &adj, vector<bool> &real) {
    real[start] = true;
    for (const pair<int, int> &i : adj[start]) {
        if (i.first == H) real[H] = true;

        if (i.first != H && !real[i.first]) {
            checkReal(i.first, H, adj, real);
        }
    }
}

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) {
    vector<vector<pair<int, int>>> adj(N);

    for (int i = 0; i < M; i++) {
        adj[x[i]].push_back({y[i], c[i]});
        adj[y[i]].push_back({x[i], c[i]});
    }

    // find "real" nodes
    vector<bool> real(N, false);
    checkReal(0, H, adj, real);

    if (!real[H]) return -1;

    // start djikstra's from H
    vector<vector<ld>> dist(N, vector<ld>(K + 1, INF));
    // vector<ld> dist(N, INF);
    dist[H][0] = 0;
    priority_queue<T, vector<T>, greater<T>> pq;
    pq.push({0, 0, H});
    bool flag = false;

    while (!pq.empty()) {
        const auto [cdist, k, node] = pq.top();
        pq.pop();

        if (arr[node] == 0 || node == 0) {
            return cdist;
        }

        if (cdist != dist[node][k]) continue;
        for (const pair<int, int> &i : adj[node]) {
            if (flag && i.first == H) continue;
            if (i.first != H && !real[i.first]) continue;

            if (cdist + divByPow2(i.second, k) < dist[i.first][k]) {
                dist[i.first][k] = cdist + divByPow2(i.second, k);
                pq.push({dist[i.first][k], k, i.first});
            }

            // power-up 2
            if (arr[i.first] == 2 && cdist + divByPow2(i.second, k + 1) < dist[i.first][k+1] && k < K) {
                dist[i.first][k+1] = cdist + divByPow2(i.second, k + 1);
                pq.push({dist[i.first][k+1], k + 1, i.first});
            }
        }

        if (node == H) {
            flag = true;
        }
    }

    return -1;
}

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