oj.uz

답안 #1055471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055471 2024-08-12T19:52:25 Z lucascgar Mobile (BOI12_mobile) C++17
26 / 100
 1000 ms 70740 KB 
#include <bits/stdc++.h>

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

/*
chutar resposta x:
p toda torre achar achar menor e maior ponto com distância menor que x
se intervalo tem algum ponto cego: x é válido
se não, nn é

achar pontos p torre: busca binária

*/

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); // overclock random

typedef pair<int,int> pii;
typedef pair<long long, long long> pll;
typedef pair<double, double> pdd;

const int MAXN = 1e6+10;
const double PRECISION = 1e-5;

long double dist(pdd a, pdd b){
    long double x = abs(a.first-b.first), y = abs(a.second-b.second);
    return x*x + y*y;
}

pii p[MAXN];
int l;
double left(int t, double d){
    if (p[t].first < 0) return 0;
    double in=0, fi = min(l,p[t].first), me;
    long double sq=d*d;
    
    if (dist({fi, 0}, p[t]) > sq) return -1;
    if (dist({0, 0}, p[t]) <= sq) return 0;

    while (fi-in>=PRECISION/10){
        
        me = (in+fi)/2.00;
        if (dist({me,0}, p[t]) <= sq){
            fi = me;
        }else in = me;
    }

    return fi;

}

double right(int t, double d){
    if (p[t].first > l) return l;

    double in=max(0, p[t].first), fi = l, me;
    long double sq = d*d;

    if (dist({in,0}, p[t]) > sq) return -1;
    if (dist({l, 0}, p[t]) <= sq) return l;

    while (fi-in>=PRECISION/10){
        me = (in+fi)/2.00;

        if (dist({me, 0}, p[t]) <= sq){
            in = me;
        }else fi = me;

    }
    return in;

}

signed main(){
    std::ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    // freopen("test.in", "r", stdin);
    // freopen("test.out", "w", stdout);
    cout << fixed << setprecision(6);

    int n;
    cin >> n >> l;

    for (int i=0;i<n;i++){
        cin >> p[i].first >> p[i].second;
    }

    double in=0, fi = 2e9, me;

    while (fi-in >= PRECISION){
        me = (in+fi)/2.00;
        set<pdd> cv;

        for (int i=0;i<n;i++){
            double lf = left(i, me), rg = right(i, me);
            if (lf != -1 && rg != -1) cv.emplace(lf, rg);
        }

        double r=0;
        bool vl = cv.empty();
        for (const pdd &x:cv){
            if (x.first > r && x.first-r > PRECISION){
                vl=1;
                break;
            }
            r = max(r, x.second);        
        }
        if (vl) in=me;
        else fi=me;

    }

    cout << in << '\n';

    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct

Subtask #3
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 520 KB Output is correct
2 Incorrect 35 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 600 KB Output is correct
2 Correct 97 ms 604 KB Output is correct
3 Correct 56 ms 600 KB Output is correct
4 Correct 9 ms 604 KB Output is correct

Subtask #5
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 604 KB Output is correct
2 Correct 97 ms 728 KB Output is correct
3 Correct 48 ms 604 KB Output is correct
4 Correct 9 ms 604 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 604 KB Output is correct
2 Correct 107 ms 796 KB Output is correct
3 Correct 48 ms 712 KB Output is correct
4 Correct 11 ms 604 KB Output is correct
5 Correct 9 ms 508 KB Output is correct

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 439 ms 4508 KB Output is correct
2 Execution timed out 1053 ms 5720 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 3924 KB Output is correct
2 Correct 103 ms 3688 KB Output is correct
3 Correct 123 ms 3408 KB Output is correct
4 Correct 123 ms 3432 KB Output is correct
5 Correct 140 ms 3804 KB Output is correct

Subtask #9
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1071 ms 6476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1066 ms 7248 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1071 ms 5720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1045 ms 35492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1034 ms 35664 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1026 ms 42620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1064 ms 42480 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1054 ms 49740 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1070 ms 49688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1008 ms 56912 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1046 ms 56660 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1048 ms 70740 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1071 ms 53588 KB Time limit exceeded
2 Halted 0 ms 0 KB -