oj.uz

Submission #1023368

# Submission time Handle Problem Language Result Execution time Memory
1023368 2024-07-14T17:12:08 Z EkinOnal Balloons (CEOI11_bal) C++17
100 / 100
 106 ms 16156 KB 
//#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,long double 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("%.9Lf\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;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB 10 numbers

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB 2 numbers

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB 505 numbers

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1628 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 3420 KB 50000 numbers
2 Correct 25 ms 4184 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 6480 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 7512 KB 115362 numbers
2 Correct 57 ms 9808 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 10036 KB 154271 numbers
2 Correct 97 ms 16080 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 12628 KB 200000 numbers
2 Correct 100 ms 16156 KB 199945 numbers