2213.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2213 on 2006-04-26 at 12:21:36 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int SIZE = 19;
const int DIR[][2] = { { 0, 1 }, { -1, 1 }, { 1, 1 }, { 1, 0 } };

int board[SIZE][SIZE];
bool vst[SIZE][SIZE][4];

bool legal(int x, int y) { return x >= 0 && x < SIZE && y >= 0 && y < SIZE; }

int main()
{
	int t, T, i, j, k, r;
	
	scanf("%d", &T);
	for(t = 0; t < T; t++) {
		for(i = 0; i < SIZE; i++)
			for(j = 0; j < SIZE; j++) scanf("%d", &board[i][j]);
		int win = 0, lx, ly; memset(vst, false, sizeof(vst));
		for(i = 0; i < SIZE && !win; i++)
			for(j = 0; j < SIZE && !win; j++) {
				if(board[i][j] == 0) continue;
				for(k = 0; k < 4; k++) {
					if(vst[i][j][k]) continue;
					win = board[i][j];
					for(r = 1; true; r++) {
						int x = i+r*DIR[k][0], y = j+r*DIR[k][1];
						if(legal(x, y) && board[x][y] == win) vst[x][y][k] = true;
						else break;
					}
					if(r != 5) win = 0;
					if(win) { lx = i, ly = j; break; }
				}
			}
		printf("%d\n", win);
		if(win) printf("%d %d\n", lx+1, ly+1);
	}
	
	return 0;
}