oj.uz

Submission #1113110

# Submission time Handle Problem Language Result Execution time Memory
1113110 2024-11-15T19:05:26 Z ortsac Cyberland (APIO23_cyberland) C++17
15 / 100
 202 ms 26376 KB 
#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 int MAXN = 1e5 + 10;
int n, m, k, h;
double INF = 1e18;

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) {
    n = N;
    m = M;
    k = K;
    h = H;
    vector<vector<pii>> adj(n);
    for (int i = 0; i < m; i++) {
        int a = x[i], b = y[i], co = c[i];
        adj[a].push_back({b, co});
        adj[b].push_back({a, co});
    }
    vector<vector<bool>> prop(n, vector<bool>(31));
    vector<vector<double>> dist(n, vector<double>(31, INF));
    dist[0][0] = 0;
    priority_queue<pair<double, pii>> pq;
    pq.push({0, {0, 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 = (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 = (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
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 848 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1616 KB Correct.
2 Correct 33 ms 2084 KB Correct.
3 Correct 28 ms 1904 KB Correct.
4 Correct 31 ms 908 KB Correct.
5 Correct 34 ms 2004 KB Correct.
6 Correct 32 ms 5652 KB Correct.
7 Correct 37 ms 5360 KB Correct.
8 Correct 21 ms 9848 KB Correct.
9 Correct 28 ms 1352 KB Correct.
10 Correct 29 ms 1360 KB Correct.

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 1716 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 144 ms 26376 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 1652 KB Correct.
2 Correct 38 ms 1864 KB Correct.
3 Correct 31 ms 1884 KB Correct.
4 Correct 30 ms 5036 KB Correct.
5 Correct 25 ms 1360 KB Correct.

Subtask #6
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 1616 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 202 ms 2348 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 848 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -