#798640 (C++17(gcc12)) No.2071 Shift and OR

• 問題: No.2071 Shift and OR
• ユーザー: 👑 p-adic
• 提出日時: 2022-09-17 11:12:30
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 31 ms / 2,000 ms
• コード長: 2,371 bytes
• コンパイル時間: 1,859 ms
• コンパイル使用メモリ: 194,228 KB
• 最終ジャッジ日時: 2025-02-07 11:14:45
• ジャッジサーバーID （参考情報）: judge5 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 37

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
// #define _GLIBCXX_DEBUG 
#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 UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr ) 
#define FOR( 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( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) 
#define RETURN( ANSWER ) cout << ( ANSWER ) << "\n"; return 0 
#define DOUBLE( PRECISION , ANSWER ) cout << fixed << setprecision( PRECISION ) << ( ANSWER ) << "\n"; return 0 
#define MIN( A , B ) A < B ? A : B;
#define MAX( A , B ) A < B ? B : A;
template <typename T> inline T Absolute( const T& a ){ return a > 0 ? a : - a; }
int main()
{
  UNTIE;
  CIN( ll , N );
  constexpr const ll power = 65536;
  constexpr const ll digit = 16;
  if( N >= digit ){
    RETURN( power - 1 );
  }
  constexpr const ll shift = power / 2;
  ll Ai;
  bool c[power] = {};
  ll answer[2][power];
  answer[0][0] = 0;
  ll size[2] = { 1 , 0 };
  ll signature_last = 0;
  ll signature_new = 1;
  ll value;
  N--;
  REPEAT( N ){
    cin >> Ai;
    ll ( &answer_last )[power] = answer[signature_last];
    ll& size_last = size[signature_last];
    ll ( &answer_new )[power] = answer[signature_new];
    ll& size_new = size[signature_new];
    size_new = 0;
    REPEAT( digit ){
      FOR( j , 0 , size_last ){
    value = answer_last[j] | Ai;
    if( ! c[value] ){
      c[value] = true;
      answer_new[size_new] = value;
      size_new++;
    }
      }
      Ai = shift * ( Ai % 2 ) + Ai / 2;
    }
    if( size_new == 0 ){
      RETURN( power - 1 );
    }
    swap( signature_last , signature_new );
  }
  ll max = -1;
  {
    cin >> Ai;
    ll ( &answer_last )[power] = answer[signature_last];
    ll& size_last = size[signature_last];
    REPEAT( digit ){
      FOR( j , 0 , size_last ){
    value = answer_last[j] | Ai;
    if( ! c[value] ){
      c[value] = true;
      if( max < value ){
        max = value;
      }
    }
      }
      Ai = shift * ( Ai % 2 ) + Ai / 2;
    }
    if( max == -1 ){
      RETURN( power - 1 );
    }
  }
  RETURN( max );
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX