Submission #970593

#TimeUsernameProblemLanguageResultExecution timeMemory
970593SuPythonyCyberland (APIO23_cyberland)C++17
8 / 100
885 ms2097152 KiB
#include "cyberland.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; vector<vector<pair<int,int>>> al; double ans; void dfs(int i, int p, double c, int f, vector<int> a) { if (i==f) { ans=c; return; } for (auto v: al[i]) { if (v.first==p) continue; dfs(v.first,i,v.second+a[i]*c,f,a); } } double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> a) { ans=-1; al.assign(N,vector<pair<int,int>>()); for (int i=0; i<M; i++) { al[x[i]].push_back({y[i],(double)c[i]}); al[y[i]].push_back({x[i],(double)c[i]}); } dfs(0,-1,0,H,a); return ans; }
#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...