oj.uz

Submission #752995

# Submission time Handle Problem Language Result Execution time Memory
752995 2023-06-04T11:57:54 Z MohamedFaresNebili Cyberland (APIO23_cyberland) C++17
44 / 100
 3000 ms 263128 KB 
#include <bits/stdc++.h>
 
        using namespace std;
        using ll = long long;
        using pi = pair<double, pair<int, int>>;
 
        const ll M = 1000000000000000000;
        const double epsilon = 0.000001;
 
        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<pi, vector<pi>, greater<pi>> pq;
            pq.push({0, {k, 0}});
            while(!pq.empty()) {
                double w = pq.top().first;
                int u = pq.top().second.second;
                int t = pq.top().second.first; pq.pop();
                for(auto v : adj[u]) {
                    double D = w + v.second;
                    if(arr[v.first] == 0) D = 0;
                    if(arr[v.first] == 2) {
                    	for(int l = 1; l <= t; l++) {
                          D /= 2.0;
                          if(fabs(d[v.first] - D) > epsilon) {
                              d[v.first] = D;
                              if(v.first != h) pq.push({d[v.first], {t - l, v.first}});
                          }
                       }
                    }
                    
                    if(d[v.first] > D) {
                        d[v.first] = D;
                        if(v.first != h) pq.push({d[v.first], {t, v.first}});
                    }
                }
            }
            if(d[h] == M) return -1;
            return d[h];
            return 0;
        }

Subtask #1
0.0 / 5.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 460 KB Correct.
2 Correct 26 ms 468 KB Correct.
3 Correct 28 ms 468 KB Correct.
4 Correct 27 ms 436 KB Correct.
5 Correct 29 ms 468 KB Correct.
6 Correct 24 ms 1244 KB Correct.
7 Correct 33 ms 1208 KB Correct.
8 Correct 14 ms 2272 KB Correct.
9 Correct 22 ms 348 KB Correct.
10 Correct 22 ms 364 KB Correct.

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 340 KB Correct.
2 Correct 27 ms 440 KB Correct.
3 Correct 27 ms 436 KB Correct.
4 Correct 25 ms 360 KB Correct.
5 Correct 27 ms 356 KB Correct.
6 Correct 6 ms 1052 KB Correct.

Subtask #4
0.0 / 19.0

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

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 484 KB Correct.
2 Correct 26 ms 340 KB Correct.
3 Correct 25 ms 452 KB Correct.
4 Correct 25 ms 1260 KB Correct.
5 Correct 21 ms 340 KB Correct.

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 404 KB Correct.
2 Correct 24 ms 420 KB Correct.
3 Correct 40 ms 7804 KB Correct.
4 Correct 15 ms 1108 KB Correct.
5 Correct 22 ms 340 KB Correct.
6 Correct 26 ms 464 KB Correct.

Subtask #7
0.0 / 29.0

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

Subtask #8
0.0 / 3.0

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