Submission #752973

#	Time	Username	Problem	Language	Result	Execution time	Memory
752973		MohamedFaresNebili	Cyberland (APIO23_cyberland)	C++17	0 / 100	76 ms	6256 KiB

cyberland

#include <bits/stdc++.h>
 
        using namespace std;
        using ll = long long;
 
        const ll M = 10000000000000000;
 
        long double solve(int n, int m, int k, int h, vector<int> x,
                     vector<int> y, vector<int> c, vector<int> arr) {
            long 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<long double, int>,
            vector<pair<long double, int>>, greater<pair<long double, int>>> pq;
            pq.push({0, 0});
            while(!pq.empty()) {
                long double w = pq.top().first;
                int u = pq.top().second; pq.pop();
                for(auto v : adj[u]) {
                    long 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: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3