D. Vitya and Strange Lesson Codeforces Round #430 (Div. 2)

http://codeforces.com/contest/842/problem/D

树 二进制(路径，每个节点代表一位)

 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <cstring>
 #include <time.h>
 #include <string>
 #include <set>
 #include <map>
 #include <list>
 #include <stack>
 #include <queue>
 #include <vector>
 #include <bitset>
 #include <ext/rope>
 #include <algorithm>
 #include <iostream>
 using namespace std;
 #define ll long long
 #define minv 1e-6
 #define inf 1e9
 #define pi 3.1415926536
 #define E  2.7182818284
 const ll mod=1e9+;//
 const int maxn=1e5+;

 bool tr[<<]={};//19+2
 int f[];
 int w=;

 int main()
 {
     int n,m,a,b,i,j,k,value;
     scanf("%d%d",&n,&m);
     while (n--)
     {
         scanf("%d",&a);
         b=a;
         for (i=w;i>=;i--)
         {

             f[i]=a & ;
             a>>=;
         }
         j=;
         for (i=;i<=w;i++)
         {
             j<<=;
             if (f[i]==)
                 j++;
         }
         tr[j]=;
     }

     for (i=(<<w)-;i>=;i--)
         tr[i]=tr[i<<]&tr[i<<|];

     b=;
     while (m--)
     {
         scanf("%d",&a);
         b=a^b;

         a=b;
         for (i=w;i>=;i--)
         {
             f[i]=a & ;
             a>>=;
         }
         j=;
         k=<<(w-);
         value=;
         for (i=;i<=w;i++)
         {
             j<<=;
             if (!tr[j+f[i]])
             {
                 j+=f[i];
             }
             else
             {
                 j+=(f[i] ^ );
                 value+=k;
             }
             k>>=;
         }
         printf("%d\n",value);
     }
     return ;
 }