oj.uz

답안 #837687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
837687 2023-08-25T14:08:02 Z Xiaoyang Balloons (CEOI11_bal) C++17
10 / 100
 2000 ms 10792 KB 
#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 1ll<<60
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
#define endl "\n"
void inc(ll &a,ll b) {a=(a+b)%mod;}
void dec(ll &a,ll b) {a=(a-b+mod)%mod;}
int lowbit(ll x) {return x&(-x);}
 
 
vector<pair<ll,long double>>alist;
long double calc(ll a,ll b){
	long double d=alist[a].fi-alist[b].fi;
	long double r=d*d/(4*alist[a].se);
	return min(r,alist[b].se);
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll n;cin>>n;
	cout<<fixed<<" "<<setprecision(3);
	rep(i,0,n){
		ll x;cin>>x;
		long double r;cin>>r;
		if(i==0){
			cout<<r<<endl;
		}
		alist.pb(MP(x,r));
	}
	sort(ALL(alist));
	rep(i,1,n){
		long double r=inf;
		for(ll j=i-1;j>=0;j--){
			r=min(r,calc(j,i));
		}
		cout<<r<<endl;
	}
	return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 5th numbers differ - expected: '17.1630000000', found: '4.3710000000', error = '12.7920000000'
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB 2 numbers

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 340 KB 5th numbers differ - expected: '0.1170000000', found: '0.0830000000', error = '0.0340000000'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 468 KB 3rd numbers differ - expected: '121.0000000000', found: '120.0180000000', error = '0.9820000000'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 825 ms 1748 KB 3rd numbers differ - expected: '211.0000000000', found: '210.0110000000', error = '0.9890000000'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2019 ms 3152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2060 ms 5708 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2045 ms 6024 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2041 ms 10792 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2058 ms 10480 KB Time limit exceeded
2 Halted 0 ms 0 KB -