Submission #1055482

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1055482	2024-08-12T19:59:38 Z	lucascgar	Mobile (BOI12_mobile)	C++17	30 / 100	1000 ms	70736 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-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(5);

    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){
        set<pdd> cv;
        me = (in+fi)/2.00;

        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);        
        }
        vl = vl || ((double)l-r > PRECISION);
        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	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct

Subtask #3
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	348 KB	Output is correct
2	Correct	38 ms	632 KB	Output is correct
3	Correct	3 ms	348 KB	Output is correct
4	Correct	40 ms	636 KB	Output is correct

Subtask #4
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	604 KB	Output is correct
2	Correct	98 ms	604 KB	Output is correct
3	Correct	46 ms	716 KB	Output is correct
4	Correct	9 ms	704 KB	Output is correct

Subtask #5
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	504 KB	Output is correct
2	Correct	96 ms	604 KB	Output is correct
3	Correct	47 ms	600 KB	Output is correct
4	Correct	9 ms	636 KB	Output is correct

Subtask #6
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	47 ms	604 KB	Output is correct
2	Correct	97 ms	604 KB	Output is correct
3	Correct	47 ms	560 KB	Output is correct
4	Correct	9 ms	604 KB	Output is correct
5	Correct	7 ms	604 KB	Output is correct

Subtask #7
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	432 ms	4360 KB	Output is correct
2	Execution timed out	1101 ms	5712 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #8
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	113 ms	3924 KB	Output is correct
2	Correct	103 ms	3660 KB	Output is correct
3	Correct	122 ms	3412 KB	Output is correct
4	Correct	121 ms	3408 KB	Output is correct
5	Correct	141 ms	3912 KB	Output is correct

Subtask #9
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1066 ms	6484 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	1060 ms	7388 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	1025 ms	5840 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	1055 ms	35412 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	1065 ms	35608 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	1069 ms	42692 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	1087 ms	42576 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	1045 ms	49748 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	1053 ms	49748 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	1034 ms	56656 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	1060 ms	56660 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	1029 ms	70736 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	1063 ms	52564 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Submission #1055482

Compilation message