oj.uz

Submission #752979

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

        using namespace std;
        using ll = long long;

        const ll M = 1000000000000000000;

        double solve(int n, int m, int k, int h, vector<int> x,
                     vector<int> y, vector<int> c, vector<int> arr) {
            double d[n]; d[0] = 0;
            for(int l = 1; l < n; l++) d[l] = M;
            vector<pair<int, int>> adj[n];
            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<double, int>,
            vector<pair<double, int>>, greater<pair<double, int>>> pq;
            pq.push({0, 0});
            while(!pq.empty()) {
                double w = pq.top().first;
                int u = pq.top().second; pq.pop();
                for(auto v : adj[u]) {
                    double D = w + v.second;
                    if(arr[v.first] == 0) D = 0;
                    if(arr[v.first] == 2) D /= 2.0;

                    if(d[v.first] > D) {
                        d[v.first] = D;
                        if(v.first != h) pq.push({d[v.first], v.first});
                    }
                }
            }
            if(d[h] == M) return -1;
            return d[h];
        }

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 468 KB Correct.
2 Correct 20 ms 480 KB Correct.

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 468 KB Correct.
2 Correct 26 ms 444 KB Correct.
3 Correct 23 ms 452 KB Correct.
4 Correct 24 ms 408 KB Correct.
5 Correct 26 ms 416 KB Correct.
6 Correct 20 ms 1244 KB Correct.
7 Correct 27 ms 1236 KB Correct.
8 Correct 12 ms 2260 KB Correct.
9 Correct 28 ms 276 KB Correct.
10 Correct 22 ms 340 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 412 KB Correct.
2 Correct 28 ms 420 KB Correct.
3 Correct 28 ms 456 KB Correct.
4 Correct 32 ms 360 KB Correct.
5 Correct 33 ms 356 KB Correct.
6 Correct 6 ms 1108 KB Correct.

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 5788 KB Correct.
2 Correct 40 ms 456 KB Correct.
3 Correct 41 ms 464 KB Correct.
4 Correct 41 ms 500 KB Correct.
5 Correct 40 ms 360 KB Correct.

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 468 KB Correct.
2 Correct 26 ms 408 KB Correct.
3 Correct 37 ms 444 KB Correct.
4 Correct 34 ms 1280 KB Correct.
5 Correct 23 ms 348 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 468 KB Correct.
2 Correct 37 ms 456 KB Correct.
3 Correct 47 ms 7756 KB Correct.
4 Correct 15 ms 1080 KB Correct.
5 Correct 25 ms 344 KB Correct.
6 Correct 42 ms 420 KB Correct.

Subtask #7
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 488 KB Correct.
2 Correct 5 ms 468 KB Correct.
3 Incorrect 82 ms 9768 KB Wrong Answer.
4 Halted 0 ms 0 KB -

Subtask #8
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 488 KB Correct.
2 Correct 7 ms 468 KB Correct.
3 Correct 45 ms 9696 KB Correct.
4 Incorrect 100 ms 900 KB Wrong Answer.
5 Halted 0 ms 0 KB -