Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
You are given a collection of N non-empty strings, denoted by S1, S2, .. , Sµ. Then you are given N -1 operations which you execute in the order they are given. The ih operation is has the following format: 'a b’ (1-based indexing, without the quotes), which means that you have to make the following changes: 1. Sa = Sa+ Sb, i.e. concatenate a'" string and b'h string and store the result in a'" string, 2. S, = "", i.e. make the b'h string empty, after doing the previous step. You are ensured that after the i" operation, there will be no future operation that will be accessing Sp. Given these operations to join strings, print the last string that will remain at the end of this process. Input The first line contains an integer N (1 < N < 10°) denoting the number of strings given. Each of the next N lines contains a string denoting the S;. All the characters in the string S; are lowercase alphabets from 'a' to 'z'. The total number of characters over all the strings is at most 106, i.e E, IS;| < 10°, where |S;| denotes the length of the ih string. After these N strings, each of the next N-1 lines contain two integers a and b, such that a + b and 1 < a, b < N denoting the i" operation. Output Print the last string which remains at the end of the N-1 operations.

You are given a collection of N non-empty strings, denoted by S1, S2, .. , Sµ. Then you are given N -1 operations which you execute in the order they are given. The ih operation is has the following format: 'a b’ (1-based indexing, without the quotes), which means that you have to make the following changes: 1. Sa = Sa+ Sb, i.e. concatenate a'" string and b'h string and store the result in a'" string, 2. S, = "", i.e. make the b'h string empty, after doing the previous step. You are ensured that after the i" operation, there will be no future operation that will be accessing Sp. Given these operations to join strings, print the last string that will remain at the end of this process. Input The first line contains an integer N (1 < N < 10°) denoting the number of strings given. Each of the next N lines contains a string denoting the S;. All the characters in the string S; are lowercase alphabets from 'a' to 'z'. The total number of characters over all the strings is at most 106, i.e E, IS;| < 10°, where |S;| denotes the length of the ih string. After these N strings, each of the next N-1 lines contain two integers a and b, such that a + b and 1 < a, b < N denoting the i" operation. Output Print the last string which remains at the end of the N-1 operations.

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
100%

Hi! Here is a java problem that I am currently stuck on. Would greatly appreciate the help! 

You are given a collection of N non-empty strings, denoted by S1, S2, ... , Sn. Then you are given N -1 operations which you execute in the order they are given. The i" operation is has the following format: 'a b’ (1-based indexing, without the quotes), which means that you have to make the following changes: 1. Sa Sa+ Sh, i.e. concatenate a'" string and b'" string and store the result in a" string, 2. Sh ', i.e. make the b'" string empty, after doing the previous step. %3D You are ensured that after the i" operation, there will be no future operation that will be accessing S,. Given these operations to join strings, print the last string that will remain at the end of this process. Input The first line contains an integer N (1 < N < 10°) denoting the number of strings given. Each of the next N lines contains a string denoting the S. All the characters in the string S; are lowercase alphabets from 'a' to 'z'. The total number of characters over all the strings is at most 10°, i.e E |S;| < 10°, where |S;| denotes the length of the i" string. After these N strings, each of the next N-1 lines contain two integers a and b, such that a + b and 1 < a, b < N denoting the i" operation. i=1 Output Print the last string which remains at the end of the N-1 operations.
Transcribed Image Text:You are given a collection of N non-empty strings, denoted by S1, S2, ... , Sn. Then you are given N -1 operations which you execute in the order they are given. The i" operation is has the following format: 'a b’ (1-based indexing, without the quotes), which means that you have to make the following changes: 1. Sa Sa+ Sh, i.e. concatenate a'" string and b'" string and store the result in a" string, 2. Sh ', i.e. make the b'" string empty, after doing the previous step. %3D You are ensured that after the i" operation, there will be no future operation that will be accessing S,. Given these operations to join strings, print the last string that will remain at the end of this process. Input The first line contains an integer N (1 < N < 10°) denoting the number of strings given. Each of the next N lines contains a string denoting the S. All the characters in the string S; are lowercase alphabets from 'a' to 'z'. The total number of characters over all the strings is at most 10°, i.e E |S;| < 10°, where |S;| denotes the length of the i" string. After these N strings, each of the next N-1 lines contain two integers a and b, such that a + b and 1 < a, b < N denoting the i" operation. i=1 Output Print the last string which remains at the end of the N-1 operations.
Warning The I/O files are large. Please use fast I/O methods. Sample Input 1 Sample Output 1 4 kattiscatiscute cute cat kattis is 3 2 4 1 3 4 Sample Input 2 Sample Output 2 3 howisthispracticalexam howis this practicalexam 1 2 1 3
Transcribed Image Text:Warning The I/O files are large. Please use fast I/O methods. Sample Input 1 Sample Output 1 4 kattiscatiscute cute cat kattis is 3 2 4 1 3 4 Sample Input 2 Sample Output 2 3 howisthispracticalexam howis this practicalexam 1 2 1 3
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Hash Table
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS