oj.uz

답안 #1034645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034645 2024-07-25T15:47:02 Z XXBabaProBerkay 사이버랜드 (APIO23_cyberland) C++17
0 / 100
 735 ms 2097152 KB 
#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second

using ll = long long;

const double INF = 1e16 + 7;

vector<vector<pair<int, double>>> adj;
vector<bool> vis;

void dfs(int k, int& H) {
    if (k == H || vis[k])
        return;

    vis[k] = true;

    for (auto& i : adj[k])
        dfs(i.F, H);
}

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    adj.resize(N);
    vis.resize(N, false);
    for (int i = 0; i < M; i++) {
        adj[x[i]].emplace_back(y[i], (double)c[i]);
        adj[y[i]].emplace_back(x[i], (double)c[i]);
    }

    dfs(0, H);

    vector<vector<double>> dist(K + 1, vector<double>(N, INF));

    for (int i = 0; i < N; i++) {
        if (arr[i] == 0 && vis[i]) {
            for (int j = 0; j <= K; j++) {
                dist[j][i] = 0;
            }
        }
    }

    for (int i = 0; i <= K; i++) {
        priority_queue<pair<double, int>, vector<pair<double, int>>, greater<pair<double, int>>> PQ;
        dist[i][0] = 0;
        for (int j = 0; j < N; j++) {
            if (dist[i][j] == 0) {
                PQ.emplace(0, j);
            }
        }

        while (!PQ.empty()) {
            int u;
            double d;
            tie(d, u) = PQ.top();
            PQ.pop();

            if (d != dist[i][u] || u == H)
                continue;

            for (auto& k : adj[u]) {
                int v;
                double w;
                tie(v, w) = k;

                bool flag = false;
                if (dist[i][v] > dist[i][u] + w) {
                    dist[i][v] = dist[i][u] + w;
                    flag = true;
                }
                if (i > 0 && arr[v] == 2 && dist[i][v] > (dist[i - 1][u] + w) / 2.0) {
                    dist[i][v] = (dist[i - 1][u] + w) / 2.0;
                    flag = true;
                }

                if (flag)
                    PQ.emplace(dist[i][v], v);
            }
        }
    }

    return (dist[K][H] == INF ? -1 : dist[K][H]);
}

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1000 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 1208 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 22620 KB Correct.
2 Incorrect 151 ms 2000 KB Wrong Answer.
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 7 ms 1124 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1288 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 1012 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 735 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -