2210.cpp

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

/*  This Code is Submitted by wywcgs for Problem 2210 on 2006-04-18 at 12:03:57 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int BN = 8;
const int XM = 24;

char pat[XM][BN][BN];
int call[5],  X, Y;
int chos[BN], best;

void enumer(int, int);

int main()
{
	int t, T, i, j;
	
	scanf("%d", &T);
	for(t = 0; t < T; t++) {
		for(i = 0; i < 5; i++) scanf("%d", &call[i]);
		scanf("%d %d", &X, &Y);
		for(i = 0; i < 5; i++)
			for(j = 0; j < X; j++)
				scanf("%s", pat[j][i]);
		best = 10000; enumer(0, 0);
		printf("%d\n", best);
	}
	
	return 0;
}

void enumer(int o, int b)
{
	int i, j, k;
	if(o == Y) {
		char map[BN][BN]; memset(map, 'O', sizeof(map));
		for(i = 0; i < o; i++)
			for(j = 0; j < 5; j++)
				for(k = 0; k < 5; k++)
					if(pat[chos[i]][j][k] == 'X') map[j][k] = 'X';
		int need = 0;
		for(i = 0; i < 5; i++) {
			int cnd = 0;
			for(j = 0; j < 5; j++)
				if(map[j][i] == 'X' && (i != 2 || j != 2)) cnd++;
			need += max(0, cnd-call[i]);
		}
		best = min(best, need);
	} else if(b == X) return;
	else {
		for(i = b; i < X; i++) {
			chos[o] = i;
			enumer(o+1, i+1);
		}
	}
}