#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
#define ll int
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
const ll maxn =1e6+10;
const ll mod=1e9+7;
const ll base=3e18;
ll a[maxn];
ll ask(ll x,ll y)
{
return Measure(x,y);
}
void dosth(ll x,ll y,ll x1,ll y1,ll w,bool chk1,bool chk2)
{
if (x>x1||y>y1)
return ;
ll posx;
ll posy;
if (chk1&&chk2)
{
posx=x1;
posy=y;
}
else if (chk1)
{
posx=x;
posy=y;
}
else if (chk2)
{
posx=x1;
posy=y1;
}
else
{
posx=x;
posy=y1;
}
ll t=ask(posx,posy);
if (t==w)
{
Pinpoint(posx,posy);
return ;
}
if (t>w)
{
if (chk1&&chk2)
{
dosth(x,y,x1-1,y1,w,chk1,chk2);
}
else if (chk1)
{
dosth(x+1,y,x1,y1,w,chk1,chk2);
}
else if (chk2)
{
dosth(x,y,x1+1,y1,w,chk1,chk2);
}
else
{
dosth(x+1,y,x1,y1,w,chk1,chk2);
}
}
else
{
if (chk1&&chk2)
{
dosth(x,y+1,x1,y1,w,chk1,chk2);
}
else if (chk1)
{
dosth(x,y+1,x1,y1,w,chk1,chk2);
}
else if (chk2)
{
dosth(x,y,x1,y1-1,w,chk1,chk2);
}
else
{
dosth(x,y,x1,y1-1,w,chk1,chk2);
}
}
}
void Rescue(ll R,ll C,ll RS,ll CS,ll X)
{
ll w=X;
ll x=RS;
ll y=CS;
ll n=R;
ll m=C;
ll t=0;
dosth(1,1,x,y,w,1,1);
dosth(x,1,n,y,w,1,0);
dosth(1,y,x,m,w,0,1);
dosth(x,y,n,m,w,0,0);
}
/*int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (fopen("t.inp","r"))
{
freopen("test.inp","r",stdin);
freopen("test.out","w",stdout);
}
}*/
Compilation message
mountain.cpp:14:15: warning: overflow in conversion from 'double' to 'int' changes value from '3.0e+18' to '2147483647' [-Woverflow]
14 | const ll base=3e18;
| ^~~~
mountain.cpp: In function 'void Rescue(int, int, int, int, int)':
mountain.cpp:100:8: warning: unused variable 't' [-Wunused-variable]
100 | ll t=0;
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
0 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
0 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Incorrect |
0 ms |
364 KB |
Wrong Answer [1] |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
492 KB |
Output is correct |
2 |
Correct |
6 ms |
492 KB |
Output is correct |
3 |
Incorrect |
6 ms |
492 KB |
Wrong Answer [1] |
4 |
Halted |
0 ms |
0 KB |
- |