[Solution] Card Trick Codeforces Solution | Codeforces Problem Solution 2022

[Solution] Card Trick Codeforces Solution | Codeforces Problem Solution 2022

B. Card Trick

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Monocarp has just learned a new card trick, and can't wait to present it to you. He shows you the entire deck of n$n$ cards. You see that the values of cards from the topmost to the bottommost are integers a1,a2,…,an$a_1,a_2,\dots ,a_n$, and all values are different.

Then he asks you to shuffle the deck m$m$ times. With the j$j$-th shuffle, you should take bj$b_j$ topmost cards and move them under the remaining (n−bj)$(n-b_j)$ cards without changing the order.

And then, using some magic, Monocarp tells you the topmost card of the deck. 

Solution Click Below:-  CLICK HERE

However, you are not really buying that magic. You tell him that you know the topmost card yourself. Can you surprise Monocarp and tell him the topmost card before he shows it?

Input

The first line contains a single integer t$t$ (1≤t≤104$1\le t\le {10}^4$) — the number of testcases.

Double Sort Codeforces Solution

Game with Cards Codeforces Solution

Card Trick Codeforces Solution

Labyrinth Adventures Codeforces Solution

Unique Occurrences Codeforces Solution

Required Length Codeforces Solution

The first line of each testcase contains a single integer n$n$ (2≤n≤2⋅105$2\le n\le 2\cdot {10}^5$) — the number of cards in the deck.

The second line contains n$n$ pairwise distinct integers a1,a2,…,an$a_1,a_2,\dots ,a_n$ (1≤ai≤n$1\le a_i\le n$) — the values of the cards.

The third line contains a single integer m$m$ (1≤m≤2⋅105$1\le m\le 2\cdot {10}^5$) — the number of shuffles.

The fourth line contains m$m$ integers b1,b2,…,bm$b_1,b_2,\dots ,b_m$ (1≤bj≤n−1$1\le b_j\le n-1$) — the amount of cards that are moved on the j$j$-th shuffle.

The sum of n$n$ over all testcases doesn't exceed 2⋅105$2\cdot {10}^5$. The sum of m$m$ over all testcases doesn't exceed 2⋅105$2\cdot {10}^5$.

Output

For each testcase, print a single integer — the value of the card on the top of the deck after the deck is shuffled