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
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
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.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY