oj.uz

Submission #985111

# Submission time Handle Problem Language Result Execution time Memory
985111 2024-05-17T10:47:31 Z reverberation Cyberland (APIO23_cyberland) C++17
0 / 100
 22 ms 5468 KB 
#include <bits/stdc++.h>
using namespace std;
using pll = pair<int, int>;
double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> v) {
    vector<vector<pll>> g(n);
    for (int i = 0; i < m; i++) {
        int a = x[i], b = y[i], cost = c[i];
        g[a].push_back({b, cost});
        g[b].push_back({a, cost});
    }
    vector<int> dist(n, 1e9 + 10);
    dist[0] = 0;
    priority_queue<pll, vector<pll>, greater<pll>> q;
    q.push({0, 0});
    while (!q.empty()) {
        auto [curcost, v] = q.top();
        q.pop();
        if (curcost != dist[v]) continue;
        for (auto [to, cost] : g[v]) {
            if (dist[to] > dist[v] + cost) {
                dist[to] = dist[v] + cost;
                q.push({dist[to], to});
            }
        }
    }
    return dist[h];
}

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
0.0 / 7.0

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

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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