# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
114800 | luciocf | Mobile (BOI12_mobile) | C++14 | 118 ms | 640 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
const int maxn = 5e3+10;
typedef pair<double, double> pt;
pt p[maxn];
pt get(pt a, pt b)
{
if (b.ff == a.ff) return {0.00, 0.00};
double p = (b.ss*b.ss - a.ss*a.ss)/(b.ff-a.ff);
double q = a.ff + b.ff;
return {(p+q)/2.00, 0.00};
}
double dist(pt a, pt b)
{
double d1 = a.ff-b.ff;
double d2 = a.ss-b.ss;
return sqrt(d1*d1 + d2*d2);
}
int main(void)
{
int n, L;
scanf("%d %d", &n, &L);
for (int i = 1; i <= n; i++)
scanf("%lf %lf", &p[i].ff, &p[i].ss);
double aux1 = 2e18+10, aux2 = 2e18+10;
for (int i = 1; i <= n; i++)
{
aux1 = min(aux1, dist({0.00, 0.00}, p[i]));
aux2 = min(aux2, dist({L, 0.00}, p[i]));
}
double ans = max(aux1, aux2);
for (int i = 1; i <= n; i++)
{
for (int j = i+1; j <= n; j++)
{
pt limit = get(p[i], p[j]);
ans = max(ans, min(dist(limit, p[i]), dist(limit, p[j])));
}
}
printf("%.9lf\n", ans);
}
컴파일 시 표준 에러 (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... |