https://vjudge.net/problem/UVA-679
分析:进制编码。经过模拟几次可以看出,球会让开关形成连续二进制数的表示(根是低位)。
当放入第k个球时,开关状态正好是二进制的k,利用模2的余数判断走向即可。
#include<cstdio>
#include<math.h>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<list>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ll long long
#define abs(x) (x>0?x:-x)
const int INF=0x7ffffff;
const ll MAX=1e18;
int main()
{
int n,m;
int T;
while(scanf("%d",&T),T!=-1){
while(T--){
scanf("%d%d",&n,&m);
int k=1;
while(n--){
if(m%2)k=k<<1;
else k=(k<<1)+1;
m=(m+1)>>1;
}
printf("%d\n",k/2);
}
}
return 0;
}
TLE:
#include<cstdio>
#include<math.h>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<list>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ll long long
#define abs(x) (x>0?x:-x)
const int INF=0x7ffffff;
const ll MAX=1e18;
const int M=20;
int s[1<<20];
int main()
{
int n,m;
int T;
while(scanf("%d",&T),T!=-1){
while(T--){
scanf("%d%d",&n,&m);
MS(s,0);
int k,N=(1<<n)-1;
for(int i=0;i<m;i++){
k=1;
for(;;){
s[k]=!s[k];
if(s[k]==1)k=2*k;
else k=2*k+1;
if(k>N)break;
}
}
printf("%d\n",k/2);
}
}
return 0;
}