結果

問題 No.2061 XOR Sort
ユーザー 👑 p-adic
提出日時 2022-08-27 09:25:54
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 2,008 bytes
コンパイル時間 2,012 ms
コンパイル使用メモリ 196,592 KB
最終ジャッジ日時 2025-01-31 06:09:37
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2 WA * 1
other AC * 6 WA * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
#define CIN( LL , A ) LL A; cin >> A 
#define GETLINE( A ) string A; getline( cin , A ) 
#define GETLINE_SEPARATE( A , SEPARATOR ) string A; getline( cin , A , SEPARATOR ) 
#define FOR_LL( VAR , INITIAL , FINAL_PLUS_ONE ) for( ll VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) 
#define FOR_ITR( ARRAY , ITR , END ) for( auto ITR = ARRAY .begin() , END = ARRAY .end() ; ITR != END ; ITR ++ ) 
#define REPEAT( HOW_MANY_TIMES ) FOR_LL( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) 
#define RETURN( ANSWER ) cout << ( ANSWER ) << endl; return 0 
#define DOUBLE( PRECISION , ANSWER ) cout << fixed << setprecision( PRECISION ) << ( ANSWER ) << endl; return 0 
#define MIN( A , B ) A < B ? A : B;
#define MAX( A , B ) A < B ? B : A;
template <typename T> inline T Distance( const T& a , const T& b ){ return a < b ? b - a : a - b; }
constexpr const ll D = 30;
constexpr const ll P = 998244353;
int main(){
  CIN( ll , N );
  ll A[200000];
  FOR_LL( i , 0 , N ){
    cin >> A[i];
  }
  sort( A , A + N );
  ll count = 0;
  ll d_prev;
  ll e_prev;
  ll& A0 = A[0];
  FOR_LL( j , 0 , D ){
    ll A0_shift = A0 >> j;
    d_prev = A0_shift % 2;
    e_prev = A0 - ( A0_shift << j );
    bool searching_first_1 = true;
    FOR_LL( i , 1 , N ){
      ll& Ai = A[i];
      ll Ai_shift = Ai >> j;
      ll d = Ai_shift % 2;
      if( searching_first_1 ){
    if( d == 1 ){
      searching_first_1 = false;
      ll e = Ai - ( Ai_shift << j );
      FOR_LL( k , 0 , i ){
        ll& Ak = A[k];
        ll Ak_shift = Ak >> j;
        ll e_past = Ak - ( Ak_shift << j );
        if( e_past == e ){
          count++;
          i = N;
          k = i;
        }
      }
      d_prev = d;
      e_prev = e;
    }
      } else {
    ll e = Ai - ( Ai_shift << j );
    if( d_prev != d ? e_prev == e : false ){
      count++;
      i = N;
    } else {
      d_prev = d;
      e_prev = e;
    }
      }
    }
  }
  ll answer = 1;
  REPEAT( count ){
    answer = ( answer * 2 ) % P;
  }
  RETURN( answer );
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0