Submission #1126283

#	Time	Username	Problem	Language	Result	Execution time	Memory
1126283		psm9352	Cyberland (APIO23_cyberland)	C++20	15 / 100	26 ms	6980 KiB

cyberland

#include <vector>
#include <queue>
using namespace std;
double solve(int N, int M, int K, int H, vector<int> x, vector<int>y, vector<int> c, vector<int> arr){
    priority_queue<pair<double,int>,vector<pair<double,int>>,greater<pair<double,int>>> pq; // {val,node}
    vector<vector<pair<int,double>>> graph(N);
    for (int i = 0;i<M;i++){
        graph[x[i]].push_back({y[i],c[i]});
        graph[y[i]].push_back({x[i],c[i]});
    }
    pq.push({0.0,H});
    vector<double> ans(N,1e18);ans[H]=0;
    vector<int> visited(N,0);
    while(!pq.empty()){
        int node = pq.top().second;
        pq.pop();
        if (visited[node]){continue;}
        visited[node]=1;
        for (pair<int,double> next:graph[node]){
            if (ans[node]+next.second<ans[next.first]){
                ans[next.first]=next.second+ans[node];
                pq.push({ans[next.first],next.first});
            }
        }
    }

    queue<int> q;
    q.push(0);
    vector<bool> pos(N,0);
    for (int i = 0;i<N;i++){visited[i]=0;}
    while(!q.empty()){
        int node = q.front();q.pop();
        if(visited[node]){continue;}
        visited[node]=1;
        for (pair<int,double> next:graph[node]){
            if (arr[next.first]==0){pos[next.first]=1;}
            q.push(next.first);
        }
    }
    for (int i = 0;i<N;i++){
        if (i==H){continue;}
        if (pos[i]){ans[0]=min(ans[0],ans[i]);}
    }
    if (ans[0]>=1e18){return -1;}
    return ans[0];
}

• Subtask 1: 0 / 5
• Subtask 2: 8 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 7 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3