oj.uz

Submission #67582

# Submission time Handle Problem Language Result Execution time Memory
67582 2018-08-15T03:50:29 Z thebes Mobile (BOI12_mobile) C++14
80 / 100
 857 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;

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

signed main(){
	for(scanf("%d%d",&N,&M),i=1;i<=N;i++)
		scanf("%d%d",&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){
		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:23:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(scanf("%d%d",&N,&M),i=1;i<=N;i++)
      ~~~~~~~~~~~~~~~~~~~^~~~
mobile.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&pnt[i].first,&pnt[i].second);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 408 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 540 KB Output is correct
2 Correct 2 ms 540 KB Output is correct
3 Correct 2 ms 540 KB Output is correct
4 Correct 2 ms 540 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 540 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 3 ms 616 KB Output is correct
4 Correct 4 ms 636 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 800 KB Output is correct
2 Correct 6 ms 800 KB Output is correct
3 Correct 6 ms 892 KB Output is correct
4 Correct 5 ms 932 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 932 KB Output is correct
2 Correct 6 ms 932 KB Output is correct
3 Correct 6 ms 932 KB Output is correct
4 Correct 5 ms 932 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 984 KB Output is correct
2 Correct 7 ms 984 KB Output is correct
3 Correct 6 ms 1084 KB Output is correct
4 Correct 5 ms 1084 KB Output is correct
5 Correct 5 ms 1136 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 1820 KB Output is correct
2 Correct 64 ms 2840 KB Output is correct
3 Correct 41 ms 3276 KB Output is correct
4 Correct 48 ms 4536 KB Output is correct
5 Correct 33 ms 4808 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 5040 KB Output is correct
2 Correct 46 ms 5712 KB Output is correct
3 Correct 51 ms 6808 KB Output is correct
4 Correct 47 ms 8056 KB Output is correct
5 Correct 56 ms 9512 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 9616 KB Output is correct
2 Correct 72 ms 9616 KB Output is correct
3 Correct 64 ms 10472 KB Output is correct
4 Correct 58 ms 12708 KB Output is correct
5 Correct 58 ms 13384 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 13552 KB Output is correct
2 Correct 84 ms 14948 KB Output is correct
3 Correct 76 ms 15716 KB Output is correct
4 Correct 58 ms 15740 KB Output is correct
5 Correct 60 ms 15852 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 15852 KB Output is correct
2 Correct 86 ms 15852 KB Output is correct
3 Correct 74 ms 15852 KB Output is correct
4 Correct 57 ms 15852 KB Output is correct
5 Correct 59 ms 15852 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 18940 KB Output is correct
2 Correct 420 ms 18940 KB Output is correct
3 Correct 410 ms 19060 KB Output is correct
4 Correct 294 ms 19060 KB Output is correct
5 Correct 320 ms 19060 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 412 ms 19060 KB Output is correct
2 Correct 394 ms 19060 KB Output is correct
3 Correct 366 ms 19060 KB Output is correct
4 Correct 338 ms 19060 KB Output is correct
5 Correct 307 ms 19060 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 495 ms 19708 KB Output is correct
2 Correct 511 ms 19708 KB Output is correct
3 Correct 496 ms 19720 KB Output is correct
4 Correct 345 ms 19720 KB Output is correct
5 Correct 367 ms 19720 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 19732 KB Output is correct
2 Correct 478 ms 19752 KB Output is correct
3 Correct 437 ms 19752 KB Output is correct
4 Correct 339 ms 19752 KB Output is correct
5 Correct 380 ms 28492 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 577 ms 29220 KB Output is correct
2 Correct 605 ms 29248 KB Output is correct
3 Correct 639 ms 39384 KB Output is correct
4 Correct 414 ms 53000 KB Output is correct
5 Correct 422 ms 62096 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 589 ms 62096 KB Output is correct
2 Correct 567 ms 71380 KB Output is correct
3 Correct 512 ms 79620 KB Output is correct
4 Correct 405 ms 93164 KB Output is correct
5 Correct 414 ms 103232 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 654 ms 104148 KB Output is correct
2 Correct 646 ms 104148 KB Output is correct
3 Correct 713 ms 115676 KB Output is correct
4 Runtime error 470 ms 131448 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 -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 708 ms 131448 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 -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 830 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 -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 857 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 -