0
Your rating: None

CodeChef submission 600835 (C++ 4.3.2)

CodeChef submission 600835 (C++ 4.3.2) plaintext list. Status: AC, problem SEQUENCE, contest . By kamranmaharov (kamranmaharov), 2011-07-17 15:19:55.
  1. #include <iostream>
  2. #include <cstdio>
  3. #include <algorithm>
  4. #include <cstdlib>
  5. #include <cstring>
  6. #include <string>
  7. #include <vector>
  8. #include <queue>
  9. #include <stack>
  10. #include <set>
  11. #include <map>
  12. #include <cmath>
  13. #pragma comment(linker,"/STACK:16777216")
  14. #define inf 1000000000
  15. #define MP make_pair
  16. using namespace std;
  17. typedef long long L;
  18. typedef unsigned long long UL;
  19. vector<int> A[17];
  20. int t,n,a,b;
  21.  
  22. int main()
  23. {
  24.  
  25.     A[1].push_back(1); A[1].push_back(2);
  26.  
  27.     for(int i=2;i<=15;i++){
  28.         for(int j=0;j<A[i-1].size()-1;j++)
  29.             A[i].push_back(A[i-1][j]);
  30.         A[i].push_back(i);
  31.         for(int j=A[i-1].size()-2;j>=0;j--)
  32.             A[i].push_back(A[i-1][j]);
  33.         A[i].push_back(i);
  34.     }
  35.  
  36.     cin>>t;
  37.     while(t--){
  38.         cin>>n>>a>>b;
  39.         int bit=-1,idx=-1,type=2;
  40.         for(int i=0;i<n&&(bit==-1);i++)
  41.             if((a^b)==(1<<i))bit=i;
  42.  
  43.         if(bit!=-1){
  44.  
  45.             for(int i=1;i<A[n].size()&&(idx==-1);i++){
  46.                 if((A[n][i]-1)!=bit&&(A[n][i-1]-1)!=bit){
  47.                     idx=i; type=1;
  48.                 }
  49.                 else if((n-A[n][i])!=bit&&(n-A[n][i-1])!=bit){
  50.                     idx=i; type=0;
  51.                 }
  52.             }
  53.  
  54.             if(idx==-1&&(A[n][0]-1)!=bit&&((A[n][A[n].size()-1]-1)!=bit)){idx=0;type=1;}
  55.             else if(idx==-1&&(n-A[n][0])!=bit&&(n-A[n][A[n].size()-1])!=bit){idx=0;type=0;}
  56.         }
  57.  
  58.         if(bit!=-1&&idx==-1)cout<<-1<<endl;
  59.         else{
  60.             if(idx==-1)idx=0;
  61.             int i=idx;
  62.             do{
  63.                 cout<<a;
  64.                 if(type)a=a^(1<<(A[n][i]-1));
  65.                 else a=a^(1<<(n-A[n][i]));
  66.                 i++;
  67.                 if(i==A[n].size())i=0;
  68.                 if(i!=idx)cout<<" ";
  69.             }while(i!=idx);
  70.             cout<<endl;
  71.         }
  72.  
  73.     }
  74.  
  75.  
  76.     return 0;
  77. }
  78.

Comments