oj.uz

Submission #653862

# Submission time Handle Problem Language Result Execution time Memory
653862 2022-10-28T15:06:17 Z Baytoro Balloons (CEOI11_bal) C++17
100 / 100
 139 ms 8520 KB 
#include <bits/stdc++.h>
using namespace std;
#define Baytoro_MayrambekovOrz void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e18,mod=2022;
int binpow(int a,int n){
	if(n==0)
		return 1;
	if(n%2==1)
		return (binpow(a, n-1)*a)%mod;
	else{
		int b=binpow(a, n/2)%mod;
		return (b*b)%mod;
	}
}
int n,m;
Baytoro_MayrambekovOrz{
	int n;
	cin>>n;
	vector<int> a(n),r(n);
	for(int i=0;i<n;i++)
		cin>>a[i]>>r[i];
	stack<pair<int,double>> st;
	for(int i=0;i<n;i++){
		double res=r[i];
		while(!st.empty()){
			int tmp=(a[i]-st.top().first)*(a[i]-st.top().first);
			double t=tmp;
			double rr=t/(4.0*st.top().sc);
			res=min(res,rr);
			if(res>=st.top().sc)
				st.pop();
			else
				break;
		}
		cout<<fixed<<setprecision(3)<<res<<endl;
		st.push({a[i],res});
	}
}
main(){
	//fopn("timeline");
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

Compilation message

bal.cpp:51:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   51 | main(){
      | ^~~~
bal.cpp: In function 'void fopn(std::string)':
bal.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bal.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1132 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 2356 KB 50000 numbers
2 Correct 31 ms 2376 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 4260 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 4968 KB 115362 numbers
2 Correct 79 ms 5212 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 6436 KB 154271 numbers
2 Correct 139 ms 8520 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 7760 KB 200000 numbers
2 Correct 129 ms 8496 KB 199945 numbers