oj.uz

Submission #679002

# Submission time Handle Problem Language Result Execution time Memory
679002 2023-01-07T07:32:43 Z vjudge1 timeismoney (balkan11_timeismoney) C++17
55 / 100
 10 ms 1108 KB 
#include <bits/stdc++.h>
using namespace std;

typedef complex<long long> point;
const long long INF = (long long)1e18;

long long dot(point a, point b) {
    return (conj(a) * b).real();
}
long long cross(point a, point b) {
    return (conj(a) * b).imag();
}

struct DSU {
    vector<int> f;
    DSU(int n) : f(n) { iota(f.begin(), f.end(), 0); }
    int leader(int x) {
        while (x != f[x]) {
            x = f[x] = f[f[x]];
        }
        return x;
    }
    bool unionize(int x, int y) {
        x = leader(x);
        y = leader(y);
        if (x == y) {
            return false;
        }
        f[y] = x;
        return true;
    }
};

int n, m;
vector<array<long long, 5>> edges0;

point f(point axis) { // find mst on axis
    vector<array<long long, 5>> edges = edges0;
    for (int i = 0; i < m; i++) {
        edges[i][4] = dot(axis, point(edges[i][2], edges[i][3]));
    }

    sort(edges.begin(), edges.end(), [&](auto x, auto y) {
        return x[4] > y[4];
    });

    point res(0, 0);
    DSU dsu(n);

    for (auto [u, v, a, b, w] : edges) {
        if (dsu.unionize(u, v)) {
            res += point(a, b);
        }
    }
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> m;
    edges0.resize(m);
    for (int i = 0; i < m; i++) {
        int u, v, a, b;
        cin >> u >> v >> a >> b;
        edges0[i] = {u, v, -a, -b, 0};
    }

    point l(1, 0);
    point r(0, 1);

    vector<array<point, 2>> S;

    function<void(point, point)> divide = [&](point l, point r) {
        point lp = f(l);
        point rp = f(r);
        point mid = -point(l.imag() - r.imag(), r.real() - l.real());
        point mp = f(mid);
        if (mp == lp || mp == rp) {
            S.push_back({lp, l});
            S.push_back({rp, r});
            return;
        }
        divide(l, mid);
        divide(mid, r);
    };
    divide(point(1, 0), point(0, 1));

    long long mn = INF;
    point ans;
    point key;
    for (auto [p, axis] : S) {
        long long prod = p.real() * p.imag();
        if (prod < mn) {
            ans = p;
            key = axis;
            mn = prod;
        }
    }

    ans *= -1;

    cout << ans.real() << " " << ans.imag() << "\n";

    vector<array<long long, 5>> edges = edges0;
    for (int i = 0; i < m; i++) {
        edges[i][4] = dot(key, point(edges[i][2], edges[i][3]));
    }

    sort(edges.begin(), edges.end(), [&](auto x, auto y) {
        return x[4] > y[4];
    });

    DSU dsu(n);

    for (auto [u, v, a, b, w] : edges) {
        if (dsu.unionize(u, v)) {
            cout << u << " " << v << "\n";
        }
    }
}

Subtask #1
55.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 5 ms 1108 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Incorrect 0 ms 212 KB Output isn't correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Correct 0 ms 212 KB Output is correct
14 Incorrect 1 ms 340 KB Output isn't correct
15 Incorrect 1 ms 340 KB Output isn't correct
16 Incorrect 2 ms 468 KB Output isn't correct
17 Incorrect 2 ms 468 KB Output isn't correct
18 Incorrect 3 ms 524 KB Output isn't correct
19 Incorrect 10 ms 1108 KB Output isn't correct
20 Incorrect 9 ms 1108 KB Output isn't correct