oj.uz

Submission #471647

# Submission time Handle Problem Language Result Execution time Memory
471647 2021-09-10T06:45:48 Z abc864197532 Odašiljači (COCI20_odasiljaci) C++17
70 / 70
 71 ms 8668 KB 
/*
 *   ##   #####   ####      ####  #    #  ####
 *  #  #  #    # #    #    #    # #    # #    #
 * #    # #####  #         #    # #    # #    #
 * ###### #    # #         #    # # ## # #    #
 * #    # #    # #    #    #    # ##  ## #    #
 * #    # #####   ####      ####  #    #  ####
 */
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define info() cout << __PRETTY_FUNCTION__ << ": " << __LINE__ << endl
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
    vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
    vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
    vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
    vvv() {}
};
#ifdef Doludu
#define test(args...) info(), abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#endif
const int mod = 998244353, N = 1000, logN = 20, K = 80000;

pii a[N];

struct edge {
    int u, v;
    double d;
    edge(int _u, int _v) : u(_u), v(_v), d(sqrt(1ll * (a[u].X - a[v].X) * (a[u].X - a[v].X) + 1ll * (a[u].Y - a[v].Y) * (a[u].Y - a[v].Y))) {}
    bool operator < (const edge &o) {
        return d < o.d;
    }
};

int dsu[N];

int Find(int x) {
    if (dsu[x] == x) return x;
    return dsu[x] = Find(dsu[x]);
}

void Union(int u, int v) {
    dsu[Find(u)] = Find(v);
}

int main () {
    owo;
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector <edge> E;
    for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) {
        E.pb(edge(i, j));
    }
    sort(all(E));
    iota(dsu, dsu + n, 0);
    double ans = 0;
    for (edge e : E) {
        if (Find(e.u) == Find(e.v)) continue;
        ans = e.d;
        Union(e.u, e.v);
    }
    cout << fixed << setprecision(10) << ans / 2 << endl;
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 13 ms 2488 KB Output is correct
7 Correct 16 ms 2480 KB Output is correct
8 Correct 32 ms 8656 KB Output is correct
9 Correct 70 ms 8668 KB Output is correct
10 Correct 71 ms 8640 KB Output is correct