Submission #1055443

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1055443	2024-08-12T19:35:14 Z	lucascgar	Mobile (BOI12_mobile)	C++17	16 / 100	1000 ms	8020 KB

mobile

#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-8;

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){

    double in=0, fi = min(l,p[t].first), me;
    long double sq=d*d;
    bool vl = dist({fi, 0}, p[t]) <= sq;
    if (!vl) 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,vl=1;
        }else in = me;
    }

    return fi;

}

double right(int t, double d){
    double in=min(l, p[t].first), fi = l, me;
    long double sq = d*d;


    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 = 3e9, 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);
            if (lf != -1) cv.emplace(lf, right(i, me));
        }

        double r=0;
        bool vl = 0;
        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

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct

Subtask #2
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	3 ms	348 KB	Output is correct
4	Correct	5 ms	468 KB	Output is correct

Subtask #3
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	600 KB	Output is correct
2	Incorrect	21 ms	656 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #4
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	604 KB	Output is correct
2	Correct	149 ms	796 KB	Output is correct
3	Correct	84 ms	600 KB	Output is correct
4	Correct	14 ms	600 KB	Output is correct

Subtask #5
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	820 KB	Output is correct
2	Correct	151 ms	604 KB	Output is correct
3	Correct	85 ms	604 KB	Output is correct
4	Correct	14 ms	604 KB	Output is correct

Subtask #6
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	24 ms	604 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	409 ms	6996 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	151 ms	5968 KB	Output is correct
2	Correct	145 ms	5208 KB	Output is correct
3	Correct	180 ms	6224 KB	Output is correct
4	Correct	183 ms	7312 KB	Output is correct
5	Execution timed out	1092 ms	3928 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #9
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1056 ms	7988 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1070 ms	2652 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #11
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1060 ms	2652 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #12
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1022 ms	4692 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #13
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1032 ms	4696 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #14
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1076 ms	6516 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #15
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1051 ms	4948 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #16
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1073 ms	5716 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #17
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1070 ms	5736 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #18
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1014 ms	6480 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #19
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1056 ms	6740 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #20
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1024 ms	8016 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #21
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1049 ms	8020 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Submission #1055443

Compilation message