oj.uz

Submission #752958

# Submission time Handle Problem Language Result Execution time Memory
752958 2023-06-04T11:05:07 Z MohamedFaresNebili Cyberland (APIO23_cyberland) C++17
0 / 100
 151 ms 6664 KB 
#include <bits/stdc++.h>

        using namespace std;

        int N, M, K, H, A[100005];
        double D1[100005], D2[100005], D3[100005];
        vector<pair<int, int>> adj[100005];

        double solve(int n, int m, int k, int h, vector<int> x,
                     vector<int> y, vector<int> c, vector<int> arr) {
            for(int l = 0; l < n; l++) D1[l] = 1000000007;
            D1[0] = 0;
            for(int l = 0; l < m; l++) {
                adj[x[l]].push_back({y[l], c[l]});
                adj[y[l]].push_back({x[l], c[l]});
            }
            priority_queue<pair<int, int>,
            vector<pair<int, int>>, greater<pair<int, int>>> pq;
            pq.push({0, 0});
            while(!pq.empty()) {
                double W = pq.top().first;
                int U = pq.top().second; pq.pop();
                if(U == h) continue;
                for(auto V : adj[U]) {
                    if(D1[V.first] > W + V.second) {
                        D1[V.first] = W + V.second;
                        if(arr[V.first] == 0) D1[V.first] = 0;
                        pq.push({D1[V.first], V.first});
                    }
                }
            }
            if(D1[h] == 1000000007) return -1;
            return D1[h];
        }

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 13.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
0.0 / 7.0

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

Subtask #6
0.0 / 16.0

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

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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