이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 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;
ll l=1, h=y;
while (l<=h)
{
ll mid=(l+h)/2;
ll t=ask(x,mid);
if (t>=w)
h=mid-1;
else
l=mid+1;
}
if (l>=1&&l<=m)
{
for (int i=1; i<=n; i++)
{
ll t=ask(i,l);
if (t==w)
{
Pinpoint(i,l);
}
}
}
l--;
if (l>=1&&l<=m)
{
for (int i=1; i<=n; i++)
{
ll t=ask(i,l);
if (t==w)
{
Pinpoint(i,l);
}
}
}
l=y,h=m;
while (l<=h)
{
ll mid=(l+h)/2;
ll t=ask(x,mid);
if (t>=w) l=mid+1;
else h=mid-1;
}
if (h>=1&&h<=m)
{
for (int i=1; i<=n; i++)
{
ll t=ask(i,h);
if (t==w)
{
Pinpoint(i,h);
}
}
}
h++;
if (h>=1&&h<=m)
{
for (int i=1; i<=n; i++)
{
ll t=ask(i,h);
if (t==w)
{
Pinpoint(i,h);
}
}
}
}
/*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);
}
}*/
컴파일 시 표준 에러 (stderr) 메시지
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:29:8: warning: unused variable 't' [-Wunused-variable]
29 | ll t=0;
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |