# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849092 | 2023-09-14T05:17:59 Z | adhityamv | Cyberland (APIO23_cyberland) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long const int N=100000; vector<pair<int,ll>> edges[N]; bool visited[N]={}; double ans=0; void dfs(int u,int h){ if(u==h) return; for(auto v:edges[u]){ if(!visited[v.first]){ visited[v.first]=true; ans+=v.second; dfs(v,h); ans-=v.second; } } } double solve(int n,int m,int k,int h,vector<int> x,vector<int> y,vector<int> c,vector<int> a){ for(int i=0;i<m;i++){ edges[x[i]].push_back(make_pair(y[i],(ll) c[i])); edges[y[i]].push_back(make_pair(x[i],(ll) c[i])); } visited[0]=true; dfs(0,h); for(int i=0;i<n;i++){ edges[i].clear(); } return ans; }