**Dynamic Array in C**

### Problem Statement :

Snow Howler is the librarian at the central library of the city of HuskyLand. He must handle requests which come in the following forms: 1 x y : Insert a book with y pages at the end of the xth shelf. 2 x y : Print the number of pages in the yth book on the xth shelf. 3 x : Print the number of books on the xth shelf. Snow Howler has got an assistant, Oshie, provided by the Department of Education. Although inexperienced, Oshie can handle all of the queries of types 2 and 3. Help Snow Howler deal with all the queries of type 1. Oshie has used two arrays: int* total_number_of_books; /* * This stores the total number of books on each shelf. */ int** total_number_of_pages; /* * This stores the total number of pages in each book of each shelf. * The rows represent the shelves and the columns represent the books. */ Input Format The first line contains an integer total_number_of_shelves , the number of shelves in the library. The second line contains an integer total_number_of_queries , the number of requests. Each of the following total_number_of_queries lines contains a request in one of the three specified formats. Constraints 1 <= total_number_of_shelves <= 10^5 1 <= total_number_of_queries <= 10^5 For each query of the second type, it is guaranteed that a book is present on the xth shelf at yth index. 0 <= x < total_number_of_shelves Both the shelves and the books are numbered starting from 0. Maximum number of books per shelf <= 1100. Output Format Write the logic for the requests of type 1. The logic for requests of types 2 and 3 are provided.

### Solution :

` ````
Solution in C :
int main()
{
int total_number_of_shelves;
scanf("%d", &total_number_of_shelves);
int total_number_of_queries;
scanf("%d", &total_number_of_queries);
total_number_of_books=(int*)malloc(sizeof(int)*total_number_of_shelves);
total_number_of_pages=(int**)malloc(sizeof(int*)*total_number_of_shelves);
for(int i=0; i<total_number_of_shelves; i++){
total_number_of_books[i]=0;
total_number_of_pages[i]=(int*)malloc(sizeof(int));
}
while (total_number_of_queries--) {
int type_of_query;
scanf("%d", &type_of_query);
if (type_of_query == 1) {
int x, y;
scanf("%d %d", &x, &y);
*(total_number_of_books+x)+=1;
*(total_number_of_pages+x)=realloc(*(total_number_of_pages+x), *(total_number_of_books+x)*sizeof(int));
*(*(total_number_of_pages+x)+*(total_number_of_books+x)-1)=y;
```

## View More Similar Problems

## Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

View Solution →## QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element

View Solution →## Jesse and Cookies

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t

View Solution →## Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →## Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →## Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →