Teque

[primal kestrel]

The teque supports the following four operations:

push_back x: insert the element x into the back of the teque.
push_front x: insert the element x into the front of the teque.
push_middle x: insert the element x into the middle of the teque. The inserted element x now becomes the new middle element of the teque. If k is the size of the teque before the insertion, the insertion index for x is (k+1) / 2 (using 0-based indexing).

get i: prints out the ith index element (0-based) of the teque.

Input
The first line contains an integer N denoting the number of operations for the teque. Each of the next N lines contains a denoting one of the above commands, followed by one integer x. We guarantee that the teque is not empty when any get command is given.

Output
For each get i command, print the value inside the ith index element of the teque in a new line.

Warning
The I/O files are large. Please use fast I/O methods.

[dusky ridge]

<@&987246717831381062> please have a look, thanks.

[dusky ridge]

While you are waiting for getting help, here are some tips to improve your experience:

Code is much easier to read if posted with syntax highlighting and proper formatting.

If nobody is calling back, that usually means that your question was not well asked and hence nobody feels confident enough answering. Try to use your time to elaborate, provide details, context, more code, examples and maybe some screenshots. With enough info, someone knows the answer for sure.

Don't forget to close your thread using the command </help-thread close:1027500463647621170> when your question has been answered, thanks.

Here is an AI assisted attempt to answer your question 🤖. Maybe it helps! In any case, a human is on the way 👍. To continue talking to the AI, you can use </chatgpt:1108714622413963314>.

nsert the element x into the middle of the teque. If the teque has an odd number of elements, x is inserted after the middle element. If the teque has an even number of elements, x is inserted before the middle element.
get k: return the kth element in the teque, where 0 ≤ k < size of teque.

The teque is a data structure that combines properties of both a deque and a list. It allows for efficient insertion and retrieval at both ends (front and back) as well as in the middle.

Here is an example usage of the teque:

teque.push_back(1); // [1]
teque.push_front(2); // [2, 1]
teque.push_middle(3); // [2, 3, 1]
teque.push_middle(4); // [2, 4, 3, 1]
int element = teque.get(2); // returns 3

Note that in this example, we first push_back(1) to insert 1 at the back of the teque. Then we push_front(2) to insert 2 at the front. Next, we push_middle(3), which inserts 3 after the middle element (which is currently 2). Finally, we push_middle(4), which inserts 4 before the middle element (which is now 3).

To retrieve an element from the teque, we use get(k), where k represents the index of the desired element. In this case, calling get(2) returns the third element in the teque (which is currently 3).

Overall, Teques are useful when you need to efficiently insert and retrieve elements from both ends as well as in the middle.

[red compass]

I'm assuming u are asked to implement a teque.

Pls provide ur code so far

The logic uve used and the part where ur stuck on