8. 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. Input format First line: An integer n that represents the number of grids (1
8. 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. Input format First line: An integer n that represents the number of grids (1
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Transcribed Image Text:8. 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.
Your task is to decide whether there is a possible solution. Print the possible solution.
Input format
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.
●
First line: An integer n that represents the number of grids (1<n<20)
Second line: n characters that indicate the villages that are represented
as H or.
Output format
The output must be printed in the following format:
First line: If possible, then print YES. Otherwise, print NO.
Second line: If the answer is YES, then print the way to do so.
Sample Input
5
H...H
Sample Output
YES
HBBBH
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education