Submission #985004

#	Time	Username	Problem	Language	Result	Execution time	Memory
985004		thinknoexit	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	47 ms	54748 KiB

cyberland

#include "cyberland.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
struct A {
    int v, st;
    double w;
    bool operator < (const A& o) const {
        return w > o.w;
    }
};
vector<A> adj[100100];
priority_queue<A> pq;
double dis[31][100100];
double val[31];
bool vis[100100];
int n, m, k, e;
void dfs(int v) {
    vis[v] = 1;
    for (auto& x : adj[v]) {
        if (!vis[x.v]) dfs(x.v);
    }
}
double solve(int NN, int M, int K, int H, vector<int> X, vector<int> Y, vector <int> C, vector<int> arr) {
    n = NN, m = M, k = K, e = H;
    for (int i = 0;i < m;i++) {
        adj[X[i]].push_back({ Y[i], 0, (double)C[i] });
        adj[Y[i]].push_back({ X[i], 0, (double)C[i] });
    }
    memset(vis, 0, sizeof vis);
    dfs(0);
    if (!vis[e]) {
        for (int i = 0;i < n;i++) adj[i].clear();
        return -1;
    }
    val[0] = 1;
    for (int i = 1;i <= k;i++) val[i] = val[i - 1] * 2;
    for (int i = 0;i <= k;i++) {
        for (int j = 0;j < n;j++) dis[i][j] = 1e100;
    }
    pq.push({ e, 0, 0 });
    dis[0][e] = 0;
    while (!pq.empty()) {
        auto x = pq.top();
        pq.pop();
        int v = x.v, st = x.st;
        if (x.w > dis[st][v]) continue;
        if (v == e) continue;
        for (auto& x : adj[v]) {
            if (dis[st][x.v] > dis[st][v] + x.w * val[k - st]) {
                dis[st][x.v] = dis[st][v] + x.w * val[k - st];
                pq.push({ x.v, st, dis[st][x.v] });
            }
            if (arr[x.v] == 2 && st < k) {
                if (dis[st + 1][x.v] > dis[st][v] + x.w * val[k - st]) {
                    dis[st + 1][x.v] = dis[st][v] + x.w * val[k - st];
                    pq.push({ x.v, st + 1, dis[st + 1][x.v] });
                }
            }
        }
    }
    double mn = 1e100;
    for (int i = 0;i < n;i++) {
        if (i != 0 && arr[i] != 0) continue;
        if (!vis[i]) continue;
        for (int j = 0;j <= k;j++) {
            mn = min(mn, dis[j][i] / val[k - j]);
        }
    }
    for (int i = 0;i < n;i++) {
        adj[i].clear();
    }
    return mn;
}

• 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