結果

問題 No.911 ラッキーソート
ユーザー firiexpfiriexp
提出日時 2019-10-18 23:24:35
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,480 bytes
コンパイル時間 735 ms
コンパイル使用メモリ 87,748 KB
最終ジャッジ日時 2024-11-14 21:45:58
合計ジャッジ時間 1,703 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:17:39: error: '::numeric_limits' has not been declared
   17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                       ^~~~~~~~~~~~~~
main.cpp:17:55: error: expected primary-expression before '>' token
   17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                                       ^
main.cpp:17:61: error: no matching function for call to 'max()'
   17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                                        ~~~~~^~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39,
                 from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
main.cpp:17:61: note:   candidate expects 2 arguments, 0 provided
   17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                                        ~~~~~^~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: note: candidate: 'templat

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }


int main() {
    ll n, l, r;
    cin >> n >> l >> r;
    vector<ll> v(n);
    for (auto &&i : v) scanf("%lld", &i);
    vector<ll> c(63, -1);
    for (int i = 0; i+1 < n; ++i) {
        int j = 63-__builtin_clzll(v[i]^v[i+1]);
        ll cc = ((v[i] >> j) & 1);
        if(c[j] == -1) c[j] = cc;
        else if(c[j] != cc){
            puts("0");
            return 0;
        }
    }
    ll ans = 0;
    auto dp = make_v(64, 2, 0LL);
    dp[63][0] = 1;
    for (int i = 62; i >= 0; --i) {
        ll p = (1LL & (r >> i));
        if(c[i] == -1){
            for (int j = 0; j < 2; ++j) {
                ll d = (j ? 1 : p);
                for (int k = 0; k <= d; ++k) {
                    dp[i][j | (k < d)] += dp[i+1][j];
                }
            }
        }else {
            for (int j = 0; j < 2; ++j) {
                ll d = (j ? 1 : p);
                for (int k = c[i]; k <= d && k < c[i]+1; ++k) {
                    dp[i][j | (k < d)] += dp[i+1][j];
                }
            }
        }
    }
    ans += dp[0][0] + dp[0][1];
    if(l != 0){
        dp = make_v(64, 2, 0LL);
        dp[63][0] = 1;
        for (int i = 62; i >= 0; --i) {
            ll p = (1LL & ((l-1) >> i));
            if(c[i] == -1){
                for (int j = 0; j < 2; ++j) {
                    ll d = (j ? 1 : p);
                    for (int k = 0; k <= d; ++k) {
                        dp[i][j | (k < d)] += dp[i+1][j];
                    }
                }
            }else {
                for (int j = 0; j < 2; ++j) {
                    ll d = (j ? 1 : p);
                    for (int k = c[i]; k <= d && k < c[i]+1; ++k) {
                        dp[i][j | (k < d)] += dp[i+1][j];
                    }
                }
            }
        }
        ans -= dp[0][0] + dp[0][1];
    }
    printf("%lld\n", ans);
    return 0;
}
0