2019牛客暑期多校训练营（第十场）E:Hilbert Sort

Hilbert Sort

参考博客：https://blog.csdn.net/qq_41117236/article/details/99694107#commentsedit

代码：

#include<bits/stdc++.h>
using namespace std;
struct node{
	int x,y,num;
}a[1000005];
int cmp(node x,node y){
	return x.num<y.num;
}
int dir[10][10]={{0,0,0,0,0},{0,3,4,1,1},{0,2,2,3,4},{0,1,3,2,3},{0,4,1,4,2}}; //四个位置对应的图形
int ord[10][10]={{0,0,0,0,0},{0,1,4,2,3},{0,3,2,4,1},{0,1,2,4,3},{0,3,4,2,1}}; //四个位置的次序
int get(int k,int x,int y){
	int t=1,cnt=0;
	for(;k>=0;k--){
		int d=1<<k;
		int i=(x-1)/d+1,j=(y-1)/d+1;
		int p=(i-1)*2+j;
		x-=(i-1)*d,y-=(j-1)*d;
		cnt+=d*d*(ord[t][p]-1);
		t=dir[t][p];
	}
	return cnt;
}
int main(){
	int n,k;
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++){
		scanf("%d%d",&a[i].x,&a[i].y);
		a[i].num=get(k-1,a[i].x,a[i].y); 
	}
	sort(a,a+n,cmp);
	for(int i=0;i<n;i++)
		printf("%d %d\n",a[i].x,a[i].y);
	return 0;
}