## Mr. N and Presents

View as PDF

Points: 7 (partial)
Time limit: 1.0s
Memory limit: 64M

Author:
Problem type

Mr. N, a kind CS teacher, has decided to give out presents to his hard working students! He has decided that a harder working student should get priority over a student that has slacked off. Unfortunately, some of Mr. N's students are trolls, and Mr. N will remove them from his list if he sees fit. Hoping to move up Mr. N's list, you decide to write a program to order the list.

#### Input Specification

The first line will have an integer , the number of queries that follow.
Lines will each contain one of three possible queries:

• F x: add student to the beginning of the list
• E x: add student to the end of the list
• R x: remove student from the list. is guaranteed to be a student already in the list.

is an integer .

#### Output Specification

Output the list, from beginning to end, with each number on a new line. It is guaranteed that the list will only contain distinct integers.

For of points, and each satisfies .

#### Sample Input

5
F 1
F 2
R 1
E 3
E 1

#### Sample Output

2
3
1

• commented on Dec. 24, 2018, 1:55 p.m.

Any tips for how to solve if i get TLE in Batch #2? I have got AC in Batch #1 already. Thanks!

• commented on Dec. 23, 2018, 3:49 p.m.

Shouldn't the input specifications say lines 2...Q + 1? Line numbers don't start from index 0 xd.

• commented on Oct. 3, 2017, 10:52 a.m.

anyone know why i'm getting an IR: ValueError? the only problem i can think of is with deque.remove, but the problem states that x is guaranteed to be a student in the list, so there shouldn't be anything wrong with that.

• commented on Jan. 1, 2017, 6:28 p.m.

Sorry, this is my first contest. Is the clipboard supposed to show us the program's output or is it disabled? My clipped solution is blank and I don't think it's my program.

• commented on Jan. 1, 2017, 6:38 p.m.

Your output is clipped, meaning that it doesn't show the full output. For most contests on DMOJ, no output is shown at all.

• commented on Jan. 1, 2017, 6:40 p.m.

ty

• commented on Jan. 1, 2017, 6:38 p.m.

The judge will not show your output

• commented on Jan. 1, 2017, 6:40 p.m.

ty

• commented on Jan. 1, 2017, 2:19 p.m.

With each number of a new line?

• commented on Jan. 2, 2017, 9:31 a.m.

on

• commented on Jan. 1, 2017, 1:52 p.m. edited

I have the sample case working but I instantly get WA when I test

A little new to C++ so i have no clue what im doing wrong, thanks!

EDIT: Never mind i'm just bad at copying and pasting :) Happy new year

• commented on Jan. 1, 2017, 12:30 p.m.

For 20% of points, N≤1000. You mean Q right?

• commented on Jan. 1, 2017, 12:37 p.m.

• commented on Jan. 1, 2017, 9:47 a.m.

this test is valid?

5
F 1
F 1
R 1
E 3
E 1
• commented on Jan. 1, 2017, 9:51 a.m.

I don't think so because on the problem statement it says "It is guaranteed that the list will only contain distinct integers".

• commented on Jan. 1, 2017, 10:07 a.m.

it can be ... the last list of my test is distinct(output)

• commented on Jan. 1, 2017, 9:50 a.m.

No, because students that are already in the list cannot be inserted again. Also, students that are not in the list cannot be erased

• commented on Jan. 1, 2017, 9:50 a.m. edited

No, since 1 is inserted twice without being removed in between.

• commented on Jan. 1, 2017, 10:07 a.m.

ok ... tnx ...