hex 7goj
思路:
大模拟。。。
细节比较多,看代码就好
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#define N 2010
using namespace std;
int x, y, timx=0;
int mp[N][N];
int ans[10010];
int flag[10];
struct AA{
int cnt, w;
}a[10];
bool cmp(AA a, AA b){
if(a.cnt == b.cnt) return a.w < b.w;//类型
else return a.cnt < b.cnt;//次数
}
void solve(int x, int y){
sort(a+1, a+6, cmp);
memset(flag, 0, sizeof(flag));
flag[mp[x][y+1]] = flag[mp[x-1][y]] = flag[mp[x-1][y-1]] = flag[mp[x][y-1]] = flag[mp[x+1][y]] = flag[mp[x+1][y+1]] = 1;
for(int i=1; i<=5; i++){
if( !flag[a[i].w] ) {//可填
mp[x][y] = a[i].w;
a[i].cnt++;
ans[timx] = a[i].w;
break;
}
}
return ;
}
int main(){
int T;
x = 500, y = 500;
for(int i=1; i<=5; i++) a[i].w = i;
mp[x][y] = 1; a[1].cnt++;
ans[1] = 1; timx = 1;
int k = 1;
while (timx < 10005){
x++, y++;//从右边节点开始绕圈
/**/for(int i=1; i<=k; i++) timx++, x--, solve(x, y);
for(int i=1; i<=k; i++) timx++, x--, y--, solve(x, y);
for(int i=1; i<=k; i++) timx++, y--, solve(x, y);
for(int i=1; i<=k; i++) timx++, x++, solve(x, y);
for(int i=1; i<=k; i++) timx++, x++, y++, solve(x, y);
for(int i=1; i<=k; i++) timx++, y++, solve(x, y);
k++;
}
scanf("%d", &T);
while ( T-- ){
int n; scanf("%d", &n);
printf("%d\n", ans[n]);
}
return 0;
}