Gym - 100625E Encoded Coordinates 矩阵快速幂

题意：

一直TLE我也是醉了，，不爽！

 #include <iostream>
 #include <cstdio>
 #include <fstream>
 #include <algorithm>
 #include <cmath>
 #include <deque>
 #include <vector>
 #include <queue>
 #include <string>
 #include <cstring>
 #include <map>
 #include <stack>
 #include <set>
 #define LL long long
 #define MAXN 100005
 #define INF 0x3f3f3f3f
 #define MAXN 100005
 #define eps 1e-8
 using namespace std;
 LL ax, ay, bx, by, cx, cy, kx, ky, nx, ny, x, p;
 struct Martix
 {
     LL m[][];
     Martix()
     {
         memset(m, , sizeof(m));
     }
 };
 void m_quick_power(Martix &a, Martix &b)
 {
     Martix c;
     for(int i = ; i <= ; i++){
         for(int j = ; j <= ; j++){
             for(int k = ; k <= ; k++){
                 c.m[i][j] = (c.m[i][j] + a.m[i][k] * b.m[k][j]) % p;
             }
         }
     }
     a = c;
 }
 LL work(int s, LL n)
 {
     Martix u, v;
     u.m[][] = ax, u.m[][] = bx, u.m[][] = cx, u.m[][] = s;
     v.m[][] = v.m[][] = v.m[][] = v.m[][] = v.m[][] = , v.m[][] = v.m[][] = kx;
     while(n){
         if(n & ){
             m_quick_power(u, v);
         }
         m_quick_power(v, v);
         n >>= ;
     }
     return u.m[][];
 }
 int main()
 {
 #ifndef ONLINE_JUDGE
     freopen("in.txt", "r", stdin);
     //freopen("out.txt", "w", stdout);
 #endif // OPEN_FILE
     int T;
     scanf("%d", &T);
     while(T--){
         scanf("%I64d", &p);
         scanf("%I64d%I64d%I64d%I64d%I64d", &ax, &bx, &cx, &kx, &nx);
         scanf("%I64d%I64d%I64d%I64d%I64d", &ay, &by, &cy, &ky, &ny);
         scanf("%I64d", &x);
         nx--;
         ny--;
         int cnt = ;
         int j = ;
         for(int i = ; i <= p; i++){
             if(work(i, nx) == x){
                 cnt++;
                 j = i;
             }
         }
         if(cnt != ){
             printf("UNKNOWN\n");
             continue;
         }
         ax = ay, bx = by, cx = cy, kx = ky;
         LL ans = work(j, ny) % p;
         printf("%I64d\n", ans);
     }
 }