题目大意:这题跟杭电的2894基本是一样的
题目分析:具体建图,->请戳这里<-,这题要求输出的是当每次读n个二进制位的时候,所求出的字典序最小的序列的第k个数的值。只要输出具体的某个值,所以我们把答案存起来,n从1-15只算1次就行了,重复的查表即可。
详情请见代码:
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 1<<16;
struct node
{
int to,value,next;
bool vis;
}edge[N];
int head[N];
bool flag[16];
int ans[16][N];
int num,k,len,n;
int stack[N],top;
void init(int l)
{
for(int i = 0;i < l;i ++)
{
head[i] = -1;
}
num = top = 0;
}
void build(int s,int e,int v)
{
edge[num].to = e;
edge[num].value = v;
edge[num].vis = 0;
edge[num].next = head[s];
head[s] = num ++;
}
void dfs(int u)
{
int i;
for(i = head[u];i != -1;i = edge[i].next)
{
if(edge[i].vis == 0)
{
edge[i].vis = 1;
dfs(edge[i].to);
stack[top ++] = edge[i].value;
}
}
}
void solve(int m)
{
int len = 1<<(m - 1);
init(len);
int i;
for(i = 0;i < len;i ++)
{
int id = i<<1|1;
build(i,id%len,id);
id = i<<1;
build(i,id%len,id);
}
dfs(0);
int j = 0;
for(i = top - 1;i >= 0;i --,j ++)
ans[m][j] = stack[i];
}
int main()
{
memset(ans,0,sizeof(ans));
memset(flag,0,sizeof(flag));
while(scanf("%d%d",&n,&k),(n + k))
{
if(flag[n] == false)
{
solve(n);
flag[n] = true;
}
printf("%d\n",ans[n][k]);
}
return 0;
}
//5336K 0MS