QOJ.ac

QOJ

Time Limit: 1.0 s Memory Limit: 32 MB Total points: 40

#17553. KOLONE

Statistics

蚂蚁在移动时会排成一队,除了第一只外,每只蚂蚁都排在另一只蚂蚁的后面。当两队朝相反方向移动的蚂蚁在一条因过于狭窄而无法让两队同时通过的通道中相遇时,会发生什么并不广为人知。一种理论认为,在这种情况下,蚂蚁会互相跳过对方。

从两队相遇的那一刻起,每一秒内,每只蚂蚁都会跳过(或被跳过,这取决于它们的约定)它前面的蚂蚁,从而使两只蚂蚁交换位置,但前提是对方蚂蚁正朝着相反的方向移动。求 $T$ 秒后蚂蚁的顺序。

输入格式

第一行包含两个整数 $N_1$ 和 $N_2$,分别表示第一队和第二队蚂蚁的数量。

接下来的两行分别包含第一队和第二队蚂蚁的顺序(从第一只到最后一只)。每只蚂蚁都由一个大写英文字母唯一确定(该字母在两队蚂蚁中都是唯一的)。

最后一行包含一个整数 $T$($0 \le T \le 50$)。

输出格式

在单行中输出 $T$ 秒后蚂蚁的顺序。我们的视角是:第一队蚂蚁从我们的左侧走来,另一队从我们的右侧走来。

样例

输入样例 1

3 3
ABC
DEF
0

输出样例 1

CBADEF

输入样例 2

3 3
ABC
DEF
2

输出样例 2

CDBEAF

输入样例 3

3 4
JLA
CRUO
3

输出样例 3

CARLUJO

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.