oj.uz

Submission #67903

# Submission time Handle Problem Language Result Execution time Memory
67903 2018-08-15T12:44:02 Z thebes Mobile (BOI12_mobile) C++14
60 / 100
 793 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 = 3e9, eps = 1e-4;
int N, M, i, j; double mx, dx, m, flag;
pair<int,int> pnt[MN];

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;
		mx = 0;
		for(i=1;i<=N;i++){
			if(abs(pnt[i].second)>m) continue;
			dx=sqrt(sq(m)-sq(1LL*pnt[i].second));
			if(pnt[i].first-dx<=mx) mx=max(mx,pnt[i].first+dx);
		}
		if(mx>=M) hi=m;
		else lo=m+eps;
	}
	printf("%.4lf\n",lo);
	return 0;
}

Compilation message

mobile.cpp: In function 'int main()':
mobile.cpp:14: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:15: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 3 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 3 ms 400 KB Output is correct
4 Correct 3 ms 452 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 464 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 472 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 476 KB Output is correct
2 Correct 5 ms 624 KB Output is correct
3 Correct 5 ms 636 KB Output is correct
4 Correct 5 ms 672 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 844 KB Output is correct
2 Correct 8 ms 1012 KB Output is correct
3 Correct 5 ms 1012 KB Output is correct
4 Correct 7 ms 1040 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1112 KB Output is correct
2 Correct 7 ms 1160 KB Output is correct
3 Correct 7 ms 1244 KB Output is correct
4 Correct 7 ms 1284 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1356 KB Output is correct
2 Correct 6 ms 1408 KB Output is correct
3 Correct 8 ms 1476 KB Output is correct
4 Correct 6 ms 1516 KB Output is correct
5 Correct 6 ms 1596 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 3044 KB Output is correct
2 Correct 63 ms 4044 KB Output is correct
3 Correct 44 ms 4540 KB Output is correct
4 Correct 53 ms 5880 KB Output is correct
5 Correct 32 ms 6060 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 6976 KB Output is correct
2 Correct 44 ms 7708 KB Output is correct
3 Correct 69 ms 8840 KB Output is correct
4 Correct 68 ms 10076 KB Output is correct
5 Correct 60 ms 11508 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 12276 KB Output is correct
2 Correct 62 ms 13396 KB Output is correct
3 Correct 63 ms 14376 KB Output is correct
4 Correct 59 ms 16408 KB Output is correct
5 Correct 57 ms 17308 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 18948 KB Output is correct
2 Correct 72 ms 20344 KB Output is correct
3 Correct 95 ms 21352 KB Output is correct
4 Correct 67 ms 23416 KB Output is correct
5 Correct 54 ms 24480 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 26112 KB Output is correct
2 Correct 70 ms 27628 KB Output is correct
3 Correct 73 ms 28552 KB Output is correct
4 Correct 66 ms 30496 KB Output is correct
5 Correct 57 ms 31700 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 39200 KB Output is correct
2 Correct 353 ms 46872 KB Output is correct
3 Correct 348 ms 54124 KB Output is correct
4 Correct 375 ms 63800 KB Output is correct
5 Correct 296 ms 70644 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 78888 KB Output is correct
2 Correct 338 ms 85460 KB Output is correct
3 Correct 308 ms 91280 KB Output is correct
4 Correct 283 ms 100508 KB Output is correct
5 Correct 302 ms 107916 KB Output is correct

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 358 ms 113816 KB Output is correct
2 Correct 377 ms 123080 KB Output is correct
3 Runtime error 386 ms 131764 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.
4 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 373 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 #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 423 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 #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 451 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 #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 535 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 #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 587 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 #20
0 / 5.0

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