Split Houses

 

   

Split Houses

Problem

You live in a village. The village can be represented as a line that contains n  grids. Each grid can be denoted as a house that is marked as H or a blank space that is marked as .

A person lives in each house. A person can move to a grid if it is adjacent to that person. Therefore, the grid must be present on the left and right side of that person.

Now, you are required to put some fences that can be marked as B  on some blank spaces so that the village can be divided into several pieces. A person cannot walk past a fence but can walk through a house. 

You are required to divide the house based on the following rules:

• A person cannot reach a house that does not belong to that specific person.
• The number of grids each person can reach is the same and it includes the grid in which the house is situated.
• In order to show that you are enthusiastic and if there are many answers, then you are required to print the one where most fences are placed.

Your task is to decide whether there is a possible solution. Print the possible solution. 

C Solution:

1. #include<stdio.h>
2. int main()
3. {   int  i, n;
4.     char ch[20];
5.     scanf("%d",&n);
6.     scanf("%s",&ch);
7.     for(i=0; i<n; i++) {
8.         if(ch[i]=='H' && ch[i+1]=='H') {
9.             printf("NO");
10.             return 0;
11.         }
12.         else if(ch[i]=='.')
13.             ch[i]='B';
14.             }
15. 
    
16.         printf("YES\n");
17.     
18.     for(i=0; i<n; i++)
19.         printf("%c",ch[i]);
20. return 0;
21. }

Python Solution:

intInput=int(input())

stringInput=input()

count=0

if "HH" in StringInput:

    print("NO")

else:

    print("YES")

    count=1

if count==1:

    stringInput=StringInput.replace(".","B")

print(stringInput)

JAVA Solution:

1. import java.util.Scanner;
2. public class SplitHouse {
3.    public static void main(String args[] ) throws Exception {
4.       Scanner in = new Scanner(System.in);
5.       int n = in.nextInt();
6.       char[] ch = new char[n];
7.       for(int i=0;i<n;i++){
8.        ch[i] = in.next().charAt(0);
9.       }
10.       try {
11.        for(int j=0;j<n+1;j++) {
12.            if((ch[j]=='H')&&(ch[j+1]=='H')) {
13.             System.out.println("No");
14.             }
15.            else {
16.             if(ch[j]=='.') {
17.              ch[j]='B';
18.             }
19.            }
20.            }  
21.       }
22.       catch(Exception ArrayIndexOutOfBoundException) {
23.       }
24.       for(int ai=0;ai<n;ai++){
25.       System.out.println(ch[ai]);
26.       }
27.    }
28. }

C++ Solution:

1. #include<bits/stdc++.h>
2. #include <iostream>
3. using namespace std;
4. int main(){
5. int n,flag=0;
6. string str;
7. cin>>n>>str;
8. for(int i=0;i<n;i++){
9.     if(str[i]=='H' && str[i+1]=='H') flag=1;
10. else if(str[i]=='.') str[i]='B';
11. }
12. if(flag==1) cout<<"NO";
13. if(flag!=1){
14. cout<<"YES"<<endl;
15. cout<<str<<endl;
16. }
17. }

Kotlin Solution:

1. fun main() {
2.     val n = readLine()!!.toInt()
3.     val input = readLine()!!.toCharArray()
4.     var ifPossible = false
5.     if (input.contains('.')) {
6.         for (i in input.indices) {
7.             if (input[i] == '.') {
8.                 input[i] = 'B'
9.                 ifPossible = true
10.             }
11.             if (i != input.size - 1) {
12.                 if (input[i] == 'H' && input[i + 1] == 'H') {
13.                     ifPossible = false
14.                     break
15.                 }
16.             }
17.         }
18.     } else if (n == 1 && input[0] == 'H')
19.         ifPossible = true
20.     if (ifPossible) {
21.         println("YES")
22.         println(input)
23.     } else
24.         println("NO")
25. }

Note:

       We Are Providing Every Content in this Blog Inspired From Many People and Provide it Open To All People Who Are Willing Gain Some Stuff in Computer Science.

Comment below👇 for Any Errors & Doubts.