Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int n,m,i,j,cnt;
- char s[103][103];
- void dfs(int i,int j)
- {
- if(i==n || j==m)
- {
- return;
- }
- if(s[i][j]=='.')
- {
- s[i][j]='B';
- }
- if((s[i+1][j]=='B' || s[i][j+1]=='B') && s[i][j]!='-')
- {
- s[i][j]='W';
- }
- if((s[i+1][j]=='W' || s[i][j+1]=='W') && s[i][j]!='-')
- {
- s[i][j]='B';
- }
- if((s[i-1][j]=='W' || s[i][j-1]=='W') && s[i][j]!='-')
- {
- s[i][j]='B';
- }
- if((s[i-1][j]=='B' || s[i][j-1]=='B') && s[i][j]!='-')
- {
- s[i][j]='W';
- }
- dfs(i+1,j);
- dfs(i,j+1);
- }
- int main()
- {
- cin>>n>>m;
- for(i=0;i<n;i++)
- {
- for(j=0;j<m;j++)
- {
- cin>>s[i][j];
- }
- }
- for(i=0;i<n;i++)
- {
- for(j=0;j<m;j++)
- {
- dfs(i,j);
- cnt++;
- break;
- }
- if(cnt>0)
- {
- break;
- }
- }
- for(i=0;i<n;i++)
- {
- for(j=0;j<m;j++)
- {
- cout<<s[i][j];
- }
- cout<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement