結果
問題 | No.911 ラッキーソート |
ユーザー |
![]() |
提出日時 | 2019-08-21 21:35:29 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 271 ms / 2,000 ms |
コード長 | 3,126 bytes |
コンパイル時間 | 2,195 ms |
コンパイル使用メモリ | 207,684 KB |
最終ジャッジ日時 | 2025-01-07 14:35:36 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 46 |
ソースコード
#include <bits/stdc++.h>using namespace std;using int64 = long long;using int64 = long long;const int mod = 1e9 + 7;const int64 infll = (1LL << 62) - 1;const int inf = (1 << 30) - 1;struct IoSetup {IoSetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}} iosetup;template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template< typename T1, typename T2 >inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }template< typename T1, typename T2 >inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }template< typename T = int64 >vector< T > make_v(size_t a) {return vector< T >(a);}template< typename T, typename... Ts >auto make_v(size_t a, Ts... ts) {return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));}template< typename T, typename V >typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {t = v;}template< typename T, typename V >typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {for(auto &e : t) fill_v(e, v);}template< typename F >struct FixPoint : F {FixPoint(F &&f) : F(forward< F >(f)) {}template< typename... Args >decltype(auto) operator()(Args &&... args) const {return F::operator()(*this, forward< Args >(args)...);}};template< typename F >inline decltype(auto) MFP(F &&f) {return FixPoint< F >{forward< F >(f)};}int main() {int N;int64 L, R;cin >> N >> L >> R;vector< int64 > A(N);cin >> A;auto ok = make_v< bool >(61, 2);int64 mask = 0;for(int i = 60; i >= 0; i--) {mask |= 1LL << i;vector< int64 > zero, one;for(int j = 0; j < N; j++) zero.emplace_back(A[j] & mask);for(int j = 0; j < N; j++) one.emplace_back((A[j] ^ (1LL << i)) & mask);ok[i][0] = is_sorted(begin(zero), end(zero));ok[i][1] = is_sorted(begin(one), end(one));if(!ok[i][0]) for(int j = 0; j < N; j++) A[j] ^= 1LL << i;}auto dp = make_v< int64 >(61, 2);fill_v(dp, -1);int64 S;function< int64(int, bool) > rec = [&](int idx, bool high) {if(idx == -1) return 1LL;if(~dp[idx][high]) return dp[idx][high];int64 ret = 0;bool cur = (S >> idx) & 1;for(int i = 0; i <= (high ? cur : 1); i++) {if(ok[idx][i]) ret += rec(idx - 1, high & (cur == i));}return dp[idx][high] = ret;};S = R;auto ret = rec(60, true);S = L - 1;if(S >= 0) {fill_v(dp, -1);ret -= rec(60, true);}cout << ret << endl;}