# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
920884 |
2024-02-03T07:17:54 Z |
Kams7 |
Mobile (BOI12_mobile) |
C++17 |
|
753 ms |
99496 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
double dist(double k, ll x, ll y){
if (k<y) return -1;
return sqrt(k*k - y*y);
}
bool check(ll n, double k, ll l, vector<pair<ll,ll>> v){
double mn = 0;
for (ll i=0; i<n; i++){
ll x = v[i].first, y = v[i].second;
double d = dist(k, x, y);
if (d==-1) continue;
if (x-d<=mn) mn = max(mn, x+d);
}
return mn>=l;
}
void solve(){
ll n, len; cin >> n >> len;
map<ll, ll> ys;
for (ll i=0; i<n; i++){
ll x, y; cin >> x >> y;
if (ys.find(x) == ys.end()) ys[x] = abs(y);
else ys[x] = min(ys[x], abs(y));
}
vector<pair<ll, ll>> v;
for (auto el: ys){
v.push_back(make_pair(el.first, el.second));
}
sort(v.begin(), v.end());
n = size(v);
ll l=0, r=2*100000000000000;
while (l<r){
ll mid = ((l+r)/2);
if (check(n, mid/10000.0, len, v)) r=mid;
else l=mid+1;
}
cout << l/10000.0 << "\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(NULL);
// your code goes here
// int t;
// cin >> t;
// while (t--)
solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
600 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
2 ms |
604 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Incorrect |
2 ms |
720 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
604 KB |
Output is correct |
2 |
Incorrect |
3 ms |
860 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
604 KB |
Output is correct |
2 |
Incorrect |
3 ms |
860 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
856 KB |
Output is correct |
2 |
Incorrect |
3 ms |
860 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
46 ms |
7632 KB |
Output is correct |
2 |
Incorrect |
41 ms |
6600 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
1364 KB |
Output is correct |
2 |
Correct |
30 ms |
4552 KB |
Output is correct |
3 |
Incorrect |
48 ms |
7900 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
51 ms |
9160 KB |
Output is correct |
2 |
Incorrect |
40 ms |
6232 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
44 ms |
5416 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
64 ms |
10792 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
335 ms |
49692 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
137 ms |
5712 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
406 ms |
60152 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
165 ms |
6036 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
485 ms |
70792 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
187 ms |
6924 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
577 ms |
80792 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
204 ms |
7828 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
753 ms |
99496 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
248 ms |
9332 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |