結果

問題 No.911 ラッキーソート
ユーザー 👑 hitonanodehitonanode
提出日時 2019-10-20 13:38:41
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 76 ms / 2,000 ms
コード長 4,557 bytes
コンパイル時間 1,886 ms
コンパイル使用メモリ 169,156 KB
実行使用メモリ 4,676 KB
最終ジャッジ日時 2023-09-15 14:36:15
合計ジャッジ時間 5,519 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 1 ms
4,500 KB
testcase_13 AC 65 ms
4,632 KB
testcase_14 AC 67 ms
4,524 KB
testcase_15 AC 67 ms
4,608 KB
testcase_16 AC 69 ms
4,572 KB
testcase_17 AC 68 ms
4,520 KB
testcase_18 AC 70 ms
4,676 KB
testcase_19 AC 69 ms
4,624 KB
testcase_20 AC 71 ms
4,592 KB
testcase_21 AC 75 ms
4,624 KB
testcase_22 AC 76 ms
4,608 KB
testcase_23 AC 71 ms
4,440 KB
testcase_24 AC 65 ms
4,380 KB
testcase_25 AC 44 ms
4,376 KB
testcase_26 AC 31 ms
4,380 KB
testcase_27 AC 18 ms
4,380 KB
testcase_28 AC 9 ms
4,376 KB
testcase_29 AC 3 ms
4,380 KB
testcase_30 AC 2 ms
4,380 KB
testcase_31 AC 1 ms
4,376 KB
testcase_32 AC 1 ms
4,376 KB
testcase_33 AC 2 ms
4,376 KB
testcase_34 AC 2 ms
4,380 KB
testcase_35 AC 1 ms
4,376 KB
testcase_36 AC 2 ms
4,380 KB
testcase_37 AC 1 ms
4,376 KB
testcase_38 AC 68 ms
4,632 KB
testcase_39 AC 73 ms
4,380 KB
testcase_40 AC 3 ms
4,380 KB
testcase_41 AC 71 ms
4,520 KB
testcase_42 AC 37 ms
4,376 KB
testcase_43 AC 67 ms
4,572 KB
testcase_44 AC 66 ms
4,516 KB
testcase_45 AC 68 ms
4,508 KB
testcase_46 AC 55 ms
4,592 KB
testcase_47 AC 65 ms
4,588 KB
testcase_48 AC 54 ms
4,524 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

int N;
vector<lint> A;

constexpr int D = 61;

lint solve(lint R)
{
    if (R < 0) return 0;
    vector<int> ON(D), OFF(D);
    REP(i, N - 1)
    {
        IREP(d, D)
        {
            int a = !!(A[i] & POW2(d));
            int b = !!(A[i + 1] & POW2(d));
            if (a == b) continue;
            if (a < b) OFF[d] = 1;
            if (a > b) ON[d] = 1;
            break;
        }
    }

    lint n0 = 0, n1 = 1;
    IREP(d, D)
    {
        if (ON[d] and OFF[d]) return 0;
        if (ON[d] or OFF[d])
        {
            if (OFF[d] and (R & POW2(d)))
            {
                n0 += n1;
                n1 = 0;
            }
            if (ON[d] and !(R & POW2(d)))
            {
                n1 = 0;
            }
            continue;
        }
        if (R & POW2(d))
        {
            n0 = n0 * 2 + n1;
        }
        else
        {
            n0 *= 2;
        }
    }
    return n0 + n1;
}

int main()
{
    lint L, R;
    cin >> N >> L >> R;
    A.resize(N);
    cin >> A;
    cout << solve(R) - solve(L - 1) << endl;
}
0