225 - Golygons Golygons 暴力

题目大意：有一个人在旅游，第一步为1，每次走的步数依次递增
每次走完后，都要拐90度继续走，问能最后走n步的情况下能否回到原点

解题思路：因为有负数，所以讲中心坐标扩大了，这样负数就不成问题了，然后再暴力枚举下去
一个剪枝：如果后面再怎么走都回不到原点的话，那就可以去掉了

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cstdlib>
using namespace std;
#define maxn 230
const int start = 115;
char str[5] = "ensw";
int dir[4][2] = {{1,0},{0,1},{0,-1},{-1,0}};
int sum[25], vis[maxn][maxn], ans[25], n, cnt;


bool check(int x, int y, int num, int d) {

    for(int i = 0; i < num; i++) {
        x += dir[d][0];
        y += dir[d][1];
        if(vis[x][y] == -1) {
            return false;
        }
    }
    if(abs(start - x) + abs(start - y) > sum[n] - sum[num])
        return false;
    return true;
}  

void dfs(int x, int y, int cur, int d) {
    if(cur == n) {
        if(x == start && y == start) {
            for(int i = 0; i < n; i++)
                printf("%c",str[ans[i]]);
            printf("\n");
            cnt++;
        }
        return ;
    }

    for(int i = 0; i < 4; i++) {
        if(i == d || i + d == 3 )
            continue;
        if(!check(x,y,cur+1,i))
            continue;
        int xx = x + dir[i][0] * (cur + 1);
        int yy = y + dir[i][1] * (cur + 1);
        if(vis[xx][yy])
            continue;
        vis[xx][yy] = 1;
        ans[cur] = i;
        dfs(xx,yy,cur + 1, i);
        vis[xx][yy] = 0;
    }
}

void init() {
    sum[0] = 0;
    for(int i = 1; i <= 20; i++)
        sum[i] = sum[i-1] + i;
}

int main() {
    init();
    int test, num, x, y;
    scanf("%d", &test);
    while(test--) {
        scanf("%d", &n);
        scanf("%d", &num);
        memset(vis,0,sizeof(vis));
        cnt = 0 ;
        for(int i = 0; i < num; i++) {
            scanf("%d%d", &x, &y);
            if(abs(x) > start || abs(y) > start)
                continue;
            vis[start + x][start + y] = -1;
        }
        dfs(start,start,0,-1);
        printf("Found %d golygon(s).\n\n",cnt);
    }
    return 0;
}