Problem——B. Tiling Challenge—

Problem——B. Tiling Challenge——Codeforces

阅读量：278 次

发布时间：2019-03-01

本文共 1222 字，大约阅读时间需要 4 分钟。

???

?????????????????????????????????????????????????????????????????????????????????????????????????????"NO"?????"YES"?

???

#include 
   
    #include 
    
     #include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          
           #include 
           
            #include 
            #define ll long long#define dd double#define mes(x, y) memset(x, y, sizeof(y))using namespace std;ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b);}struct node { int x, y;};node z[3000];int main() { int n; cin >> n; int k = 0; char a[100][100]; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { cin >> a[i][j]; if (a[i][j] == '.') { z[k].x = i; z[k].y = j; ++k; } } } for (int i = 0; i < k; ++i) { int x = z[i].x; int y = z[i].y; if (x < 0 || x >= n || y < 0 || y >= n) { continue; } int cross_x[4] = {-1, 1, 0, 0}; int cross_y[4] = {0, 0, -1, 1}; bool is_cross = false; for (int d = 0; d < 4; ++d) { int nx = x + cross_x[d]; int ny = y + cross_y[d]; if (nx >= 0 && nx < n && ny >= 0 && ny < n) { if (a[nx][ny] == '.') { is_cross = true; break; } } } if (!is_cross) { a[x][y] = '#'; } } for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (a[i][j] == '.') { cout << "NO" << endl; return; } } } cout << "YES" << endl;}