2018USACO真题Bronze2

USACO 2017 D ECEMBER C ONTEST , B RONZE

P ROBLEM 2. T HE B OVINE S HUFFLE

Convinced that happy cows generate more milk, Farmer John has installed a giant disco ball in his barn and plans to teach his cows to dance!

Looking up popular cow dances, Farmer John decides to teach his cows the "Bovine Shu ?e". The Bovine Shu ?e consists of his cows () lining up in a row in some order, then performing three "shu ?es" in a row, after which they will be lined up in some possibly di ?erent order. To make it easier for his cows to locate themselves, Farmer John marks the locations for his line of cows with positions , so the ?rst cow in the lineup will be in position 1, the next in position 2, and so on, up to

position .A shu ?e is described with N numbers, , where the cow in position moves to position during the shu ?

e (and so,

each is in the range ). Every cow moves to its new location during the shu ?e. Fortunately, all the 's are distinct, so no two cows try to move to the same position during a shu ?e.Farmer John's cows are each assigned distinct 7-digit integer ID numbers. If you are given the ordering of the cows after three shu ?es, please determine their initial order.

INPUT FORMAT (?le shu ?e.in):

The ?rst line of input contains , the number of cows. The next line contains the integers . The ?nal line contains the order of the cows after three shu ?es, with each cow speci?ed by its ID number.OUTPUT FORMAT (?le shu ?e.out):

You should write lines of output, with a single cow ID per line, specifying the order of the cows before the three shu ?es.SAMPLE INPUT:

5

1 3 4 5 2

1234567 2222222 3333333 4444444 5555555

SAMPLE OUTPUT:

1234567

5555555

2222222

3333333

4444444

Problem credits: Brian Dean N 1≤N ≤1001…N N …a 1a N i a i a i 1…N a i N N …a 1a N N N https://www.360docs.net/doc/b910866121.html,