Submission #741732

#TimeUsernameProblemLanguageResultExecution timeMemory
741732abcvuitunggiotimeismoney (balkan11_timeismoney)C++17
100 / 100
442 ms644 KiB
#include <bits/stdc++.h> #define int long long #define pii pair <int, int> #define fi first #define se second using namespace std; struct edge{ int u,v,t,c; }e[10001]; int n,m,p[201],sz[201],mn=1e18; vector <edge> v,res; pii q; int f(int i){ return (p[i]==i?i:p[i]=f(p[i])); } int unite(int i, int j){ i=f(i); j=f(j); if (i==j) return 0; if (sz[i]<sz[j]) swap(i,j); p[j]=i; sz[i]+=sz[j]; return 1; } int A,B; pii calc(int a, int b){ int t=0,c=0; A=a,B=b; for (int i=0;i<n;i++){ p[i]=i; sz[i]=1; } sort(e+1,e+m+1,[](edge x, edge y){return x.t*A+x.c*B<y.t*A+y.c*B;}); v.clear(); for (int i=1;i<=m;i++) if (unite(e[i].u,e[i].v)){ v.push_back(e[i]); t+=e[i].t; c+=e[i].c; } if (mn>t*c){ mn=t*c; q={t,c}; res=v; } return {t,c}; } void g(pii a, pii b){ auto c=calc(a.se-b.se,b.fi-a.fi); if ((c.se-a.se)*(b.fi-a.fi)==(b.se-a.se)*(c.fi-a.fi)) return; g(a,c); g(c,b); } int32_t main(){ ios_base::sync_with_stdio(NULL);cin.tie(nullptr); cin >> n >> m; for (int i=1;i<=m;i++) cin >> e[i].u >> e[i].v >> e[i].t >> e[i].c; g(calc(1,0),calc(0,1)); cout << q.first << ' ' << q.second << '\n'; for (auto e:res) cout << e.u << ' ' << e.v << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...