Submission #67581

# Submission time Handle Problem Language Result Execution time Memory
67581 2018-08-15T03:48:39 Z thebes Mobile (BOI12_mobile) C++14
65 / 100
849 ms 132096 KB
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,ssse3,sse3,sse4,popcnt,avx,mmx,abm,tune=native")
#include <bits/stdc++.h>
#define sq(x) ((x)*(x))
using namespace std;

#define int long long
const int MN = 1e6+6;
double lo, hi = 1e10, eps = 1e-4;
int N, M, i, j;
pair<int,int> pnt[MN];
bool check(double d){
	double mx = 0;
	for(int i=1;i<=N;i++){
		if(abs(pnt[i].second)>d) continue;
		double dx=sqrt(sq(d)-sq(pnt[i].second));
		if(pnt[i].first-dx<=mx) mx=max(mx,pnt[i].first+dx);
	}
	return mx>=M; 
}

signed main(){
	for(scanf("%lld%lld",&N,&M),i=1;i<=N;i++)
		scanf("%lld%lld",&pnt[i].first,&pnt[i].second);
	sort(pnt+1,pnt+N+1,[](pair<int,int>i,pair<int,int>j){return i.first<j.first;});
	while(lo+eps<hi){
		double m = (lo+hi)/2.0;
		if(check(m)) hi=m;
		else lo=m+eps;
	}
	printf("%.4lf\n",lo);
	return 0;
}

Compilation message

mobile.cpp: In function 'int main()':
mobile.cpp:24:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(scanf("%lld%lld",&N,&M),i=1;i<=N;i++)
      ~~~~~~~~~~~~~~~~~~~~~~~^~~~
mobile.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld",&pnt[i].first,&pnt[i].second);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 488 KB Output is correct
2 Correct 2 ms 548 KB Output is correct
3 Correct 3 ms 548 KB Output is correct
4 Correct 3 ms 548 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 600 KB Output is correct
2 Correct 5 ms 600 KB Output is correct
3 Correct 4 ms 648 KB Output is correct
4 Correct 5 ms 740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 796 KB Output is correct
2 Correct 8 ms 920 KB Output is correct
3 Correct 7 ms 920 KB Output is correct
4 Correct 6 ms 1060 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 1060 KB Output is correct
2 Correct 6 ms 1060 KB Output is correct
3 Correct 6 ms 1060 KB Output is correct
4 Correct 7 ms 1164 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 1164 KB Output is correct
2 Correct 7 ms 1240 KB Output is correct
3 Correct 6 ms 1240 KB Output is correct
4 Correct 5 ms 1348 KB Output is correct
5 Correct 6 ms 1348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 62 ms 2632 KB Output is correct
2 Correct 76 ms 3616 KB Output is correct
3 Correct 43 ms 3836 KB Output is correct
4 Correct 56 ms 5312 KB Output is correct
5 Correct 45 ms 5312 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 55 ms 5808 KB Output is correct
2 Correct 48 ms 6400 KB Output is correct
3 Correct 55 ms 7604 KB Output is correct
4 Correct 56 ms 8772 KB Output is correct
5 Correct 78 ms 10564 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 92 ms 10564 KB Output is correct
2 Correct 90 ms 10564 KB Output is correct
3 Correct 61 ms 11284 KB Output is correct
4 Correct 85 ms 13528 KB Output is correct
5 Correct 55 ms 14328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 83 ms 14484 KB Output is correct
2 Correct 83 ms 15912 KB Output is correct
3 Correct 74 ms 16868 KB Output is correct
4 Correct 61 ms 18792 KB Output is correct
5 Correct 60 ms 20160 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 90 ms 20160 KB Output is correct
2 Correct 85 ms 20172 KB Output is correct
3 Correct 75 ms 21176 KB Output is correct
4 Correct 62 ms 23248 KB Output is correct
5 Correct 61 ms 24420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 382 ms 30688 KB Output is correct
2 Correct 415 ms 30688 KB Output is correct
3 Correct 411 ms 37968 KB Output is correct
4 Correct 314 ms 47520 KB Output is correct
5 Correct 294 ms 54292 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 417 ms 54452 KB Output is correct
2 Correct 397 ms 60980 KB Output is correct
3 Correct 359 ms 66684 KB Output is correct
4 Correct 319 ms 76032 KB Output is correct
5 Correct 351 ms 83464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 459 ms 85012 KB Output is correct
2 Correct 542 ms 85012 KB Output is correct
3 Correct 519 ms 93716 KB Output is correct
4 Correct 351 ms 105488 KB Output is correct
5 Correct 399 ms 113528 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 498 ms 113596 KB Output is correct
2 Correct 492 ms 121632 KB Output is correct
3 Correct 422 ms 128332 KB Output is correct
4 Runtime error 372 ms 132096 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 541 ms 132096 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 582 ms 132096 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 614 ms 132096 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 713 ms 132096 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 796 ms 132096 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 849 ms 132096 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2 Halted 0 ms 0 KB -