| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 492187 | darkowl | Balloons (CEOI11_bal) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/// I in it to win it !
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define F first
#define S second
#define mp make_pair
#define pii pair<int, int>
#define pb push_back
#define pf push_front
#define arr_fill(a, n) for(ll i = 0 ; i < n ; i++){cin >> a[i];}
#define arr_fill_sum(a,n,sum) for (ll i = 0 ; i < n ; i++){cin >> a[i];sum+=a[i];}
#define arr_out(a,n) for (ll i = 0 ; i < n ; i++){cout << a[i] <<" ";}
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const ll MAXN = 1e6 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
ll pw(ll a, ll b){return b == 0 ? 1LL : (pw(a * a , b / 2) * (b % 2 == 0 ? 1LL : a));}
stack < int > s;
double x[MAXN], r[MAXN];
void solve ()
{
int n; cin >> n ;
cout << fixed << setprecision(3);
for(int i = 0; i < n; i++)
{
cin >> x[i] >> r[i];
if (s.empty())
{s.push(i); cout << fixed << setprecision(3) << r[i] <<"\n";continue;}
long double vd =((double)(pw(x[i], 2)- pw(x[s.top()], 2))/(4 * r[s.top()]));
///cout <<"vd : " << vd <<"\n";
if (vd >= r[i])
{cout << fixed << setprecision(3) << r[i] <<"\n";}
else
{cout << fixed << setprecision(3) << vd <<"\n";s.push(i);}
}
}