oj.uz

Submission #322626

# Submission time Handle Problem Language Result Execution time Memory
322626 2020-11-15T04:01:51 Z denverjin timeismoney (balkan11_timeismoney) C++14
100 / 100
 511 ms 844 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define mp make_pair
#define pb push_back

#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)

struct Edge {
    int u, v, a, b, c;
    Edge(int u, int v, int a, int b, int c):
        u(u), v(v), a(a), b(b), c(c) {}
    bool operator < (const Edge &o) const {
        return c != o.c ? c < o.c : (a != o.a ? a < o.a : b < o.b);
    }
};

struct Point {
    int x, y;
    vector <Edge> T;
    Point(): x(), y(), T() {}
    Point(int x, int y, vector <Edge> &T): x(x), y(y), T(T) {}
    bool operator < (const Point &o) const {
        return x != o.x ? x < o.x : y < o.y;
    }
    bool operator == (const Point &o) const {
        return x == o.x && y == o.y;
    }
    friend ostream &operator << (ostream &o, Point x) {
        return o << "(" << x.x << ", " << x.y << ")";
    }
};

struct UnionFind {
    vector <int> fa;
    UnionFind(int n): fa(n) {
        rep(i, n) fa[i] = i;
    }
    int find(int x) {
        return x == fa[x] ? x : fa[x] = find(fa[x]);
    }
    bool merge(int x, int y) {
        x = find(x), y = find(y);
        if (x == y) return 0;
        fa[x] = y;
        return 1;
    }
};

int n, m;
vector <Edge> E;
pair <int, Point> ans(0x3f3f3f3f, Point());

Point kruskal(int ka, int kb) {
    rep(i, m) E[i].c = E[i].a * ka + E[i].b * kb;
    sort(E.begin(), E.end());
    Point ans;
    UnionFind uf(n);
    rep(i, m) {
        if (uf.merge(E[i].u, E[i].v)) {
            ans.x += E[i].a;
            ans.y += E[i].b;
            ans.T.pb(E[i]);
        }
    }
    return ans;
}

void solve(Point A, Point B) {
    ans = min(ans, mp(A.x * A.y, A));
    ans = min(ans, mp(B.x * B.y, B));
    if (A.x > B.x || A.y < B.y) return ;
    Point C = kruskal(-(B.y - A.y), B.x - A.x);
    if (C == A || C == B) return ;
    solve(A, C); solve(C, B);
}

int main() {
    cin >> n >> m;
    rep(i, m) {
        int u, v, a, b;
        cin >> u >> v >> a >> b;
        E.pb(Edge(u, v, a, b, 0));
    }
    Point A = kruskal(1, 0);
    Point B = kruskal(0, 1);
    solve(A, B);
    cout << ans.second.x << " " << ans.second.y << endl;
    rep(i, ans.second.T.size())
        cout << ans.second.T[i].u << " " << ans.second.T[i].v << endl;
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 11 ms 736 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 6 ms 364 KB Output is correct
15 Correct 5 ms 492 KB Output is correct
16 Correct 63 ms 492 KB Output is correct
17 Correct 65 ms 492 KB Output is correct
18 Correct 61 ms 492 KB Output is correct
19 Correct 488 ms 804 KB Output is correct
20 Correct 511 ms 844 KB Output is correct