Skip to main content

Codeforces round 1182(B. Plus from Picture)

At first check the middle * (point tat connected to east,west,south,north)
then * connected to the last of every four direction if (.) occurs then break.

///Bismillahir Rahmanir Rahim
///Author: Tanvir Ahmmad
///CSE,Islamic University,Bangladesh

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<sstream>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<vector>
#include<iterator>
#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array
/*every external angle sum=360 degree
  angle find using polygon hand(n) ((n-2)*180)/n*/
///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b
using namespace std;
typedef long long ll;

int main()
{
    ll h,w,traitor=-1,on=-1;
    cin>>h>>w;
    string str[h+2];
    ll vis[h+2][w+2];

    for(ll i=0; i<h; i++)
        cin>>str[i];
    for(ll i=0; i<h; i++)
        for(ll j=0; j<w; j++)
            vis[i][j]=0;

    for(ll i=0; i<h; i++)
        for(ll j=0; j<w; j++)
            if(str[i][j]=='*')
                vis[i][j]=1;

    for(ll i=1; i<h-1; i++)
        for(ll j=1; j<w-1; j++)
            if(str[i][j]=='*' && str[i-1][j]=='*' && str[i][j-1]=='*' && str[i][j+1]=='*' && str[i+1][j]=='*')
            {
                traitor=i,on=j;
                break;
            }
    if(traitor!=(-1) && on!=(-1))
    {
        for(ll i=traitor; i<=traitor; i++)
            for(ll j=on+1; j<w; j++)
            {
                if(str[i][j]=='.')
                    break;
                else
                    vis[i][j]=0;
            }
        for(ll i=traitor; i<=traitor; i++)
            for(ll j=on-1; j>=0; j--)
            {
                if(str[i][j]=='.')
                    break;
                else
                    vis[i][j]=0;
            }
ll go=0;
        for(ll i=traitor+1; i<h && go!=1 ; i++)
            for(ll j=on; j<=on; j++)
            {
                if(str[i][j]=='.')
                {
                    go=1;
                    break;
                }
                else
                    vis[i][j]=0;
            }
        go=0;
        for(ll i=traitor; i>=0 && go!=1; i--)
            for(ll j=on; j<=on; j++)
            {
                if(str[i][j]=='.')
                {
                    go=1;
                    break;
                }
                else
                    vis[i][j]=0;
            }
    }
    ll flag=1;
    for(ll i=0;i<h;i++)
        for(ll j=0;j<w;j++)
    if(vis[i][j])
    {
        flag=0;
        break;
    }
    if(flag && traitor!=(-1) && on!=(-1)) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}
///Alhamdulillah         

Problem Link:https://codeforces.com/contest/1182/problem/B


 

Labels:

Comments

Post a Comment

Popular posts from this blog

Codeforces round 1661(B. Getting Zero)

using   second operation  the answer is maximum is  15  because  2 15 =32768 so we need to  pre-calculate all the illegible input 0 to 32768   using  second operation Then  just increment 1(using first operation)  from input check is it  minimum is not ! ///Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include< iostream > #include< cstdio > #include< algorithm > #include< string > #include< cstring > #include< sstream > #include< cmath > #include< cstring > #include< vector > #include< queue > #include< map > #include< set > #include< stack > #include< vector > #include< iterator > #include   < functional >   ///sort(arr,arr+n,greater<int...
Post a Comment
Read more

Codeforces round 1676(A. Lucky?)

Just count the  first three  &  last three  number ///Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include< iostream > #include< cstdio > #include< algorithm > #include< string > #include< cstring > #include< sstream > #include< cmath > #include< cstring > #include< vector > #include< queue > #include< map > #include< set > #include< stack > #include< vector > #include< iterator > #include   < functional >   ///sort(arr,arr+n,greater<int>()) for decrement of array /*every external angle sum=360 degree   angle find using polygon hand(n) ((n-2)*180)/n*/ ///Floor[Log(b)  N] + 1 = the number of digits when any number is repres...
Post a Comment
Read more

Codeforces Round #282 (Div. 2) (B. Modular Equations)

Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include< iostream > #include< cstdio > #include< algorithm > #include< string > #include< cstring > #include< sstream > #include< cmath > #include< cstring > #include< vector > #include< queue > #include< map > #include< set > #include< stack > #include< vector > #include< iterator > #include   < functional >   ///sort(arr,arr+n,greater<int>()) for decrement of array /*every external angle sum=360 degree   angle find using polygon hand(n) ((n-2)*180)/n*/ ///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b using   namespace  std; typedef   long   long ...
Post a Comment
Read more