#include "grader.h"
#include <algorithm>
void Rescue(int n,int m,int x,int y,int z)
{
int i,j,l,r,mid,t;
l=0;
r=n+m;
while(r-l>1)
{
mid=(l+r)/2;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)if(std::abs(i-x)+std::abs(j-y)==mid)break;
if(j<=m)break;
}
if(i<=n)
{
t=Measure(i,j);
if(t==z)
{
Pinpoint(i,j);
return;
}
if(t>z)l=mid;
else r=mid;
}
else r=mid;
}
for(i=1;i<=n;i++)for(j=1;j<=m;j++)if(std::abs(i-x)+std::abs(j-y)>=l&&std::abs(i-x)+std::abs(j-y)<=r)
{
t=Measure(i,j);
if(t==z)
{
Pinpoint(i,j);
return;
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
Output is correct |
| 2 |
Correct |
5 ms |
256 KB |
Output is correct |
| 3 |
Correct |
5 ms |
256 KB |
Output is correct |
| 4 |
Correct |
5 ms |
256 KB |
Output is correct |
| 5 |
Correct |
5 ms |
296 KB |
Output is correct |
| 6 |
Correct |
5 ms |
256 KB |
Output is correct |
| 7 |
Correct |
5 ms |
256 KB |
Output is correct |
| 8 |
Correct |
5 ms |
368 KB |
Output is correct |
| 9 |
Correct |
5 ms |
360 KB |
Output is correct |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct |
| 11 |
Correct |
5 ms |
256 KB |
Output is correct |
| 12 |
Correct |
5 ms |
256 KB |
Output is correct |
| 13 |
Correct |
5 ms |
384 KB |
Output is correct |
| 14 |
Correct |
5 ms |
384 KB |
Output is correct |
| 15 |
Correct |
5 ms |
360 KB |
Output is correct |
| 16 |
Correct |
5 ms |
360 KB |
Output is correct |
| 17 |
Correct |
5 ms |
256 KB |
Output is correct |
| 18 |
Correct |
5 ms |
360 KB |
Output is correct |
| 19 |
Correct |
5 ms |
256 KB |
Output is correct |
| 20 |
Correct |
5 ms |
256 KB |
Output is correct |
| 21 |
Correct |
5 ms |
256 KB |
Output is correct |
| 22 |
Correct |
5 ms |
384 KB |
Output is correct |
| 23 |
Correct |
5 ms |
360 KB |
Output is correct |
| 24 |
Correct |
5 ms |
256 KB |
Output is correct |
| 25 |
Correct |
5 ms |
256 KB |
Output is correct |
| 26 |
Correct |
6 ms |
256 KB |
Output is correct |
| 27 |
Correct |
5 ms |
256 KB |
Output is correct |
| 28 |
Correct |
5 ms |
256 KB |
Output is correct |
| 29 |
Correct |
6 ms |
384 KB |
Output is correct |
| 30 |
Correct |
5 ms |
256 KB |
Output is correct |
| 31 |
Correct |
5 ms |
436 KB |
Output is correct |
| 32 |
Correct |
5 ms |
384 KB |
Output is correct |
| 33 |
Correct |
5 ms |
384 KB |
Output is correct |
| 34 |
Correct |
5 ms |
256 KB |
Output is correct |
| 35 |
Correct |
5 ms |
356 KB |
Output is correct |
| 36 |
Correct |
5 ms |
256 KB |
Output is correct |
| 37 |
Correct |
4 ms |
256 KB |
Output is correct |
| 38 |
Correct |
5 ms |
384 KB |
Output is correct |
| 39 |
Correct |
5 ms |
256 KB |
Output is correct |
| 40 |
Correct |
5 ms |
256 KB |
Output is correct |
| 41 |
Correct |
5 ms |
384 KB |
Output is correct |
| 42 |
Correct |
5 ms |
256 KB |
Output is correct |
| 43 |
Correct |
5 ms |
256 KB |
Output is correct |
| 44 |
Correct |
5 ms |
256 KB |
Output is correct |
| 45 |
Correct |
5 ms |
256 KB |
Output is correct |
| 46 |
Correct |
5 ms |
304 KB |
Output is correct |
| 47 |
Correct |
4 ms |
256 KB |
Output is correct |
| 48 |
Correct |
5 ms |
256 KB |
Output is correct |
| 49 |
Correct |
5 ms |
360 KB |
Output is correct |
| 50 |
Correct |
5 ms |
256 KB |
Output is correct |
| 51 |
Correct |
5 ms |
432 KB |
Output is correct |
| 52 |
Correct |
5 ms |
256 KB |
Output is correct |
| 53 |
Correct |
5 ms |
256 KB |
Output is correct |
| 54 |
Correct |
5 ms |
256 KB |
Output is correct |
| 55 |
Correct |
5 ms |
388 KB |
Output is correct |
| 56 |
Incorrect |
5 ms |
256 KB |
Wrong Answer [5] |
| 57 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
896 KB |
Wrong Answer [5] |
| 2 |
Halted |
0 ms |
0 KB |
- |
