//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
//#include <cstdio>
//#include <iostream>
using namespace std;
#define MAX 100007
#define pb push_back
#define mp make_pair
#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>>
const int mod = 2019201997;
const int INF = 1e18;
// myMap.begin()->first : key
// myMap.begin()->second : value
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;ans%=mod;a%=mod;b>>=1;}return ans%mod;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod))%mod;}
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
struct DSU {
vi e,sayi; void init(int N) { e = vi(N,-1); sayi = vi(N);}
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool sameSet(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) { // union by size
x = get(x), y = get(y); if (x == y) return 0;
if (e[x] > e[y]) swap(x,y);
e[x] += e[y]; e[y] = x; sayi[x]+=sayi[y]; return 1;
}
};
long double calc(int a,int b)
{
long double ans =(long double) epow(a,2);
ans /= (long double)4*b;
return ans;
}
void solve()
{
int n; cin >> n;
vector<pair<int,long double>> v(n+2);
for(int i=1;i<=n;i++) cin >> v[i].f >> v[i].s;
cout << fixed << setprecision(9);
stack<int> st;
vector<long double> ans(n+2,INF);
for(int i=1;i<=n;i++)
{
ans[i]=(long double)v[i].s;
while(st.size())
{
int node=st.top();
ans[i]=min(ans[i],calc(v[i].f-v[node].f,ans[node]));
if(ans[i]>=ans[node]) st.pop();
else break;
}
st.push(i);
}
for(int i=1;i<=n;i++) printf("%.3Lf\n",ans[i]);
return;
}
int32_t main() {
// freopen("walk.in", "r", stdin);
// freopen("walk.out", "w", stdout);
ios_base::sync_with_stdio(0);cin.tie(0);
int t=1;
// cin >> t;
while (t--) solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
600 KB |
8th numbers differ - expected: '8.7410000000', found: '9.0910000000', error = '0.3500000000' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
2nd numbers differ - expected: '252735385.4379999936', found: '1.0690000000', error = '252735384.3689999878' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
13th numbers differ - expected: '2.3960000000', found: '2.4500000000', error = '0.0540000000' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
600 KB |
3rd numbers differ - expected: '121.0000000000', found: '121.0020000000', error = '0.0020000000' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
10 ms |
1628 KB |
44th numbers differ - expected: '165.0000000000', found: '165.0020000000', error = '0.0020000000' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
25 ms |
3928 KB |
250th numbers differ - expected: '15134.0000000000', found: '2757.4340000000', error = '12376.5660000000' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
87 ms |
7508 KB |
282nd numbers differ - expected: '7638.0000000000', found: '2641.9890000000', error = '4996.0110000000' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
94 ms |
8260 KB |
511th numbers differ - expected: '4494.0050000000', found: '4494.0070000000', error = '0.0020000000' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
78 ms |
11012 KB |
165th numbers differ - expected: '1698.9980000000', found: '1699.0000000000', error = '0.0020000000' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
115 ms |
13684 KB |
249th numbers differ - expected: '2683.0090000000', found: '2683.0110000000', error = '0.0020000000' |
2 |
Halted |
0 ms |
0 KB |
- |