zoj3497

import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) throws IOException {
		new K().solve();
	}
}

class K {

	void solve() {
		Scanner cin = new Scanner(new BufferedInputStream(System.in));
		PrintWriter cout = new PrintWriter(new BufferedOutputStream(System.out));
		int t = cin.nextInt();
		while (t-- > 0) {
			n = cin.nextInt();
			m = cin.nextInt();
			Mat mat = new Mat(n * m);
			mat.clear();
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					String str = cin.next();
					int len = str.length();
					str = str.substring(2, len - 2);
					String[] s = str.split("\\),\\(");
					int u = idx(i, j);
					// mat.val[u][u] = 1 ;
					for (String d : s) {
						String[] ds = d.split(",");
						int x = Integer.parseInt(ds[0]);
						int y = Integer.parseInt(ds[1]);
						int v = idx(x, y);
						mat.val[u][v] = 1;
					}
				}
			}
			for (int i = 1; i <= n * m; i++)
				mat.val[n * m][i] = 0;

			int q = cin.nextInt();
			while (q-- > 0) {
				int k = cin.nextInt();
				Mat A = (Mat) mat.clone();
				// System.out.println("A" + ":\n"+ A.toString());
				A = A.pow(k);
				// System.out.println("Pow"+ k + ":\n"+ A.toString());

				int sum = 0;
				for (int i = 1; i < n * m; i++)
					sum += A.val[1][i];

				if (A.val[1][n * m] == 0)
					cout.println("False");
				else if (sum == 0 && A.val[1][n * m] == 1)
					cout.println("True");
				else if (sum >= 1 && A.val[1][n * m] == 1)
					cout.println("Maybe");
			}
			cout.println();
		}
		cout.flush();
	}

	int n, m;

	int idx(int x, int y) {
		return (x - 1) * m + y;
	}

}

class Mat implements Cloneable {
	int[][] val = new int[28][28];
	int n;

	Mat(int[][] val) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				this.val[i][j] = val[i][j];
			}
		}
	}

	Mat(int n) {
		this.n = n;
	}

	Mat One() {
		Mat res = new Mat(n);
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				res.val[i][j] = i == j ? 1 : 0;
			}
		}
		return res;
	}

	Mat Zero() {
		Mat res = new Mat(n);
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				res.val[i][j] = 0;
			}
		}
		return res;
	}

	void clear() {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				val[i][j] = 0;
			}
		}
	}

	Mat mult(Mat other) {
		Mat res = Zero();
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				for (int k = 1; k <= n; k++) {
					res.val[i][j] |= this.val[i][k] & other.val[k][j];
				}
			}
		}

		return res;
	}

	Mat pow(int y) {
		Mat res = One();
		Mat x = this;
		for (; y > 0; y >>= 1) {
			if ((y & 1) > 0) {
				res = res.mult(x);
			}
			x = x.mult(x);
		}
		return res;
	}

	@Override
	public String toString() {
		String s = "";
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++)
				s += val[i][j] + " ";
			s += "\n";
		}
		return s;
	}

	@Override
	public Object clone() {
		Mat o = null;
		try {
			o = (Mat) super.clone();
		} catch (CloneNotSupportedException e) {
		}
		return o;
	}

}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值