CARDS

Alice and Bob have a set of N cards labelled with numbers 1 ... N (so that no two cards have the same label) and a shuffle machine. We assume that N is an odd integer. 
The shuffle machine accepts the set of cards arranged in an arbitrary order and performs the following operation of double shuffle : for all positions i, 1 <= i <= N, if the card at the position i is j and the card at the position j is k, then after the completion of the operation of double shuffle, position i will hold the card k. 

Alice and Bob play a game. Alice first writes down all the numbers from 1 to N in some random order: a1, a2, ..., aN. Then she arranges the cards so that the position ai holds the card numbered a_i+1, for every 1 <= i <= N-1, while the position aN holds the card numbered a1. 

This way, cards are put in some order x1, x2, ..., xN, where xi is the card at the i^th position. 

Now she sequentially performs S double shuffles using the shuffle machine described above. After that, the cards are arranged in some final order p1, p2, ..., pN which Alice reveals to Bob, together with the number S. Bob‘s task is to guess the order x1, x2, ..., xN in which Alice originally put the cards just before giving them to the shuffle machine. 

The first line of the input contains two integers separated by a single blank character : the odd integer N, 1 <= N <= 1000, the number of cards, and the integer S, 1 <= S <= 1000, the number of double shuffle operations. 
The following N lines describe the final order of cards after all the double shuffles have been performed such that for each i, 1 <= i <= N, the (i+1)^st line of the input file contains pi (the card at the position i after all double shuffles). 

The output should contain N lines which describe the order of cards just before they were given to the shuffle machine. 
For each i, 1 <= i <= N, the ith line of the output file should contain xi (the card at the position i before the double shuffles). 

7 46312475

4756123

CEOI 1998

 

// Memory   Time// 1347K     0MS// by : Snarl_jsb// 2014-09-11-20.34#include<algorithm>#include<cstdio>#include<cstring>#include<cstdlib>#include<iostream>#include<vector>#include<queue>#include<stack>#include<map>#include<string>#include<climits>#include<cmath>#define N 1010#define LL long longusing namespace std;int a[N],b[N],c[N],n,m;int work(){    int j;    int cnt=0;    while(1)    {        for(int i=1;i<=n;i++)           b[i]=c[c[i]];        cnt++;        for(j=1;j<=n;j++)          if(b[j]!=a[j])            break;        if(j>n)break;        for(int i=1;i<=n;i++)           c[i]=b[i];    }    return cnt;}int main(){//    freopen("C:\\Users\\ASUS\\Desktop\\cin.cpp","r",stdin);//    freopen("C:\\Users\\ASUS\\Desktop\\cout.cpp","w",stdout);    while(scanf("%d%d",&n,&m)!=EOF)    {        for(int i=1;i<=n;i++)        {            scanf("%d",&a[i]);            c[i]=a[i];            b[i]=a[i];        }        int cnt=work();        m%=cnt;        m=cnt-m;        while(m--)        {            for(int i=1;i<=n;i++)              b[i]=a[a[i]];            for(int i=1;i<=n;i++)               a[i]=b[i];        }        for(int i=1;i<=n;i++)          printf("%d\n",b[i]);    }    return 0;}