Submission #1126271

#	Time	Username	Problem	Language	Result	Execution time	Memory
1126271		psm9352	Cyberland (APIO23_cyberland)	C++20	8 / 100	1558 ms	2162688 KiB

cyberland

#include <vector>
#include <queue>
using namespace std;
void dfs(int par,int node, vector<vector<pair<int,double>>> &graph,vector<double> &ans,vector<int> &arr){
    for (pair<int,double> next:graph[node]){
        if (next.first==par){continue;}
        if (arr[next.first]==0){ans[next.first]=0;}
        else{ans[next.first]=ans[node]+next.second;}
        dfs(node,next.first,graph,ans,arr);
    }
}

double solve(int N, int M, int K, int H, vector<int> x, vector<int>y, vector<int> c, vector<int> arr){
    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]});
    }
    vector<double> ans(N,1e18);ans[0]=0;
    vector<bool> visited(N,0);
    dfs(-1,0,graph,ans,arr);
    if (ans[H]>=1e18){return -1;}
    return ans[H];
}

• Subtask 1: 0 / 5
• Subtask 2: 8 / 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