Submission #622946

#TimeUsernameProblemLanguageResultExecution timeMemory
622946inksamuraiMag (COCI16_mag)C++17
12 / 120
355 ms201680 KiB
#include <bits/stdc++.h> #define int ll using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define vec(...) vector<__VA_ARGS__> #define _3SgiE60 ios::sync_with_stdio(0),cin.tie(0) typedef long long ll; using pii=pair<int,int>; using vi=vector<int>; void print(){cout<<'\n';} template<class h,class...t> void print(const h&v,const t&...u){cout<<v<<' ',print(u...);} // e const int inf=1e13; pii compare(const pii&l,const pii&r){ return l.fi*r.se<r.fi*l.se?l:r; } signed main(){ _3SgiE60; int n; cin>>n; vec(vi) adj(n); rep(i,n-1){ int u,v; cin>>u>>v; u-=1,v-=1; adj[u].pb(v); adj[v].pb(u); } vi a(n); rep(i,n){ cin>>a[i]; } pii pns={inf,1}; auto dfs=[&](auto self,int v,int par)->pii{ pii q={inf,1}; for(auto &u:adj[v]){ if(u==par) continue; pii p=self(self,u,v); if(q.fi!=inf and q.fi*a[v]<inf/p.fi){ pii now={q.fi*p.fi*a[v],p.se+q.se+1}; pns=compare(pns,now); } q=compare(q,pii(p.fi*a[v],p.se+1)); { pii now={p.fi*a[v],p.se+1}; pns=compare(pns,now); } } q=compare(q,pii(a[v],1)); return q; }; dfs(dfs,0,-1); int g=gcd(pns.fi,pns.se); pns.fi/=g; pns.se/=g; cout<<pns.fi<<"/"<<pns.se<<"\n"; // print(pns.fi,pns.se); }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...