結果

問題 No.911 ラッキーソート
ユーザー Pachicobue
提出日時 2019-10-19 00:51:59
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 231 ms / 2,000 ms
コード長 4,157 bytes
コンパイル時間 2,126 ms
コンパイル使用メモリ 201,416 KB
最終ジャッジ日時 2025-01-07 23:55:17
ジャッジサーバーID
(参考情報)
judge5 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return ((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) <<
    (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod = 1000000007;
template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
template<typename T>
T read()
{
T v;
return std::cin >> v, v;
}
template<typename T>
std::vector<T> read_vec(const std::size_t size)
{
std::vector<T> v(size);
for (auto& e : v) { std::cin >> e; }
return v;
}
template<typename... Types>
auto read_vals() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#define SHOW(...) static_cast<void>(0)
template<typename T>
std::vector<T> make_v(const std::size_t size, T v) { return std::vector<T>(size, v); }
template<class... Args>
auto make_v(const std::size_t size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }
int main()
{
const auto n = read<usize>();
const auto l = read<ull>(), r = read<ull>();
std::vector<std::bitset<61>> a(n), b(n);
for (usize i = 0; i < n; i++) { a[i] = read<ull>(); }
std::vector<int> cand(61, 0);
for (int i = 60; i >= 0; i--) {
for (int j = 0; j < 2; j++) {
for (usize k = 0; k < n; k++) { b[k][i] = a[k][i] ^ j; }
bool ok = true;
for (usize k = 0; k < n - 1; k++) {
if (b[k].to_ullong() > b[k + 1].to_ullong()) { ok = false; }
}
if (ok) { cand[i] += (1 << j); }
}
if (cand[i] == 0) { return std::cout << 0 << std::endl, 0; }
if (btest(cand[i], 0)) {
for (usize k = 0; k < n; k++) { b[k][i] = a[k][i]; }
}
if (btest(cand[i], 1)) {
for (usize k = 0; k < n; k++) { b[k][i] = a[k][i] ^ 1; }
}
}
auto solve = [&](const ull max) -> ull {
auto dp = make_v(62, 2, 0ULL);
dp[61][1] = 1;
for (int i = 60; i >= 0; i--) {
for (int j = 0; j < 2; j++) {
for (int k = 0; k < 2; k++) {
if (j and (k > btest(max, i))) { continue; }
if (not btest(cand[i], k)) { continue; }
const int nj = j and (btest(max, i) == k);
dp[i][nj] += dp[i + 1][j];
}
}
}
return dp[0][0] + dp[0][1];
};
std::cout << solve(r) - (l == 0 ? 0ULL : solve(l - 1)) << std::endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0