Submission #1202334

#	Time	Username	Problem	Language	Result	Execution time	Memory
1202334		PlayVoltz	Balloons (CEOI11_bal)	C++20	100 / 100	87 ms	8520 KiB

bal

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, a, b;
	cin>>n;
	stack<int> st;
	vector<long double> ans(n), vect(n);
	for (int i=0; i<n; ++i){
		cin>>a>>b;
		vect[i]=a;
		ans[i]=b;
		while (st.size()){
			ans[i]=min(ans[i], (vect[st.top()]-vect[i])*(vect[st.top()]-vect[i])/(4*ans[st.top()]));
			if (ans[i]>ans[st.top()])st.pop();
			else break;
		}
		st.push(i);
	}
	for (auto a:ans)cout<<fixed<<setprecision(3)<<a<<"\n";
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10