제출 #1113121

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1113121		ortsac	사이버랜드 (APIO23_cyberland)	C++17	97 / 100	1347 ms	73116 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pii pair<long long, long long>
#define fr first
#define se second

const double INF = 1e100;

vector<vector<pii>> adj;
vector<bool> vis;

void dfs(int node) {
    if (vis[node]) return;
    vis[node] = 1;
    for (auto u : adj[node]) dfs(u.fr);
}

double solve(int32_t n, int32_t m, int32_t k, int32_t h, vector<int32_t> x, vector<int32_t> y, vector<int32_t> c, vector<int32_t> arr) {
    adj.clear();
    vis.clear();
    adj.resize(n);
    vis.resize(n);
    for (int i = 0; i < m; i++) {
        int a = x[i], b = y[i], co = c[i];
        if (a != h) adj[a].push_back({b, co});
        if (b != h) adj[b].push_back({a, co});
    }
    vector<vector<bool>> prop(n, vector<bool>(31));
    vector<vector<double>> dist(n, vector<double>(31, INF));
    priority_queue<pair<double, pii>> pq;
    dist[0][0] = 0;
    pq.push({0, {0, 0}});
    dfs(0);
    for (int i = 0; i < n; i++) {
        if ((arr[i] == 0) && vis[i]) {
            dist[i][0] = 0;
            pq.push({0, {i, 0}});
        } 
    }
    while (!pq.empty()) {
        auto [u, qtd] = pq.top().se;
        pq.pop();
        if (prop[u][qtd]) continue;
        //prop[u][qtd] = 1;
        for (auto [v, cost] : adj[u]) {
            // propaga sem aumentar o k
            if (!prop[v][qtd]) {
                double novo = (((double)cost) + dist[u][qtd]);
                //if (arr[v] == 0) novo = 0;
                if (novo < dist[v][qtd]) {
                    dist[v][qtd] = novo;
                    pq.push({-novo, {v, qtd}});
                }
            }
            if ((qtd < k) && (arr[v] == 2) && (!prop[v][qtd + 1])) {
                double novo = (((double)cost) + dist[u][qtd]) / 2.0;
                if (novo < dist[v][qtd + 1]) {
                    dist[v][qtd + 1] = novo;
                    pq.push({-novo, {v, qtd + 1}});
                }
            }
        }
    }
    double ans = INF;
    for (int i = 0; i <= k; i++) {
        ans = min(ans, dist[h][i]);
    }
    if (ans == INF) return -1;
    return ans;
}

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