| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366296 | backer8002 | Astronomer (BOI23_astronomer) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K,N,S,T;
cin >> K >> N >> S >> T;
vector<complex<double>> points(N);
for (auto& p : points) {
int x,y;
cin >> x >> y;
p = {x,y};
}
double minR = DBL_MAX;
for (int i = 0; i < N; i++) {
vector pointsSpecial = points;
ranges::sort(pointsSpecial,[&points,i](auto f, auto s)->bool {
return abs(f-points[i]) < abs(s-points[i]);
});
const complex<double> mid = accumulate(pointsSpecial.begin()+1,pointsSpecial.begin()+K,points[i],[](complex<double> f,complex<double> s)->complex<double> {
return (f + s)/complex<double>{2,0};
});
const double radius = accumulate(pointsSpecial.begin(),pointsSpecial.begin()+K,0.,[mid](double r, complex<double> s) -> double {
return max(r,abs(s-mid));
});
minR = min(minR,radius);
}
cout << setprecision(12) << minR*T;
}
Compilation message (stderr)
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
