結果
問題 | No.911 ラッキーソート |
ユーザー |
|
提出日時 | 2019-10-18 23:32:55 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 98 ms / 2,000 ms |
コード長 | 5,259 bytes |
コンパイル時間 | 2,724 ms |
コンパイル使用メモリ | 199,916 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-25 19:56:04 |
合計ジャッジ時間 | 6,731 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 46 |
ソースコード
#include <bits/stdc++.h>#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace std;using namespace __gnu_pbds;template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;using Int = long long;#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)#define ALL(obj) begin(obj), end(obj)#define RALL(obj) rbegin(obj), rend(obj)#define fi first#define se secondusing ii = pair<Int, Int>;vector<ii> dirs = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}, // 4方向{1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // 斜め{0, 0}, // 自身};Int get_msb(long long x) {assert(x != 0);return 63 - __builtin_clzll(x);}Int get_lsb(long long x) {assert(x != 0);return __builtin_ctzll(x);}template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }// debugtemplate <class T> ostream& operator<<(ostream& s, const vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }template <class T> ostream& operator<<(ostream& s, const vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n");return s; }template <class T, class S> ostream& operator<<(ostream& s, const pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }template <class T> ostream& operator<<(ostream& s, const set<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }template <class T> ostream& operator<<(ostream& s, const multiset<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }template <class T, class S> ostream& operator<<(ostream& s, const map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }template <class T, class S> ostream& operator<<(ostream& s, const unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it<< (next(it) == m.end() ? "" : "\n"); } return s; }#ifdef _MY_DEBUG#define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";#else#define dump(...)#define endl "\n"#endifvoid dump_func() { cerr << endl; }template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }struct Fast { Fast() { cin.tie(nullptr); ios::sync_with_stdio(false); } } fast;mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());constexpr Int MOD = 1000000007;// *************** TEMPLATE END ***************void no() {cout << 0 << endl;exit(0);}constexpr Int K = 62;signed main() {Int n, L, R; cin >> n >> L >> R;vector<Int> a(n); REP (i, n) cin >> a[i];vector<Int> bits(K, -1);vector<bool> ok(n);ok[n - 1] = true;for (Int k = K - 1; k >= 0; k--) {Int i = 0;Int prv = -1;while (i < n) {Int state = -1;while (1) {Int bit = a[i] >> k & 1;if (state == -1) {state = bit;} else if (state == 0) {if (bit == 1) {state = 3;ok[i - 1] = true;if (prv != -1 && prv != state) no();prv = state;}} else if (state == 1) {if (bit == 0) {state = 2;ok[i - 1] = true;if (prv != -1 && prv != state) no();prv = state;}} else if (state == 2) {if (bit == 1) no();} else if (state == 3) {if (bit == 0) no();} else assert(0);if (ok[i++]) break;}}if (prv == 2) bits[k] = 1;if (prv == 3) bits[k] = 0;}REP (i, n) {if (!ok[i]) no();}auto dp = make_vec<Int>(K + 1, 2, 2, 0);dp[K][0][0] = 1;for (Int k = K - 1; k >= 0; k--) {Int l = L >> k & 1;Int r = R >> k & 1;REP (x, 2) {REP (y, 2) {REPI (d, x ? 0 : l, (y ? 1 : r) + 1) {if (bits[k] == 0 && d == 1) continue;if (bits[k] == 1 && d == 0) continue;dp[k][x | d > l][y | d < r] += dp[k + 1][x][y];}}}}Int ans = 0;REP (x, 2) {REP (y, 2) {ans += dp[0][x][y];}}cout << ans << endl;}