Submission #1069626

# Submission time Handle Problem Language Result Execution time Memory
1069626 2024-08-22T07:28:20 Z thangdz2k7 Cyberland (APIO23_cyberland) C++17
0 / 100
20 ms 7256 KB
#include <bits/stdc++.h>
#define db double

using namespace std;

const db inf = 1e12;
const db mid = 2.0;

db solve(int N, int M, int K, int H, vector <int> x, vector <int> y, vector <int> c, vector <int> arr){
    K = min(K, 100);

    vector <vector <int>> adj(N);
    for (int i = 0; i < M; ++ i) adj[x[i]].push_back(i), adj[y[i]].push_back(i);
    vector <db> dp(N, inf);
    dp[0] = 0.0;

    for (int loops = 0; loops <= K; ++ loops){
        priority_queue <pair <db, int>> qu;
        for (int u = 0; u < N; ++ u){
            if (dp[u] == inf) continue;
            if (arr[u] == 0) dp[u] = 0.0;
            if (arr[u] == 2) dp[u] /= mid;
            qu.push({-dp[u], u});
        }

        while (qu.empty()){
            auto [du, u] = qu.top();
            qu.pop(); du = -du;
            if (du != dp[u]) continue;
            for (int id : adj[u]){
                int v = x[id] ^ y[id] ^ u;
                if (dp[v] > dp[u] + c[id]){
                    dp[v] = dp[u] + c[id];
                    qu.push({-dp[v], v});
                }
            }
        }
    }

    return dp[H];
}
# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 856 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 1372 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 1368 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 7256 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 1372 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 1328 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 1368 KB Wrong Answer.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 1372 KB Wrong Answer.
2 Halted 0 ms 0 KB -