oj.uz

답안 #580739

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
580739 2022-06-21T17:50:06 Z Lobo 시간이 돈 (balkan11_timeismoney) C++17
100 / 100
 1058 ms 1352 KB 
#include<bits/stdc++.h>
using namespace std;
 
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
 
const int maxn = 220;
 
int n, m, ds[maxn], dsz[maxn];
pair<int,pair<int,int>> ans;
vector<pair<pair<int,int>,pair<int,int>>> edg;
vector<pair<int,int>> ansv;
 
int find(int u) {
    if(u == ds[u]) return u;
    return ds[u] = find(ds[u]);
}
 
void join(int u, int v) {
    if(dsz[u] < dsz[v]) swap(u,v);
    dsz[u]+= dsz[v];
    ds[v] = u;
}
 
pair<int,int> mst(int c1, int t1) {
    // priority_queue<pair<dbl,int>, vector<pair<dbl,int>>, greater<pair<dbl,int>>> pq;
    for(int i = 1; i <= n; i++) {
        ds[i] = i;
        dsz[i] = 1;
    }
    vector<pair<dbl,int>> edgs;
    for(int i = 0; i < edg.size(); i++) {
        int c = edg[i].sc.fr;
        int t = edg[i].sc.sc;
        // pq.push(mp(c*c1+t*t1,i));
        edgs.pb(mp(c*c1+t*t1,i));
    }
    sort(all(edgs));
 
    int C = 0;
    int T = 0;
    vector<pair<int,int>> curv;
    int i = 0;
    while((int) curv.size() != n-1) {
        int id = edgs[i++].sc;
        // pq.pop();
        int u = find(edg[id].fr.fr);
        int v = find(edg[id].fr.sc);
        int c = edg[id].sc.fr;
        int t = edg[id].sc.sc;
 
        if(u != v) {
            join(u,v);
            curv.pb(mp(edg[id].fr.fr,edg[id].fr.sc));
            C+= c;
            T+= t;
        }
    }
 
    if(ans.fr > C*T) {
        ans.fr = C*T;
        ans.sc = mp(C,T);
        swap(ansv,curv);
    }
    // cout << " " << c1 << " " << t1 << " " << C << " " << T << endl;
    return mp(C,T);
}
 
void dec(int cl, int tl, int cr, int tr) {
    // cout << cl << " " << tl << " " << cr << " " << tr << endl;
    int dc = cr-cl; // > 0
    int dt = tr-tl; // < 0
    auto aux = mst(dt,-dc);
    int c = aux.fr;
    int t = aux.sc;
    if(c == cl || c == cr) return;
    dec(cl,tl,c,t);
    dec(c,t,cr,tr);
}
 
void solve() {
    cin >> n >> m;
 
    for(int i = 1; i <= m; i++) {
        int u,v,c,t; cin >> u >> v >> c >> t;
        u++;
        v++;
        edg.pb(mp(mp(u,v),mp(c,t)));
    }
 
    ans.fr = inf1;
    pair<int,int> aux;
    aux = mst(0,1);
    int c0 = aux.fr;
    int t0 = aux.sc;
    aux = mst(1,0);
    int c1 = aux.fr;
    int t1 = aux.sc;
    dec(c0,t0,c1,t1);
 
    cout << ans.sc.fr << " " << ans.sc.sc << endl;
    for(auto x : ansv) {
        cout << x.fr-1 << " " << x.sc-1 << endl;
    }
}
 
int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);
 
    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }
 
}

Compilation message

timeismoney.cpp: In function 'std::pair<long long int, long long int> mst(long long int, long long int)':
timeismoney.cpp:40:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int i = 0; i < edg.size(); i++) {
      |                    ~~^~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 468 KB Output is correct
8 Correct 9 ms 1052 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 6 ms 340 KB Output is correct
15 Correct 5 ms 364 KB Output is correct
16 Correct 113 ms 468 KB Output is correct
17 Correct 121 ms 468 KB Output is correct
18 Correct 105 ms 468 KB Output is correct
19 Correct 998 ms 1352 KB Output is correct
20 Correct 1058 ms 1268 KB Output is correct