贪心/数学 Codeforces Round #212 (Div. 2) A. Two Semiknights Meet

题目传送门

 /*
     贪心/数学：还以为是BFS，其实x1 + 4 * k = x2, y1 + 4 * l = y2
 */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 using namespace std;

 const int MAXN = ;
 const int INF = 0x3f3f3f3f;
 char s[MAXN][MAXN];

 int main(void)        //Codeforces Round #212 (Div. 2) A. Two Semiknights Meet
 {
     int t;    scanf ("%d", &t);
     while (t--)
     {
         char ch;    int x1, y1, x2, y2;    bool ok = false;

         for (int i=; i<=; ++i)    scanf ("%s", s[i] + );
         for (int i=; i<=; ++i)
         {
             for (int j=; j<=; ++j)
             {
                 if (!ok && s[i][j] == 'K')    {x1 = i;    y1 = j;    ok = true;}
                 if (ok && s[i][j] == 'K')    {x2 = i;    y2 = j;}
             }
         }

         if ((x2 - x1) %  ==  && (y2 - y1) %  == )    puts ("YES");
         else    puts ("NO");
     }

     return ;
 }