| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 (추가 시간 없음) | 1024 MB | 76 | 51 | 44 | 70.968% |
Erik wants to run a marathon. Most of all, he wants to win the race. To plan his training, he has looked up how the other contestants performed in previous races and made a model to predict his chances of winning. The finishing time for each contestant is distributed uniformly at random in an interval $[a_i, b_i]$. What is the largest finishing time Erik can have while still having a 50ドル\%$ change of winning?
The first line contains an integer 1ドル \leq N \leq 10^5,ドル the number of other contestants. Then follows $N$ lines, each with two floating point values 0ドル \leq a_i \leq 10^5$ and $a_i \le b_i \leq 10^5$ with at exactly one decimal place, the start and end time in seconds for their finishing time.
A single floating point number, the largest finishing time in seconds that Erik needs to have a 50ドル\%$ chance of winning. The answer must be with a relative or absolute error of at most 10ドル^{-6}$.
| 번호 | 배점 | 제한 |
|---|---|---|
| 1 | 20 | No intervals overlap. |
| 2 | 80 | No further restrictions. |
1 1.0 3.0
2.0
3 0.0 10.0 3.5 6.7 2.2 4.5
2.883937700856755
Contest > Swedish Coding Cup > LTH Challenge 2022 D번