| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1171062 | AlgorithmWarrior | Balloons (CEOI11_bal) | C++20 | 2095 ms | 1660 KiB |
#include <bits/stdc++.h>
using namespace std;
int const MAX=2e5+5;
long double x[MAX],r[MAX];
int main()
{
int n;
cin>>n;
int i,j;
for(i=1;i<=n;++i){
cin>>x[i]>>r[i];
for(j=1;j<i;++j){
long double dif=x[i]-x[j];
long double rnou=(dif*dif)/(r[j]*4);
if(rnou<r[i])
r[i]=rnou;
}
}
for(i=1;i<=n;++i)
cout<<fixed<<setprecision(3)<<r[i]<<'\n';
return 0;
}
| # | 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... | ||||
