# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
228191 | urd05 | timeismoney (balkan11_timeismoney) | C++14 | 2098 ms | 640 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>
using namespace std;
int n,m;
struct Edge {
int s,e,t,c;
};
Edge edge[10000];
int one,two;
bool comp(Edge a,Edge b) {
return one*a.t+two*a.c<one*b.t+two*b.c;
}
int p[200];
int find(int a) {
if (p[a]<0) {
return a;
}
p[a]=find(p[a]);
return p[a];
}
void merge(int a,int b) {
a=find(a);
b=find(b);
if (a==b) {
return;
}
p[b]=a;
}
int main(void) {
scanf("%d %d\n",&n,&m);
for(int i=0;i<m;i++) {
scanf("%d %d %d %d\n",&edge[i].s,&edge[i].e,&edge[i].t,&edge[i].c);
}
int opt1=-1;
int opt2=-1;
long long ret1=1e6;
long long ret2=1e6;
for(int i=0;i<256*n;i++) {
for(int j=0;j<256*n;j++) {
one=i;
two=j;
sort(edge,edge+m,comp);
memset(p,-1,sizeof(p));
long long tsum=0;
long long csum=0;
for(int k=0;k<m;k++) {
if (find(edge[k].s)!=find(edge[k].e)) {
merge(edge[k].s,edge[k].e);
tsum+=edge[k].t;
csum+=edge[k].c;
}
}
if (tsum*csum<ret1*ret2) {
opt1=i;
opt2=j;
ret1=tsum;
ret2=csum;
}
}
}
printf("%d %d\n",ret1,ret2);
one=opt1;
two=opt2;
sort(edge,edge+m,comp);
memset(p,-1,sizeof(p));
for(int i=0;i<m;i++) {
if (find(edge[i].s)!=find(edge[i].e)) {
merge(edge[i].s,edge[i].e);
printf("%d %d\n",edge[i].s,edge[i].e);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |