# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67573 | 2018-08-15T03:18:31 Z | thebes | Mobile (BOI12_mobile) | C++14 | 1000 ms | 8524 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 = 1e12, eps = 1e-7; int N, M, i, j; pair<int,int> pnt[MN]; inline 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); else return 0; } return mx>=M; } int 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){ double m = (lo+hi)/2.0; if(check(m)) hi=m; else lo=m+eps; } printf("%.7lf\n",lo); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Correct | 3 ms | 356 KB | Output is correct |
3 | Incorrect | 2 ms | 432 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 448 KB | Output is correct |
2 | Correct | 2 ms | 508 KB | Output is correct |
3 | Correct | 2 ms | 524 KB | Output is correct |
4 | Incorrect | 2 ms | 576 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 576 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 584 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 584 KB | Output is correct |
2 | Correct | 8 ms | 760 KB | Output is correct |
3 | Incorrect | 6 ms | 760 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 760 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 69 ms | 1144 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 54 ms | 1272 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 86 ms | 1316 KB | Output is correct |
2 | Incorrect | 63 ms | 1316 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 82 ms | 1408 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 104 ms | 1408 KB | Output is correct |
2 | Incorrect | 78 ms | 1408 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 523 ms | 4640 KB | Output is correct |
2 | Incorrect | 385 ms | 4640 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 381 ms | 4640 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 651 ms | 5372 KB | Output is correct |
2 | Incorrect | 433 ms | 5372 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 485 ms | 5444 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 697 ms | 6212 KB | Output is correct |
2 | Incorrect | 519 ms | 6212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 544 ms | 6212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 754 ms | 6868 KB | Output is correct |
2 | Incorrect | 516 ms | 6908 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 696 ms | 6908 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1012 ms | 8452 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 811 ms | 8524 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |