oj.uz

답안 #930855

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930855 2024-02-20T13:53:37 Z Whisper Odašiljači (COCI20_odasiljaci) C++17
70 / 70
 88 ms 20940 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define double long double
int nPoint;
double x[MAX], y[MAX];
double dis(int i, int j){
    return sqrt((double)(x[i] - x[j]) * (x[i] - x[j]) + (double)(y[i] - y[j]) * (y[i] - y[j])) / 2.0;
}
vector<tuple<double, int, int>> edge;
struct Dsu{
    int n;
    vector<int> par, sz;
    Dsu(int _n){
        this -> n = _n;
        par.resize(n + 5);
        sz.resize(n + 5, 1);
        iota(par.begin(), par.end(), 0ll);
    }
    int Find(int u){
        return u == par[u] ? u : par[u] = Find(par[u]);
    }
    bool unite(int u, int v){
        u = Find(u), v = Find(v);
        if (u == v) return 0;
        if (sz[u] < sz[v]) swap(u, v);
        sz[u] += sz[v];
        par[v] = u;
        return 1;
    }
};
void Whisper(){
    cin >> nPoint;
    for (int i = 1; i <= nPoint; ++i) cin >> x[i] >> y[i];
    for (int i = 1; i <= nPoint; ++i){
        for (int j = i + 1; j <= nPoint; ++j){
            edge.emplace_back(dis(i, j), i, j);
        }
    }
    Dsu dsu(nPoint);
    sort(edge.begin(), edge.end());
    double ans = 0;
    for (tuple<double, int, int> x : edge){
        int u, v; double d;
        tie(d, u, v) = x;
        if (dsu.unite(u, v)) maximize(ans, d);
    }
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 24 ms 6868 KB Output is correct
7 Correct 24 ms 8660 KB Output is correct
8 Correct 53 ms 19912 KB Output is correct
9 Correct 88 ms 19404 KB Output is correct
10 Correct 84 ms 20940 KB Output is correct