Submission #1095831

#TimeUsernameProblemLanguageResultExecution timeMemory
1095831Omar_ElgedawyBalloons (CEOI11_bal)C++17
100 / 100
130 ms8688 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define ld long double #define F first #define S second #define el '\n' #define cout(x) for(auto v:x)cout<<v<<el #define coutp(x) for(auto v:x)cout<<v.F<<' '<<v.S<<el #define cin(x) for(auto &v:x)cin>>v; #define pb(x) push_back(x) #define all(x) x.begin(),x.end() const int N = 5e3 + 5, M = 1e2 + 5, Mod = 1e9 + 7; int dx[8] = {1, -1, 0, 0, 1, -1, 1, -1}; int dy[8] = {0, 0, 1, -1, 1, -1, -1, 1}; int nxt() { int x; cin >> x; return x; } ld calc(ld a,pair<ld,ld>b) { return (a-b.F)*(a-b.F)/(4*b.S); } void solve(int h) { int n; cin>>n; stack<pair<ld,ld>>st; vector<ld>ans; for(int i=0;i<n;i++) { ld x,r; cin>>x>>r; while(st.size()) { auto t=st.top(); r=min(r,calc(x,t)); if(r>=t.S)st.pop(); else break; } st.emplace(x,r); ans.push_back(r); } cout<<fixed<<setprecision(3); cout(ans); } int32_t main() { // #ifndef ONLINE_JUDGE // freopen("input.txt", "r" , stdin); // freopen("output.txt", "w", stdout); // freopen("feast.in", "r", stdin); // freopen("feast.out", "w", stdout); // #endif ios_base::sync_with_stdio(false); cin.tie(NULL); int tc = 1; // cin >> tc; for (int i = 1; i <= tc; i++)solve(i); 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...