Submission #753001

#	Time	Username	Problem	Language	Result	Execution time	Memory
753001		MohamedFaresNebili	Cyberland (APIO23_cyberland)	C++17	49 / 100	58 ms	9688 KiB

cyberland

#include <bits/stdc++.h>

        using namespace std;
        using ll = long long;
        using pi = pair<double, pair<int, int>>;

        const ll M = 1000000000000000005;
        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 + 1, 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) {
                      if(d[v.first] > D) {
                          d[v.first] = D;
                          if(v.first != h) pq.push({d[v.first], {t, v.first}});
                      }
                    }
                    else {
                      if(t > 0) D /= 2.0, t--;
                      else continue;
                      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: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 0 / 19
• Subtask 5: 7 / 7
• Subtask 6: 16 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3