oj.uz

답안 #494149

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
494149 2021-12-14T12:54:08 Z PikaQ Mobile (BOI12_mobile) C++17
50 / 100
 930 ms 31652 KB 
#include<bits/stdc++.h>
#define int ll
#define forn(i,n) for(int i=0;i<(n);i++)
#define Forn(i,n) for(int i=1;i<=(n);i++)
#define ll long long
#define pb push_back
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define vi vector<int>
#define vl vector<long long>
#define vpi vector<pair<int,int> >
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp make_pair
#define rz resize
#define all(p) p.begin(),p.end()
#define alr(p,q) p+1,p+q+1
#define ull unsigned long long
#define st0(p) memset((p),0,sizeof(p))
#define T(x) ((x)%2 ? s[(x)/2] : '.')
#define lowb(x) x&-x
#define ls(x) (x)*2
#define rs(x) (x)*2+1
using namespace std;
 
inline void USACO(string filename){
	freopen((filename+".in").c_str(),"r",stdin);
	freopen((filename+".out").c_str(),"w",stdout);
}
 
void debug() {cout << endl;}
template <class T, class ...U> void debug(T a, U ... b) { cout << a << " "; debug(b...);}
// template <class T> int max(T a, T ... b) { cout << a << " "; debug(b...);}
const int INF = 1e9+7;
const double eps = 1e-7;
const int N = 8e2+9;
int n;
 
#define double long double
#define pdd pair<double,double> 
int L;
vector<pdd> p;
 
 
bool check(double R){
	vector<pdd> vs;
	double cur = 0;
	for(auto &i : p){
		double dy = abs(i.S);
		if(dy - R > eps) continue;
		double d = sqrt(R*R - dy*dy);
		double l = i.F -d,r = i.F +d;
		if(l <= cur) cur = max(cur,(double)r);
	}
	
	return cur >= L;
}
 
void solve(){
	cin >> n >> L;
	p.rz(n);
	forn(i,n) cin >> p[i].F >> p[i].S;
	sort(all(p));
	double lo = 0,hi = 1e8;
	while(hi - lo > 1e-7){
		double mid = (lo+hi)/2;
		if(check(mid)) hi = mid;
		else lo = mid;
	}
	// debug(check((double)10));
	cout << hi << '\n';
}		 	
 
 
 
signed main(){
	// USACO("angry");
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(0);
 

		cout << fixed << setprecision(4);
	// int t;
	// cin >> t;
	// while(t--)
	solve();
	return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 460 KB Output is correct
2 Correct 5 ms 460 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 5 ms 460 KB Output is correct

Subtask #5
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 460 KB Output is correct
2 Correct 5 ms 460 KB Output is correct
3 Correct 6 ms 460 KB Output is correct
4 Correct 5 ms 460 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 460 KB Output is correct
2 Correct 5 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 5 ms 460 KB Output is correct
5 Correct 5 ms 460 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 2764 KB Output is correct
2 Correct 72 ms 2636 KB Output is correct
3 Correct 45 ms 2508 KB Output is correct
4 Correct 58 ms 3284 KB Output is correct
5 Correct 34 ms 2252 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 2784 KB Output is correct
2 Correct 51 ms 2508 KB Output is correct
3 Correct 60 ms 2764 KB Output is correct
4 Correct 64 ms 2764 KB Output is correct
5 Correct 67 ms 3020 KB Output is correct

Subtask #9
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 3080 KB Output is correct
2 Correct 76 ms 2892 KB Output is correct
3 Correct 69 ms 3576 KB Output is correct
4 Correct 82 ms 4064 KB Output is correct
5 Correct 63 ms 3660 KB Output is correct

Subtask #10
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 90 ms 3404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 3404 KB Output is correct
2 Correct 100 ms 3404 KB Output is correct
3 Correct 87 ms 4056 KB Output is correct
4 Correct 78 ms 4044 KB Output is correct
5 Correct 72 ms 4044 KB Output is correct

Subtask #12
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 409 ms 15948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 475 ms 15948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 497 ms 19020 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 586 ms 19020 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 581 ms 22236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 663 ms 22220 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #18
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 672 ms 25256 KB Output is correct
2 Correct 740 ms 26612 KB Output is correct
3 Correct 720 ms 26532 KB Output is correct
4 Correct 648 ms 26600 KB Output is correct
5 Correct 605 ms 26540 KB Output is correct

Subtask #19
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 763 ms 25292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 856 ms 31624 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 930 ms 31652 KB Output isn't correct
2 Halted 0 ms 0 KB -