A14228 | $Yet Another Card Deck$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You have a card deck of $n$ cards, numbered from top to bottom, i. e. the top card has index $1$ and bottom card — index $n$ . Each card has its color: the $i$ -th card has color $a_i$ . You should process $q$ queries. The $j$ -th query is described by integer $t_j$ . For each query you should: - find the highest card in the deck with color $t_j$ , i. e. the card with minimum index; - print the position of the card you found; - take the card and place it on top of the deck.

The first line contains two integers $n$ and $q$ ( $2 \le n \le 3 \cdot 10^5$ ; $1 \le q \le 3 \cdot 10^5$ ) — the number of cards in the deck and the number of queries. The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 50$ ) — the colors of cards. The third line contains $q$ integers $t_1, t_2, \dots, t_q$ ( $1 \le t_j \le 50$ ) — the query colors. It's guaranteed that queries ask only colors that are present in the deck.

Print $q$ integers — the answers for each query.

输入 #1

7 5
2 1 1 4 3 3 1
3 2 1 1 4

输出 #1

5 2 3 1 5

C++ 编辑器

输入

输出