# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
964998 |
2024-04-18T02:47:16 Z |
pcc |
Mobile (BOI12_mobile) |
C++17 |
|
1000 ms |
83752 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
#define ld long double
#define pld pair<ld,ld>
const int mxn = 1e6+10;
ll N,L;
pair<ll,ll> arr[mxn];
inline bool check(ld r){
vector<pld> v;
for(int i = 0;i<N;i++){
if(r<arr[i].sc)continue;
v.push_back(pld(arr[i].fs-sqrt(r*r-arr[i].sc*arr[i].sc),arr[i].fs+sqrt(r*r-arr[i].sc*arr[i].sc)));
}
sort(v.begin(),v.end());
ld pre = 0;
for(auto &i:v){
if(pre>L)return true;
if(pre<i.fs)return false;
pre = max(pre,i.sc);
}
return pre>L;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ld l = 0,r = 2e9;
cin>>N>>L;
for(int i = 0;i<N;i++)cin>>arr[i].fs>>arr[i].sc;
for(int i = 0;i<60;i++){
ld mid = (l+r)/2;
if(check(mid))r = mid;
else l = mid;
}
cout<<fixed<<setprecision(10)<<l<<'\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
4 |
Correct |
1 ms |
504 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
13 ms |
756 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
33 ms |
1008 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
27 ms |
1008 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
1280 KB |
Output is correct |
2 |
Correct |
27 ms |
1040 KB |
Output is correct |
3 |
Correct |
33 ms |
1008 KB |
Output is correct |
4 |
Incorrect |
30 ms |
1028 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
237 ms |
10500 KB |
Output is correct |
2 |
Correct |
566 ms |
11068 KB |
Output is correct |
3 |
Correct |
372 ms |
6980 KB |
Output is correct |
4 |
Incorrect |
576 ms |
11472 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
545 ms |
10532 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
429 ms |
11144 KB |
Output is correct |
2 |
Correct |
633 ms |
11004 KB |
Output is correct |
3 |
Correct |
861 ms |
11252 KB |
Output is correct |
4 |
Incorrect |
738 ms |
11828 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
608 ms |
11564 KB |
Output is correct |
2 |
Correct |
809 ms |
11612 KB |
Output is correct |
3 |
Execution timed out |
1050 ms |
10992 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
482 ms |
11472 KB |
Output is correct |
2 |
Correct |
801 ms |
11336 KB |
Output is correct |
3 |
Execution timed out |
1032 ms |
11328 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1055 ms |
45200 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1054 ms |
49260 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1020 ms |
66552 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1025 ms |
71884 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1051 ms |
69852 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1037 ms |
73784 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1026 ms |
72476 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1038 ms |
77844 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1033 ms |
73976 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1020 ms |
83752 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |