結果

問題 No.911 ラッキーソート
ユーザー ei13337
提出日時 2019-10-18 22:09:23
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,259 ms / 2,000 ms
コード長 2,495 bytes
コンパイル時間 1,651 ms
コンパイル使用メモリ 174,124 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-25 17:03:39
合計ジャッジ時間 23,215 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
using namespace std;
using ll = long long;
int n;
vector<bitset<61>> a;
vector<int> solve(int l, int r, int d) {
vector<int> ret(61, -1);
int idx = -1, c = 0;
for(int i = l + 1; i < r; i++) {
if(a[i][d] != a[i - 1][d]) {
c++;
idx = i;
}
}
if(c > 1) {
return ret;
} else if(c == 1) {
ret[d] = a[l][d];
if(d == 0) return ret;
vector<int> v1 = solve(l, idx, d - 1);
vector<int> v2 = solve(idx, r, d - 1);
if(v1[0] == -1 || v2[0] == -1) {
ret[d] = -1;
return ret;
}
for(int i = 0; i < d; i++) {
if(v1[i] == 2) ret[i] = v2[i];
else if(v2[i] == 2) ret[i] = v1[i];
else {
if(v1[i] != v2[i]) {
ret.assign(61, -1);
return ret;
} else ret[i] = v1[i];
}
}
} else {
ret[d] = 2;
if(d == 0) return ret;
vector<int> v = solve(l, r, d - 1);
if(v[0] == -1) {
ret[d] = -1;
return ret;
}
for(int i = 0; i < d; i++) ret[i] = v[i];
}
return ret;
}
ll calc(vector<int> vec, bitset<61> bs) {
ll c0 = 1, c1 = 0;
for(int i = 60; i >= 0; i--) {
ll nc0 = c0, nc1 = c1;
if(vec[i] == -1) return 0;
else if(vec[i] == 0) {
if(bs[i] == 1) {
nc0 = 0;
nc1 = c0 + c1;
} else {
nc0 = c0;
nc1 = c1;
}
} else if(vec[i] == 1) {
if(bs[i] == 1) {
nc0 = c0;
nc1 = c1;
} else {
nc0 = 0;
nc1 = c1;
}
} else {
if(bs[i] == 1) {
nc0 = c0;
nc1 = c0 + 2 * c1;
} else {
nc0 = c0;
nc1 = 2 * c1;
}
}
c0 = nc0;
c1 = nc1;
}
return c0 + c1;
}
ll solve(ll v) {
vector<int> vec = solve(0, n, 60);
bitset<61> bs(v);
ll ans = calc(vec, bs);
return ans;
}
int main() {
ll l, r;
cin >> n >> l >> r;
a.resize(n);
rep(i, n) {
ll tmp;
cin >> tmp;
a[i] = bitset<61>(tmp);
}
if(l) cout << solve(r) - solve(l - 1) << endl;
else cout << solve(r) << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0