Submission #1202146

#TimeUsernameProblemLanguageResultExecution timeMemory
1202146ezzzayCyberland (APIO23_cyberland)C++20
8 / 100
1510 ms2162688 KiB
#include <vector> #include<bits/stdc++.h> using namespace std; #define pb push_back #define ll double const int MX=3e5; vector< pair<int,ll> >v[MX]; ll dst[MX]; void dfs(int a, int p){ for(auto [b,c] : v[a]){ if(b==p)continue; dst[b]=dst[a]+c; dfs(b,a); } } double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) { for(int i=0;i<N;i++){ dst[i]=0; v[i].clear(); } for(int i=0;i<M;i++){ v[x[i]].pb({y[i],c[i]}); v[y[i]].pb({x[i],c[i]}); } dfs(0,-1); return dst[H]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...