#491355 (C++14) No.911 ラッキーソート

• 問題: No.911 ラッキーソート
• ユーザー: pione
• 提出日時: 2020-06-03 21:45:58
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 50 ms / 2,000 ms
• コード長: 2,650 bytes
• コンパイル時間: 1,789 ms
• コンパイル使用メモリ: 173,344 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-26 00:33:05
• 合計ジャッジ時間: 6,168 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
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
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
// 参考: https://yukicoder.me/submissions/465103
ll n;
vll a;
vvll can;
ll f(ll x){
  vvll dp(63, vll(2));
  dp[62][1]=1;
  for(ll bit=61; bit>=0; bit--){
    ll t=(x>>bit)&1;
    if(t==1){
      dp[bit][1]+=dp[bit+1][1]*can[bit][1];
      dp[bit][0]+=dp[bit+1][1]*can[bit][0];
    }else{
      dp[bit][1]+=dp[bit+1][1]*can[bit][0];
    }
    dp[bit][0]+=dp[bit+1][0]*(can[bit][0]+can[bit][1]);
  }
  
  return dp[0][0]+dp[0][1];
}
signed main()
{
  cin.tie( 0 ); ios::sync_with_stdio( false );
  ll l,r; cin>>n>>l>>r;
  a.resize(n);
  rep(i,n) cin>>a[i];
  
  can = vvll(63, vll(2,1)); // i桁目において、xor0, xor1をそれぞれとれるか
  rep(i,n-1){
    rrep(j,62){
      ll s = a[i]>>j&1;
      ll t = a[i+1]>>j&1;
      if(s==1&&t==0){
        can[j][0]=0; // 今見ている桁において、a_0=1, a_1=0 なら、xor0は取れない
        break;
      }
      if(s==0&&t==1){
        can[j][1]=0; // 今見ている桁において、a_0=0, a_1=1 なら、xor1は取れない
        break;
      }
    }
  }
  
  ll ans=f(r);
  if(l) ans-=f(l-1);
  cout<<ans<<endl;
  
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX