| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1342356 | Jakub_Wozniak | Astronomer (BOI23_astronomer) | C++20 | 2 ms | 448 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll oo = (1e+18);
const int maxn = 1000009;
ll x[maxn] , y[maxn];
ll t , s;
int k , n;
ld dis(ld X , ld Y)
{
return sqrtf128(X*X + Y*Y);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> k >> n >> s >> t;
for(int i = 1; i <= n ; i++)cin >> x[i] >> y[i];
if(t <= s) // nie oplaca sie przesuwac
{
vector <ld> V;
for(int i = 1 ; i <= n ; i++)
{
V.push_back(dis(x[i],y[i])*((ld)t));
}
sort(V.begin() , V.end());
cout << setprecision(8) << fixed << V[k-1] << '\n';
exit(0);
}
return 0;
}Compilation message (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... | ||||
