oj.uz

답안 #374291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
374291 2021-03-07T07:01:15 Z Vimmer Odašiljači (COCI20_odasiljaci) C++14
42 / 70
 1000 ms 512 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")

#define N 1005
#define NN 1005000
#define PB push_back
#define M ll(1e9 + 7)
#define all(x) x.begin(), x.end()
#define sz(x) int(x.size())
#define pri(x) cout << x << endl
#define endl '\n'
#define _ << " " <<
#define F first
#define S second

using namespace std;
//using namespace __gnu_pbds;

//typedef tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> oredered_set;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef short int si;

int n, pr[N];

int fnd(int x)
{
    if (pr[x] != x)
        pr[x] = fnd(pr[x]);

    return pr[x];
}

void link(int a, int b)
{
    a = fnd(a); b = fnd(b);

    if (a == b) return;

    pr[b] = a;
}

int x[N], y[N];

ld eps = 1e-16;

bool gd(ld r)
{
    r += r;

    r *= r;

    for (int i = 0; i < n; i++)
        pr[i] = i;

    for (int i = 0; i < n; i++)
        for (int j = i + 1; j < n; j++)
        {
            ld rst = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);

            if (r - rst >= eps)
                link(i, j);
        }

    for (int i = 1; i < n; i++)
        if (fnd(i) != fnd(0))
            return 0;

    return 1;
}

int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //freopen("1.in", "r", stdin);

    cin >> n;

    for (int i = 0; i < n; i++)
        cin >> x[i] >> y[i];

    ld l = 0, r = 100 * 1e9;

    int c = 250;

    while (c)
    {
        c--;

        ld md = (l + r) / 2.0;

        if (gd(md))
            r = md;
                else l = md;
    }

    cout << setprecision(7) << fixed;

    pri(l);
}

Subtask #1
42.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Incorrect 12 ms 364 KB Output isn't correct
5 Incorrect 24 ms 364 KB Output isn't correct
6 Correct 183 ms 364 KB Output is correct
7 Correct 189 ms 512 KB Output is correct
8 Correct 397 ms 492 KB Output is correct
9 Execution timed out 1073 ms 364 KB Time limit exceeded
10 Execution timed out 1069 ms 364 KB Time limit exceeded