Problem 2605 --Dynamic Arrays and List - List

2605: Dynamic Arrays and List - List

"
Time Limit $10$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $757$ 正确数量 $740$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL

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. 

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

推荐代码 查看2605 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$82 $ms] 空城花惊落 947526 2023-03-19 19:43:54
内存最少[$0 $KB] Qiqy 608772 2020-07-28 16:46:08
第一AC 计爱玲 281482 2018-10-06 18:37:51
第一挑战 计爱玲 281482 2018-10-06 18:37:51

赛题来源/所属竞赛 会津大学《C++ Programming II》 C++程序设计(高级)

竞赛编号 竞赛名称 竞赛时间 访问比赛
1798 2023-2024-2学期<计算机专业竞赛实训> 第2周练习:STL容器基础数据结构应用【22计算机】 2024-03-04 00:00:00 请登录
1738 2022-2023-2学期<计算机专业竞赛实训> 第4周练习:STL容器与数据结构应用【21计算机12345】 2023-03-13 00:00:00 请登录
1731 2022-2023-1学期《程序设计技能实训》线性表【22计算机】 2022-12-26 00:00:00 请登录
1680 2021-2022-2学期<算法分析与设计> 第1周练习:STL容器1:vetor/list/queue/deque/sort 2022-02-21 08:00:00 请登录
1609 2020-2021-2学期<算法分析与设计> 第5-6周练习:基础数据结构实现 2021-03-26 19:00:00 请登录