A9357 | Inna and Sequence
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Dima's spent much time thinking what present to give to Inna and gave her an empty sequence $w$ . Now they want to fill sequence $w$ with numbers zero and one. For that, they decided to play an amusing game.
Before the game begins, Dima chooses $m$ integers $a_{1},a_{2},...,a_{m}$ $(1<=a_{1}<a_{2}<...<a_{m})$ . Then Inna and Dima start playing, that is, adding numbers to sequence $w$ . Each new number they choose is added to the end of the sequence. At some moments of time Dima feels that the game is going to end too soon (and he wants to play with Inna as long as possible), so he hits a table hard with his fist. At that the $a_{1}$ -th, $a_{2}$ -th, $a_{3}$ -th, $...$ , $a_{k}$ -th numbers from the beginning simultaneously fall out of the sequence (the sequence gets $k$ numbers less). Here $k$ is such maximum number that value $a_{k}$ doesn't exceed the current length of the sequence. If number $a_{1}$ is larger than the current length of $w$ , then nothing falls out of the sequence.
You are given the chronological sequence of events in the game. Each event is either adding a number to the end of sequence $w$ or Dima's hit on the table. Calculate the sequence $w$ after all these events happen.
Before the game begins, Dima chooses $m$ integers $a_{1},a_{2},...,a_{m}$ $(1<=a_{1}<a_{2}<...<a_{m})$ . Then Inna and Dima start playing, that is, adding numbers to sequence $w$ . Each new number they choose is added to the end of the sequence. At some moments of time Dima feels that the game is going to end too soon (and he wants to play with Inna as long as possible), so he hits a table hard with his fist. At that the $a_{1}$ -th, $a_{2}$ -th, $a_{3}$ -th, $...$ , $a_{k}$ -th numbers from the beginning simultaneously fall out of the sequence (the sequence gets $k$ numbers less). Here $k$ is such maximum number that value $a_{k}$ doesn't exceed the current length of the sequence. If number $a_{1}$ is larger than the current length of $w$ , then nothing falls out of the sequence.
You are given the chronological sequence of events in the game. Each event is either adding a number to the end of sequence $w$ or Dima's hit on the table. Calculate the sequence $w$ after all these events happen.
输入格式
The first line of the input contains two integers $n$ and $m$ $(1<=n,m<=10^{6})$ showing how many events took place and how many numbers Dima chose.
The next line contains $m$ distinct integers $a_{i}$ $(1<=a_{i}<=10^{6})$ sorted in the increasing order.
Next $n$ lines describe the events in the chronological order. Each line contains a single integer: -1, 0 or 1. Number -1 means that Dima hits the table. Number 0 means that Inna and Dima add number 0 to the end of the sequence. Number 1 means that Inna and Dima add number 1 to the end of the sequence.
The next line contains $m$ distinct integers $a_{i}$ $(1<=a_{i}<=10^{6})$ sorted in the increasing order.
Next $n$ lines describe the events in the chronological order. Each line contains a single integer: -1, 0 or 1. Number -1 means that Dima hits the table. Number 0 means that Inna and Dima add number 0 to the end of the sequence. Number 1 means that Inna and Dima add number 1 to the end of the sequence.
输出格式
In a single line print a sequence of numbers 0 and 1 — the elements of the sequence after all events happen. Print the elements of the sequence in the order from the beginning to the end of the sequence.
If after all events the sequence ends up empty, print "Poor stack!".
If after all events the sequence ends up empty, print "Poor stack!".
输入输出样例
输入 #1
10 3 1 3 6 -1 1 1 0 0 -1 0 1 -1 1
输出 #1
011
输入 #2
2 1 1 1 -1
输出 #2
Poor stack!
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted