結果
問題 | No.911 ラッキーソート |
ユーザー |
👑 ![]() |
提出日時 | 2019-10-18 22:26:03 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 64 ms / 2,000 ms |
コード長 | 3,787 bytes |
コンパイル時間 | 1,625 ms |
コンパイル使用メモリ | 124,316 KB |
最終ジャッジ日時 | 2025-01-07 23:05:40 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 46 |
ソースコード
#include <algorithm>#include <bitset>#include <cassert>#include <cctype>#include <chrono>#define _USE_MATH_DEFINES#include <cmath>#include <cstring>#include <ctime>#include <deque>#include <functional>#include <iostream>#include <iomanip>#include <iterator>#include <map>#include <numeric>#include <queue>#include <set>#include <sstream>#include <stack>#include <string>#include <tuple>#include <utility>#include <vector>using namespace std;#define FOR(i,m,n) for(int i=(m);i<(n);++i)#define REP(i,n) FOR(i,0,n)#define ALL(v) (v).begin(),(v).end()const int INF = 0x3f3f3f3f;const long long LINF = 0x3f3f3f3f3f3f3f3fLL;const double EPS = 1e-8;const int MOD = 1000000007; // 998244353;const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};struct IoSetup {IoSetup() {cin.tie(nullptr);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);cerr << fixed << setprecision(10);}} iosetup;/*-------------------------------------------------*/int main() {int n; long long l, r; cin >> n >> l >> r;vector<long long> a(n); REP(i, n) cin >> a[i];vector<int> digit(61, -1), sec{0, n};for (int bit = 60; bit >= 0; --bit) {// for (int e : sec) cout << e << ' ';// cout << '\n';vector<int> nx;if (!sec.empty()) {for (int i = 0; i < sec.size(); i += 2) {int l = sec[i], r = sec[i + 1];if (a[l] >> bit & 1) {int zero = -1;FOR(j, l + 1, r) {if (!(a[j] >> bit & 1)) {if (zero == -1) zero = j;} else {if (zero != -1) {cout << 0 << '\n';return 0;}}}if (zero == -1) {nx.emplace_back(l);nx.emplace_back(r);} else {if (digit[bit] == 0) {cout << 0 << '\n';return 0;}digit[bit] = 1;if (zero - l > 1) {nx.emplace_back(l);nx.emplace_back(zero);}if (r - zero > 1) {nx.emplace_back(zero);nx.emplace_back(r);}}} else {int zero = -1;FOR(j, l + 1, r) {if (!(a[j] >> bit & 1)) {if (zero != -1) {cout << 0 << '\n';return 0;}} else {if (zero == -1) zero = j;}}if (zero == -1) {nx.emplace_back(l);nx.emplace_back(r);} else {if (digit[bit] == 1) {cout << 0 << '\n';return 0;}digit[bit] = 0;if (zero - l > 1) {nx.emplace_back(l);nx.emplace_back(zero);}if (r - zero > 1) {nx.emplace_back(zero);nx.emplace_back(r);}}}}}swap(sec, nx);}long long dp[62][2][2] = {};dp[61][false][false] = 1;for (int i = 60; i >= 0; --i) REP(j, 2) REP(k, 2) {if (digit[i] == 0 || digit[i] == -1) {if (j == 1 || !(l >> i & 1)) {bool nx_k = k;nx_k |= (r >> i & 1);dp[i][j][nx_k] += dp[i + 1][j][k];}}if (digit[i] == 1 || digit[i] == -1) {if (k == 1 || (r >> i & 1)) {bool nx_j = j;nx_j |= !(l >> i & 1);dp[i][nx_j][k] += dp[i + 1][j][k];}}}long long ans = 0;REP(j, 2) REP(k, 2) ans += dp[0][j][k];cout << ans << '\n';return 0;}