1150B - Tiling Challenge - CodeForces Solution


greedy implementation *900

Please click on ads to support us..

C++ Code:

    #include<bits/stdc++.h>
    #define int long long
    using namespace std;
     
    char a[101][101];
    signed main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        for(int i=0;i<=100;i++){
            for(int j=0;j<=100;j++)
              a[i][j]='#';
        }
        int n;
        cin>>n;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                cin>>a[i][j];
            }
        }
        bool flag=true;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(a[i][j]=='.'){
                    if(a[i+1][j-1]=='#' || a[i+1][j]=='#' || a[i+1][j+1]=='#' || a[i+2][j]=='#'){
                        flag=false;
                    }
                        a[i][j]=a[i+1][j-1]=a[i+1][j]=a[i+1][j+1]=a[i+2][j]='#';
                }
            }
        }
        	if(flag)
    		cout<<"Yes"<<endl;
    	else
    		cout<<"NO"<<endl;
        return 0;
    }


Comments

Submit
0 Comments
More Questions

901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers
1174A - Ehab Fails to Be Thanos
1169A - Circle Metro
780C - Andryusha and Colored Balloons
1153A - Serval and Bus
1487C - Minimum Ties
1136A - Nastya Is Reading a Book
1353B - Two Arrays And Swaps
1490E - Accidental Victory
1335A - Candies and Two Sisters
96B - Lucky Numbers (easy)
1151B - Dima and a Bad XOR
1435B - A New Technique
1633A - Div 7
268A - Games
1062B - Math
1294C - Product of Three Numbers
749A - Bachgold Problem
1486B - Eastern Exhibition
1363A - Odd Selection
131B - Opposites Attract