Submission #70101482

---

Source Code Expand

  //#include "atcoder/modint"
  #pragma GCC optimize("Ofast")
  #include "atcoder/all"
  #include <bits/stdc++.h>
  #include  <string>
  using namespace std;
  using namespace atcoder;
  #define int long long
    template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
  template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
  //const int MOD =1e9+7;
  //constexpr int MOD =10;
  constexpr int MOD =998244353;
  const long long M1=167772161,M2=469762049,M3=1224736769;
  //const int MOD =31607;
  //using mint = static_modint<MOD>;
  //using mint = double;
  using mint = modint;
  ostream& operator << (ostream& ost, const mint& m){ost << m.val();return ost;}
  istream& operator >> (istream& ost,  mint& m){int a;ost >> a;m=a;return ost;}
  double time_limit = 100.0,start_temp=0.01,end_temp=0.0;
  std::mt19937 rng(std::random_device{}()); 
 int solve(){
  int c,x;
  cin>>c>>x;
 if((c^x)>x){
  cout<<(c^x)<<endl;
  return 0;
 }
 int n=(1ll<<55);
 bool k=false;
 for(int i=0;i<55;i++){
  if(!k){
    if(bool(c&(1ll<<i))!=bool(x&(1ll<<i))){
      cout<<-1<<endl;
      return 0;
    }
    if(bool(c&(1ll<<i)))k=true;
  }else{
    if(bool(c&(1ll<<i))){
      if(x&(1ll<<i)){
        k=true;
      }else{
        if(i!=0)n|=(1ll<<(i-1));
        k=true;
      }
    }else{
      if(x&(1ll<<i)){
        if(i!=0)n|=(1ll<<(i-1));
        k=true;
      }else{
        k=false;
      }
    }
  }
 }
 if((c^(x+n))==n){
  cout<<n<<endl;
 }else{
  cout<<-1<<endl;
 }
  return 0;
 }
  signed main(){
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);
    int t;
    cin>>t;
    for(int i=0;i<t;i++)solve();
 
    

    
  }
    

    


  
 
   

Submission Info

Judge Result