2016暑假多校联合---Death Sequence（递推、前向星）

You may heard of the Joseph Problem, the story comes from a Jewish historian living in 1st century. He and his 40 comrade soldiers were trapped in a cave, the exit of which was blocked by Romans. They chose suicide over capture and decided that they would form a circle and start killing themselves using a step of three. Josephus states that by luck or maybe by the hand of God, he and another man remained the last and gave up to the Romans.

Now the problem is much easier: we have N men stand in a line and labeled from 1 to N, for each round, we choose the first man, the k+1-th one, the 2*k+1-th one and so on, until the end of the line. These poor guys will be kicked out of the line and we will execute them immediately (may be head chop, or just shoot them, whatever), and then we start the next round with the remaining guys. The little difference between the Romans and us is, in our version of story, NO ONE SURVIVES. Your goal is to find out the death sequence of the man.

For example, we have N = 7 prisoners, and we decided to kill every k=2 people in the line. At the beginning, the line looks like this:

1 2 3 4 5 6 7

after the first round, 1 3 5 7 will be executed, we have

2 4 6

and then, we will kill 2 6 in the second round. At last 4 will be executed. So, you need to output 1 3 5 7 2 6 4. Easy, right?

But the output maybe too large, we will give you Q queries, each one contains a number m, you need to tell me the m-th number in the death sequence.

Multiple cases. The first line contains a number T, means the number of test case. For every case, there will be three integers N (1<=N<=3000000), K(1<=K), and Q(1<=Q<=1000000), which indicate the number of prisoners, the step length of killing, and the number of query. Next Q lines, each line contains one number m(1<=m<=n).

For each query m, output the m-th number in the death sequence.

BUPT

wange2014   |   We have carefully selected several similar problems for you:  5867 5866 5865 5864 5863 

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int N=3000005;
int head[N];
int a[N];
struct Node
{
    int to;
    int next;
}node[N];

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int n,k,q;
        scanf("%d%d%d",&n,&k,&q);
        memset(head,0,sizeof(head));
        int tot=1;
        for(int i=1;i<=n;i++)
        {
            if((i-1)%k==0) a[i]=1;
            else a[i]=a[i-(i-1)/k-1]+1;
            node[tot].to=i;
            node[tot].next=head[a[i]];
            head[a[i]]=tot++;
        }
        int cnt=n;
        for(int i=tot-1;i>=1;i--)
        {
            for(int j=head[i];j;j=node[j].next)
            {
                a[cnt--]=node[j].to;
            }
        }
        while(q--)
        {
            int x;
            scanf("%d",&x);
            printf("%d\n",a[x]);
        }
    }
    return 0;
}