# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
741429 | abcvuitunggio | timeismoney (balkan11_timeismoney) | C++17 | 4 ms | 644 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct edge{
int u,v,t,c;
}e[10001];
int n,m,p[201],sz[201],mn=1e18,rest,last;
vector <int> v;
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;
}
pair <int, int> calc(int x){
int time=0,cost=0;
for (int i=0;i<n;i++){
p[i]=i;
sz[i]=1;
}
v.clear();
for (int i=1;i<=m;i++){
if (time+e[i].t>x)
continue;
int y=unite(e[i].u,e[i].v);
time+=y*e[i].t;
cost+=y*e[i].c;
if (y)
v.push_back(i);
}
return {time,cost};
}
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;
last+=e[i].t;
}
sort(e+1,e+m+1,[](edge a, edge b){return a.t*a.c<b.t*b.c;});
while (true){
auto [t,c]=calc(last);
if (v.size()<n-1)
break;
if (t*c<mn){
mn=t*c;
rest=last;
}
last=t-1;
}
auto [t,c]=calc(rest);
cout << t << ' ' << c << '\n';
for (int i:v)
cout << e[i].u << ' ' << e[i].v << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |