安徽科技工程大学程序设计在线考试系统Ver3.0

诚信考试,杜绝作弊!

问题 L: Dynamic Arrays and List - List

内存限制:512 MB 时间限制:10 S 标准输入输出
题目类型:传统 评测方式:文本比较

题目描述

List 

For a dynamic list L of integers, perform a sequence of the following operations. 

L has a special element called END at the end of the list and an element of L is indicated by a cursor. 

insert(x): Insert x before the element indicated by the cursor. After this operation, the cursor points the inserted element. 

move(d): Move the cursor to the end by d, if d is positive. Move the cursor to the front by d, if d is negative. 

erase(): Delete the element indicated by the cursor. After this operation, the cursor points the element next to the deleted element. 

In case there is no such element, the cursor should point END. In the initial state, L is empty and the cursor points END.

输入格式

The input is given in the following format. 

q 

query1 

query2 

: 

queryq 

Each query queryi is given by 0 x or 1 d or 2 where the first digits 0, 1 and 2 represent insert, move and erase operations respectively. 1≤q≤500,000 The cursor indicates an element of L or END during the operations Erase operation will not given when the cursor points END −1,000,000,000≤x≤1,000,000,000 Moving distance of the cursor (∑|d|) does not exceed 1,000,000 L is not empty after performing all operations

输出格式

Print all elements of the list in order after performing given operations. Print an element in a line.

输入样例 复制

5
0 1
0 2
0 3
1 1
2

输出样例 复制

3
1