## Submission #314057

# Submission time Handle Problem Language Result Execution time Memory
314057 2020-10-18T03:26:31 Z shrek12357 Mobile (BOI12_mobile) C++14
0 / 100
1000 ms 18816 KB
```#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define ll long long
//cin.tie(0); ios_base::sync_with_stdio(0);

int n, l;
vector<pair<int, int>> points;

bool check(double mid) {
double left = 0;
for (int i = 0; i < points.size(); i++) {
double temp = sqrt(mid*mid - points[i].second*points[i].second);
if (points[i].first - temp <= left) {
left = points[i].first + temp;
}
}
return left >= l;
}

int main() {
cin >> n >> l;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
points.push_back({ a, b });
}
sort(points.begin(), points.end());
double lo = 0;
double hi = 1e10;
double ans = 1e10;
while (hi - lo > 1e-3) {
double mid = (lo + hi) / 2;
if (check(mid)) {
ans = min(ans, mid);
hi = mid;
}
else {
lo = mid;
}
}
cout << ans << endl;
}```

### Compilation message

```mobile.cpp: In function 'bool check(double)':
mobile.cpp:22:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
22 |  for (int i = 0; i < points.size(); i++) {
|                  ~~^~~~~~~~~~~~~~~```

#### Subtask #1 0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 512 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 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

#### Subtask #3 0 / 4.0

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

#### Subtask #4 0 / 4.0

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

#### Subtask #5 0 / 4.0

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

#### Subtask #6 0 / 5.0

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

#### Subtask #7 0 / 5.0

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

#### Subtask #8 0 / 5.0

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

#### Subtask #9 0 / 5.0

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

#### Subtask #10 0 / 5.0

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

#### Subtask #11 0 / 5.0

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

#### Subtask #12 0 / 5.0

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

#### Subtask #13 0 / 5.0

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

#### Subtask #14 0 / 5.0

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

#### Subtask #15 0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1030 ms 17644 KB Time limit exceeded
2 Halted 0 ms 0 KB -

#### Subtask #16 0 / 5.0

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

#### Subtask #17 0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 17616 KB Time limit exceeded
2 Halted 0 ms 0 KB -

#### Subtask #18 0 / 5.0

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

#### Subtask #19 0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 18668 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 1061 ms 17016 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 1081 ms 18816 KB Time limit exceeded
2 Halted 0 ms 0 KB -