Submission #658001

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
658001	2022-11-11T19:52:21 Z	chjiao	Mobile (BOI12_mobile)	C++14	8 / 100	398 ms	15956 KB

mobile

//Binary search the shortest length from the firehose
 
#include <bits/stdc++.h>
using namespace std;
 
#define fastio	ios_base::sync_with_stdio(false);cin.tie(0)
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
 
#define FOR(i,a,b) for(ll i=a;i<=b;i++)
#define FORB(i,a,b) for(ll i=a;i>=b;i--)
 
#define getbit(mask,i) ((mask>>(i))&1)
#define getnum(i) (1<<(i))
 
#define endl "\n"
#define sz(x) (int)size(x)
#define mp make_pair
using ll = long long;
const ll MOD1 = 1e9+7;
const ll MOD2 = 998244353;
const ll MN = 1e5;
const ll MAX = LLONG_MAX;
long double FLOAT_ERR = 1e-5;
long double first_true_float(long double lo, long double hi, function<bool(long double)> f) {
	// if none of the values in the range work, return hi + 1
	lo--;
	hi++;
	while (hi-lo > FLOAT_ERR) {
		long double mid =  (lo + hi) / 2.0f;
		if (f(mid)) {
			hi = mid;
		} else {
			lo = mid;
		}
	}
	return lo;
}
 
int main() {
    fastio;
	//freopen("XXX.in","r",stdin);
	// freopen("XXX.out","w",stdout);
    int N;
    ll L;
    cin >> N >> L;
    vector<pair<ll,ll>> input(N);
    for(int i=0; i<N; i++){
        cin >> input[i].first >> input[i].second;
    }
    // sort(input.begin(), input.end());
    cout << setprecision(6)<<first_true_float(1, 1.5e9, [&](long double x){
        long double left = 0;
        for(auto cell:input){
            if(x*x < cell.second*cell.second){
                continue;
            }
            long double diviation = sqrt(x*x - cell.second*cell.second);
        
            if((cell.first-diviation) <= left){
                left =max(left, cell.first+diviation);
            } 
        }
        return left >= L;

    }) << endl;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Incorrect	1 ms	340 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	340 KB	Output is correct
2	Incorrect	3 ms	340 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #7
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	1492 KB	Output is correct
2	Incorrect	28 ms	1492 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #8
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	1492 KB	Output is correct
2	Correct	22 ms	1364 KB	Output is correct
3	Incorrect	26 ms	1492 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #9
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	45 ms	1620 KB	Output is correct
2	Incorrect	42 ms	1492 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #10
0 / 5.0

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

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

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

Subtask #20
0 / 5.0

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

Subtask #21
0 / 5.0

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

Submission #658001

Compilation message