#532689 (C++17) No.911 ラッキーソート

• 問題: No.911 ラッキーソート
• ユーザー: SHIJOU
• 提出日時: 2020-08-18 14:50:16
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 93 ms / 2,000 ms
• コード長: 2,446 bytes
• コンパイル時間: 2,108 ms
• コンパイル使用メモリ: 191,968 KB
• 最終ジャッジ日時: 2025-01-13 03:07:10
• ジャッジサーバーID （参考情報）: judge3 / judge3

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

ソースコード

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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}
const int N = 2e5+10;
//head
int n;
ll l, r, LR[2];
ll a[N];
int bits[61];
ll ans[2];
ll dp1, dp2;
bool dfs(int i, int l, int r) {
  if(i == -1) return true;
  int u = -1;
  int p = a[l]>>i&1LL;
  for(int j = l; j < r; j++) {
    if((a[j]>>i&1) == p) {
      if(u != -1) {
        //cout << i << ' ' << j << ' ' << l << ' ' << r << endl;
        return false;
      }
    }
    else {
      if(u == -1) u = j;
    }
  }
  if(u == -1) {
    if(bits[i] != 0 and bits[i] != 1) bits[i] = -1;
    if(!dfs(i-1, l, r)) return false;
  }
  else {
    if(bits[i] == 1 and p == 0) return false;
    if(bits[i] == 0 and p == 1) return false;
    bits[i] = p;
    if(!dfs(i-1, l, u)) return false;
    if(!dfs(i-1, u, r)) return false;
  }
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> l >> r;
  LR[0] = l-1;
  LR[1] = r;
  rep(i, n) cin >> a[i];
  fill(bits, bits+61, 100);
  if(!dfs(60, 0, n)) {
    cout << 0 << endl;
    return 0;
  }
  rep(u, 2) {
    if(LR[u] == -1) {
      ans[u] = 0;
      continue;
    }
    dp1 = dp2 = 0;
    bool ok = false;
    for(int i = 60; i >= 0; i--) {
      if(ok and bits[i] == -1) {
        dp1 <<= 1;
      }
      if(LR[u]>>i&1) {
        if(!ok) {
          dp2 = 1;
        }
        ok = true;
        if(bits[i] != 1) dp1 += dp2;
        if(bits[i] == 0) dp2 = 0;
      }
      else {
        if(bits[i] == 1) dp2 = 0;
      }
    }
    ans[u] = dp1+dp2;
  }
  cout << ans[1] - ans[0] << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX