oj.uz

Submission #985134

# Submission time Handle Problem Language Result Execution time Memory
985134 2024-05-17T11:08:02 Z SabyrAl Cyberland (APIO23_cyberland) C++17
8 / 100
 3000 ms 6804 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

double djicstra(int n, int m, int k, int h, int s, vector<vector<pll> >& g) {
    vector<ll> dist(n, 1e15);
    dist[s] = 0;
    priority_queue<pll, vector<pll >, greater<pll > > q;
    q.push({0, s});
    while(!q.empty()) {
        auto [d, v] = q.top();
        q.pop();
        if (d != dist[v]) continue;
        for (auto [to, c] : g[v]) {
            q.push({c + d, to});
            dist[to] = min(c + d, dist[to]);
        }
    }
    return dist[h];
}

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    vector<vector<pll > > g(N);
    for (int i = 0; i < M; i++) {
        g[x[i]].push_back({y[i], c[i]});
        g[y[i]].push_back({x[i], c[i]});
    }
    double ans = djicstra(N, M, K, H, 0, g);
    for (int i = 1; i < N; i++) {
        if (arr[i] == 0) {
            ans = min(djicstra(N, M, K, H, i, g), ans);
        }
    }
    return ans;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 604 KB Correct.
2 Correct 26 ms 600 KB Correct.
3 Correct 24 ms 604 KB Correct.
4 Correct 25 ms 604 KB Correct.
5 Correct 26 ms 596 KB Correct.
6 Correct 25 ms 1696 KB Correct.
7 Correct 28 ms 1440 KB Correct.
8 Correct 12 ms 2652 KB Correct.
9 Correct 23 ms 524 KB Correct.
10 Correct 24 ms 344 KB Correct.

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3034 ms 6804 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 7.0

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

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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