제출 #653862

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
653862		Baytoro	Balloons (CEOI11_bal)	C++17	100 / 100	139 ms	8520 KiB

bal

#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();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 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