Problem:
Doubly Linked List

Your task is to implement a double linked list.

Write a program which performs the following operations:

insert x: insert an element with key x into the front of the list.

delete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.

deleteFirst: delete the first element from the list.

deleteLast: delete the last element from the list.

Input

The input is given in the following format:

n

command1

command2

...

commandn

In the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:

insert x

delete x

deleteFirst

deleteLast

Output

Print all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.

Constraints

The number of operations ≤ 2,000,000

The number of delete operations ≤ 20

0 ≤ value of a key ≤ 109

The number of elements in the list does not exceed 106

For a delete, deleteFirst or deleteLast operation, there is at least one element in the list.

Sample Input 1

7
insert 5
insert 2
insert 3
insert 1
delete 3
insert 6
delete 5

Sample Output 1

6 1 2

Sample Input 2

9
insert 5
insert 2
insert 3
insert 1
delete 3
insert 6
delete 5
deleteFirst
deleteLast

Sample Output 2

1

Solution in C++ (judge verdict: Accepted)

#include <stdio.h>
#include <string.h>

void deleteFirst(int**, int*);
void deleteLast(int**, int*);
void insertOne(int**, int**, int, int*);
void deleteOne(int**, int**, int, int*);

int main(void){
    int xs[2000002] = {};
    
    int* fp = &xs[2000000];
    int* lp = fp;
    int len = 0;
    int n;
    char str[20];
    fgets(str, sizeof(str), stdin);
    sscanf(str, "%d", &n);
    for(int i=0; i < n; ++i){
        fgets(str, sizeof(str), stdin);
        if(str[6] == 'F'){
            deleteFirst(&fp, &len);
        }else if(str[6] == 'L'){
            deleteLast(&lp, &len);
        }else{
            char *tp;
            int m;
            tp = strtok(str, " " );
            tp = strtok(NULL," ");
            sscanf(tp, "%d", &m);
            if(str[0] == 'i'){
                insertOne(&fp, &lp, m, &len);
            }else{
                deleteOne(&fp, &lp, m, &len);
            }
        }
        
        if(len == 0){
            fp = &xs[2000000];
            lp = fp;
        }
    }
    
    for(int i = 0; i < lp - fp; ++i){
        if(*(fp + i) != -1){
            printf("%d ", *(fp + i));
        }
    }
    printf("%d\n", *lp);
}

void deleteFirst(int** fp, int *len){
    **fp = -1;
    --*len;
    while(**fp == -1) ++*fp;
}

void deleteLast(int** lp, int* len){
    **lp = -1;
    --*len;
    while(**lp == -1) --*lp;
}

void insertOne(int** fp, int** lp, int m, int* len){
    if(*len == 0){
        **fp = m;
    }else{
        --*fp;
        **fp = m;
    }
    ++*len;
}

void deleteOne(int** fp, int** lp, int m, int* len){
    for(int j = 0; j <= *lp - *fp; ++j){
        if(*(*fp + j) == m){
            *(*fp + j) = -1;
            --*len;
            if(j == 0){
                while(**fp == -1) ++*fp;
            }else if((*fp + j) == *lp){
                while(**lp == -1) --*lp;
            }
            break;
        }
    }
}