oj.uz

Submission #656296

# Submission time Handle Problem Language Result Execution time Memory
656296 2022-11-06T18:37:02 Z chjiao Mobile (BOI12_mobile) C++14
0 / 100
 331 ms 16084 KB 
#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;


//first true float/double
long double FLOAT_ERR = 1e-7;
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);
	
	ll N, L;
	cin >> N >> L;
	vector<pair<ll, ll>> stations(N);
	FOR(i,0,N-1) {
		ll y;
		cin >> stations[i].first >> y;
		stations[i].second = y*y;
	}
	long double ans = first_true_float(0, 1e9, [&](long double mid) { 
		long double mx=0;
		long double dd=mid*mid, xx;
		for(auto station:stations) {
			if(dd-station.second<0) continue;
			xx=sqrt(dd-station.second);
			if(station.first-xx>mx) return false;
			mx = station.first+xx;
		}
		return mx>=L;
	});
	cout <<  fixed << setprecision(6) << ans << endl;

}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

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

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 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 Correct 32 ms 1876 KB Output is correct
2 Incorrect 26 ms 1964 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 8148 KB Output is correct
2 Correct 119 ms 8272 KB Output is correct
3 Correct 133 ms 8276 KB Output is correct
4 Incorrect 137 ms 8284 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

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

Subtask #20
0 / 5.0

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

Subtask #21
0 / 5.0

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