Submission #872443

#TimeUsernameProblemLanguageResultExecution timeMemory
872443sleepntsheepBalloons (CEOI11_bal)C++17
10 / 100
2057 ms6164 KiB
#include <iostream> #include <iomanip> #include <cmath> #include <cstring> #include <vector> #include <algorithm> #include <deque> #include <set> #include <utility> #include <array> using i64 = long long; using u64 = unsigned long long; using f64 = double; using f80 = long double; using namespace std; #define ALL(x) x.begin(), x.end() #define ShinLena cin.tie(nullptr)->sync_with_stdio(false); #define N 200005 int n, x[N], r[N]; f80 rr[N]; int main() { ShinLena; cin >> n; for (int i = 0; i < n; ++i) { cin >> x[i] >> r[i]; } rr[0] = r[0]; for (int i = 1; i < n; ++i) { f80 l = 1, r = ::r[i], iter = 100; for (; iter--;) { f80 m = (l+r)/2, ok = 1; for (int j = 0; ok && j < i; ++j) { f80 dy = abs(::rr[j] - m); f80 dx = x[i] - x[j]; f80 reco = sqrtl(dy * dy + dx * dx); if (reco < ::rr[j] + m) ok = 0; } if (ok) l = m; else r = m; } rr[i] = r; } cout << fixed << setprecision(3); for (int i = 0; i < n; ++i) cout << rr[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...