# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
305205 | oleksg | Mobile (BOI12_mobile) | C++14 | 1097 ms | 57056 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <fstream>
#include <string>
#include <iostream>
#include <math.h>
#include <algorithm>
#include<bits/stdc++.h>
#include <vector>
using namespace std;
long long n, l;
vector<pair<long long, long long>> points;
bool ok(double cur){
vector<pair<double, double>> segs;
for (int x = 0; x < points.size(); x++){
double curx = points[x].first;
double cury = abs(points[x].second);
double xintervals = sqrt(pow(cur, 2) - pow(cury, 2));
double minx = max((double)0, curx - xintervals);
double maxx = min((double)l, curx + xintervals);
segs.push_back(make_pair(minx, maxx));
}
sort(segs.begin(), segs.end());
double curx = 0;
for (int x = 0; x < segs.size(); x++){
if (segs[x].second > curx){
if (segs[x].first <= curx){
curx = segs[x].second;
}
else{
return false;
}
}
}
if (curx < l){
return false;
}
return true;
}
int main(){
long long one, two;
cin >> n >> l;
for (int x = 0; x < n; x++){
cin >> one >> two;
points.push_back(make_pair(one, two));
}
double mi = 0;
double ma = 100000000000;
while(ma - mi > 0.00001){
double cur = (mi + ma) / 2.0;
if (ok(cur)){
ma = cur;
}
else{
mi = cur + 0.00001;
}
}
cout << setprecision(10) << ma << "\n";
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |