Submission #1171062

#TimeUsernameProblemLanguageResultExecution timeMemory
1171062AlgorithmWarriorBalloons (CEOI11_bal)C++20
50 / 100
2095 ms1660 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...