```cpp
分治
#include<cstdio>
typedef long long ll;
ll x,y,len; int k;
ll fun(int k)
{
ll sum=1;
for(int i=1;i<=k;++i) sum*=2;
return sum;
}
void solve(ll x,ll y,ll a,ll b,ll l)
{
if(l==1) return;
if(x-a<=l/2-1 && y-b<=l/2-1)
{
printf("%lld %lld 1\n",a+l/2,b+l/2);
solve(x,y,a,b,l/2);
solve(a+l/2-1,b+l/2,a,b+l/2,l/2);
solve(a+l/2,b+l/2-1,a+l/2,b,l/2);
solve(a+l/2,b+l/2,a+l/2,b+l/2,l/2);
}
else if(x-a<=l/2-1 && y-b>l/2-1)
{
printf("%lld %lld 2\n",a+l/2,b+l/2-1);
solve(a+l/2-1,b+l/2-1,a,b,l/2);
solve(x,y,a,b+l/2,l/2);
solve(a+l/2,b+l/2-1,a+l/2,b,l/2);
solve(a+l/2,b+l/2,a+l/2,b+l/2,l/2);
}
else if(x-a>l/2-1 && y-b<=l/2-1)
{
printf("%lld %lld 3\n",a+l/2-1,b+l/2);
solve(a+l/2-1,b+l/2-1,a,b,l/2);
solve(a+l/2-1,b+l/2,a,b+l/2,l/2);
solve(x,y,a+l/2,b,l/2);
solve(a+l/2,b+l/2,a+l/2,b+l/2,l/2);
}
else
{
printf("%lld %lld 4\n",a+l/2-1,b+l/2-1);
solve(a+l/2-1,b+l/2-1,a,b,l/2);
solve(a+l/2-1,b+l/2,a,b+l/2,l/2);
solve(a+l/2,b+l/2-1,a+l/2,b,l/2);
solve(x,y,a+l/2,b+l/2,l/2);
}
}
int main()
{
scanf("%d %lld %lld",&k,&x,&y);
len=fun(k);
solve(x,y,1,1,len);
return 0;
}
求关注
by lienze2012 @ 2023-04-03 21:01:32
@[lienze2012](/user/921677) 题解代码？？？
by drinktowind @ 2023-07-14 15:11:20
还求关注？？？
by drinktowind @ 2023-07-14 15:11:43