제출 #394903

#제출 시각아이디문제언어결과실행 시간메모리
394903ak2006Balloons (CEOI11_bal)C++14
100 / 100
184 ms16412 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using vb = vector<bool>; using vvb = vector<vb>; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; using vc = vector<char>; using vvc = vector<vc>; const ll mod = 1e9 + 7,inf = 1e18; const ld eps = 1e-3; #define pb push_back #define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n = 2e5 + 5; vvi a(n,vi(2)); int main() { fast; cin>>n; for (int i = 0;i<n;i++)cin>>a[i][0]>>a[i][1]; deque<pair<ld,ld>>st; for (int i = 0;i<n;i++){ if (st.empty()){ st.push_back({a[i][0],a[i][1]}); cout<<fixed<<setprecision(3)<<a[i][1]<<'\n'; continue; } else{ ld ri = a[i][1],xi = a[i][0]; while (!st.empty()){ ld rj = st.back().second,xj = st.back().first; ri = min(ri,((xj - xi) * (xj - xi)) / (4 * rj)); if ((ri - rj) < -eps)break; st.pop_back(); } st.push_back({xi,ri}); cout<<fixed<<setprecision(3)<<ri<<'\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...