More and more programming languages today are embracing the phenomenon of automatic memory management. As a Language Development Lead your supervisor is responsible for managing memory allocation routines of the Language Compiler. Since this is beta release of the language your supervisor is developing, he wants to keep memory management routines clean and simple.

Rules for allocating memory are quite simple :
Continuous memory locations can be merged together to form a “Free List”. Free Lists are maintained via indexes in simple data structures.
When it comes to memory allocations, routines should prefer Exact-Fit over First-Fit
If and only if there is no Exact-Fit, the routines should find the First-Fit where the object can be allocated.
You are developing this memory-subsystem as per specifications provided by your supervisor. Go ahead and crack the problem. Specifications are as depicted below :

Input Format:

Line 1

Input absolute path of the memory representation file
Line 2

Memory allocation required by the object
File Format:

Each memory representation file consists of 4 column separated by a comma. File will end with a New Line character. The 4 fields are as depicted below :

Index Id, Start Offset, File Size, Delete Flag
Output Format:

Print “Inserted at index I”,where I is position where insertion is made or “Can not be inserted”,if insertion in any index is not possible

Line 1
For Valid Input,print
“Inserted at index I”,where I is position where insertion is made
Or
“Can not be inserted” if insertion is not possible



Sample Test Cases:

File:Input.txt

1,1,100,N

2,101,250,N

3,352,100,Y

4,453,50,N

5,504,100,Y

6,605,100,Y

7,606,100,N

• i think this is the type of * questions??
  
• 11 years agoHelpfull: Yes(1) No(0)