ZOJ 3487 Ordinal Numbers（模拟）

分类讨论

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
#include <sstream>

using namespace std;
typedef long long ll;
#define PB push_back
#define UB upper_bound
#define LB lower_bound
#define MP make_pair
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<vi>
#define mst(x,y) memset(x,y,sizeof(x))
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iin(x) scanf("%d",&x)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define sp system("pause")
#define INF 1e9
#define MAXN 100005
#define PI acos(-1.0)
#define eps 1e-10
const int MOD = 1e9 + 7;

vii mat_mul(vii &A,vii &B)
{
    vii C(A.size(),vi(B[0].size()));
    for(int i = 0;i < A.size();i++)
    {
        for(int j = 0;j < B[0].size();j++)
        {
            for(int k = 0;k < B.size();k++)
            {
                C[i][j] = ((ll)A[i][k] * B[k][j] + C[i][j]);
            }
        }
    }
    return C;
}

vii mat_pow(vii A,ll n)
{
    vii B(A.size(),vi(A.size()));
    for(int i = 0;i < A.size();i++)
    {
        B[i][i] = 1;
    }
    while(n)
    {
        if(n & 1)
            B = mat_mul(B,A);
        A = mat_mul(A,A);
        n >>= 1;
    }
    return B;
}


int main()
{
	int t;
	cin >> t;
	while(t--)
	{
		int n,m;
		cin >> n >> m;
		vii A(n * m,vi(n * m));
		getchar();vii Bs(n * m,vi(n * m));
		for(int i = 0;i < n;i++)
		{
			for(int j = 0;j < m;j++)
			{
				int x[8],nod = i * n + m;
				//scanf("((%d,%d),(%d,%d),(%d,%d),(%d,%d))",&x[0],&y[0],&x[1],&y[1],&x[2],&y[2],&x[3],&y[3]);
				string inn;
				cin >> inn;
				if(i == n -1 && j == m - 1)
					continue;
				/*cout << inn << endl;
				stringstream ss(inn);
				ss>>x[0]>>y[0]>>x[1]>>y[1]>>x[2]>>y[2]>>x[3]>>y[3];*/
				int cnt = 0;
				for(int i = 0; i < inn.size();i++)
				{
					if(inn[i] >= '0' && inn[i] <= '9')
						x[cnt++] = inn[i] - '0';
				}
				for(int k = 0;k < 8;k += 2)
				{
					x[k]--,x[k + 1]--;
					//cout << x[k] << " " << x[k + 1] << endl;
					//cout << x[k] * n + x[k + 1] << " " <<i * n + j << endl;
					A[x[k] * m + x[k + 1]][i * m + j] = 1;
				}
			}
			Bs = A;
		}
		/*for(int i = 0;i < n * m;i++)
		{
			for(int j = 0;j < n * m;j++)
			{
				cout << A[i][j] << " ";
			}
			cout << endl;
		}*/
		int p;
		cin >> p;
		while(p--)
		{
			int h;
			cin >> h;
			A = Bs;
			vii B = mat_pow(A,h);
			/*for(int i = 0;i < n * m;i++)
			{
				for(int j = 0;j < n * m;j++)
				{
					cout << B[i][j] << " ";
				}
				cout << endl;
			}cout << endl;*/
			vii C (n * m,vi(n * m));
			C[0][0] = 1;
			C = mat_mul(B,C);
			/*for(int i = 0;i < n * m;i++)
			{
				for(int j = 0;j < n * m;j++)
				{
					cout << C[i][j] << " ";
				}
				cout << endl;
			}*/

			int sum = 0;
			for(int i = 0;i < n * m;i++)
			{
					if(C[i][0] != 0)
						sum++;
					if(sum > 1)
						break;
			}
			if(sum == 1 && C[n * m - 1][0] != 0)
				cout << "True\n";
			else if(C[n * m - 1][0] != 0)
				cout << "Maybe\n";
			else
				cout << "False\n";
		}
		cout << endl;
	}
	return 0;
}