제출 #1253821

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253821		anfi	사이버랜드 (APIO23_cyberland)	C++20	0 / 100	21 ms	20032 KiB

cyberland

// cyberland.cpp
#include <bits/stdc++.h>
using namespace std;

const int N = 10005;
const int K = 105;
const double INF = 1e18;
const double EPS = 1e-9;

double solve(int n, int m, int k, int T, vector<int> type, vector<int> u, vector<int> v, vector<int> w) {
    vector<vector<pair<int, int>>> graph(n);
    for (int i = 0; i < m; i++) {
        graph[u[i]].emplace_back(v[i], w[i]);
        graph[v[i]].emplace_back(u[i], w[i]);
    }

    double dist[N][K][2];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= k; j++) {
            dist[i][j][0] = dist[i][j][1] = INF;
        }
    }

    priority_queue<tuple<double, int, int, int>, vector<tuple<double, int, int, int>>, greater<>> pq;
    dist[0][k][0] = 0.0;
    pq.emplace(0.0, 0, k, 0);

    double ans = INF;

    while (!pq.empty()) {
        auto [d, u, r, used] = pq.top();
        pq.pop();
        if (d > dist[u][r][used] + EPS) continue;

        if (u == n - 1) {
            ans = min(ans, d);
        }

        if (used == 0 && type[u] == 1 && r > 0) {
            if (d < dist[u][r-1][1] - EPS) {
                dist[u][r-1][1] = d;
                pq.emplace(d, u, r-1, 1);
            }
        }

        for (auto [v, w] : graph[u]) {
            double nd = d + (used == 0 ? (double)w : (double)w / 2.0);
            if (nd < dist[v][r][0] - EPS) {
                dist[v][r][0] = nd;
                pq.emplace(nd, v, r, 0);
            }
        }
    }

    return (ans == INF ? -1 : ans);
}

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