oj.uz

답안 #741725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
741725 2023-05-14T17:08:58 Z abcvuitunggio 시간이 돈 (balkan11_timeismoney) C++17
100 / 100
 445 ms 796 KB 
#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 <edge> v,res;
pair <int, int> 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;
pair <int, int> calc(int a, int b){
    int time=0,cost=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++){
        int y=unite(e[i].u,e[i].v);
        time+=y*e[i].t;
        cost+=y*e[i].c;
        if (y)
            v.push_back(e[i]);
    }
    if (mn>time*cost){
        mn=time*cost;
        q={time,cost};
        res=v;
    }
    return {time,cost};
}
void g(pair <int, int> a, pair <int, int> b){
    auto c=calc(a.second-b.second,b.first-a.first);
    if ((c.second-a.second)*(b.first-a.first)==(b.second-a.second)*(c.first-a.first))
        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;
        last+=e[i].t;
    }
    sort(e+1,e+m+1,[](edge a, edge b){return a.c<b.c;});
    g(calc(1,0),calc(0,1));
    cout << q.first << ' ' << q.second << '\n';
    for (auto e:res)
        cout << e.u << ' ' << e.v << '\n';
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 46 ms 420 KB Output is correct
17 Correct 48 ms 340 KB Output is correct
18 Correct 47 ms 420 KB Output is correct
19 Correct 412 ms 784 KB Output is correct
20 Correct 445 ms 796 KB Output is correct