結果
問題 | No.2171 OR Assignment |
ユーザー | stoq |
提出日時 | 2023-02-21 06:32:40 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 3,233 ms / 3,500 ms |
コード長 | 6,148 bytes |
コンパイル時間 | 2,832 ms |
コンパイル使用メモリ | 228,420 KB |
実行使用メモリ | 58,212 KB |
最終ジャッジ日時 | 2024-07-21 20:42:48 |
合計ジャッジ時間 | 42,076 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
15,204 KB |
testcase_01 | AC | 28 ms
15,092 KB |
testcase_02 | AC | 29 ms
15,144 KB |
testcase_03 | AC | 29 ms
15,100 KB |
testcase_04 | AC | 29 ms
15,096 KB |
testcase_05 | AC | 28 ms
15,160 KB |
testcase_06 | AC | 28 ms
15,100 KB |
testcase_07 | AC | 29 ms
15,144 KB |
testcase_08 | AC | 28 ms
15,136 KB |
testcase_09 | AC | 29 ms
15,180 KB |
testcase_10 | AC | 28 ms
15,256 KB |
testcase_11 | AC | 29 ms
15,124 KB |
testcase_12 | AC | 947 ms
57,680 KB |
testcase_13 | AC | 933 ms
57,656 KB |
testcase_14 | AC | 925 ms
57,824 KB |
testcase_15 | AC | 112 ms
45,668 KB |
testcase_16 | AC | 132 ms
46,044 KB |
testcase_17 | AC | 539 ms
58,212 KB |
testcase_18 | AC | 1,549 ms
57,236 KB |
testcase_19 | AC | 1,113 ms
45,620 KB |
testcase_20 | AC | 2,203 ms
45,596 KB |
testcase_21 | AC | 2,357 ms
45,764 KB |
testcase_22 | AC | 2,861 ms
45,660 KB |
testcase_23 | AC | 2,226 ms
47,232 KB |
testcase_24 | AC | 3,141 ms
46,560 KB |
testcase_25 | AC | 3,181 ms
46,768 KB |
testcase_26 | AC | 3,233 ms
46,560 KB |
testcase_27 | AC | 2,653 ms
46,220 KB |
testcase_28 | AC | 2,705 ms
46,272 KB |
testcase_29 | AC | 2,459 ms
47,272 KB |
testcase_30 | AC | 2,276 ms
47,436 KB |
testcase_31 | AC | 2,371 ms
46,620 KB |
ソースコード
#define MOD_TYPE 2 #include <bits/stdc++.h> using namespace std; // #include <atcoder/all> // #include <atcoder/lazysegtree> #include <atcoder/modint> // #include <atcoder/segtree> using namespace atcoder; #if 0 #include <boost/multiprecision/cpp_dec_float.hpp> #include <boost/multiprecision/cpp_int.hpp> using Int = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; #endif #if 0 #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tag_and_trait.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <ext/rope> using namespace __gnu_pbds; using namespace __gnu_cxx; template <typename T> using extset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; #endif #if 1 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif #pragma region Macros using ll = long long int; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; using pld = pair<ld, ld>; template <typename Q_type> using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>; #if MOD_TYPE == 1 constexpr ll MOD = ll(1e9 + 7); #else #if MOD_TYPE == 2 constexpr ll MOD = 998244353; #else constexpr ll MOD = 1000003; #endif #endif using mint = static_modint<MOD>; constexpr int INF = (int)1e9 + 10; constexpr ll LINF = (ll)4e18; const double PI = acos(-1.0); constexpr ld EPS = 1e-10; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; #define UNIQUE(v) v.erase(unique(all(v)), v.end()) struct io_init { io_init() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); }; } io_init; template <typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template <typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll floor(ll a, ll b) { if (b < 0) a *= -1, b *= -1; if (a >= 0) return a / b; return -((-a + b - 1) / b); } inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); } template <typename A, size_t N, typename T> inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template <typename T> vector<T> compress(vector<T> &v) { vector<T> val = v; sort(all(val)), val.erase(unique(all(val)), val.end()); for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin(); return val; } template <typename T, typename U> constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept { is >> p.first >> p.second; return is; } template <typename T, typename U> constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept { os << p.first << " " << p.second; return os; } ostream &operator<<(ostream &os, mint m) { os << m.val(); return os; } ostream &operator<<(ostream &os, modint m) { os << m.val(); return os; } template <typename T> constexpr istream &operator>>(istream &is, vector<T> &v) noexcept { for (int i = 0; i < v.size(); i++) is >> v[i]; return is; } template <typename T> constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept { for (int i = 0; i < v.size(); i++) os << v[i] << (i + 1 == v.size() ? "" : " "); return os; } template <typename T> constexpr void operator--(vector<T> &v, int) noexcept { for (int i = 0; i < v.size(); i++) v[i]--; } random_device seed_gen; mt19937_64 engine(seed_gen()); inline ll randInt(ll l, ll r) { return engine() % (r - l + 1) + l; } struct BiCoef { vector<mint> fact_, inv_, finv_; BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) { fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1); for (int i = 2; i < n; i++) { fact_[i] = fact_[i - 1] * i; inv_[i] = -inv_[MOD % i] * (MOD / i); finv_[i] = finv_[i - 1] * inv_[i]; } } mint C(ll n, ll k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[k] * finv_[n - k]; } mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; } mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); } mint Ch1(ll n, ll k) const noexcept { if (n < 0 || k < 0) return 0; mint res = 0; for (int i = 0; i < n; i++) res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1); return res; } mint fact(ll n) const noexcept { if (n < 0) return 0; return fact_[n]; } mint inv(ll n) const noexcept { if (n < 0) return 0; return inv_[n]; } mint finv(ll n) const noexcept { if (n < 0) return 0; return finv_[n]; } }; BiCoef bc(1000010); #pragma endregion // ------------------------------- void solve() { int n; cin >> n; vector<int> a(n); cin >> a; reverse(all(a)); vector<int> pos[30]; rep(i, n) { rep(j, 30) { if ((1 << j) & a[i]) pos[j].push_back(i); } } unordered_map<int, mint> dp; dp[0] = 1; bool used[200010] = {}; vector<int> v; vector<vector<int>> lb(n, vector<int>(30)); rep(i, n) { rep(bit, 30) { auto itr = lower_bound(all(pos[bit]), i); if (itr == pos[bit].end()) lb[i][bit] = -1; else lb[i][bit] = *itr; } } repi(i, n) { unordered_map<int, mint> nxt; for (auto [j, val] : dp) { v.clear(); // 拡大しない nxt[max(j, i)] += val; // 拡大する rep(bit, 30) { int k = lb[i][bit]; if (k <= j or k == i) continue; if (used[k]) continue; used[k] = 1; v.push_back(k); nxt[k] += val; } for (auto k : v) used[k] = 0; } swap(dp, nxt); assert(dp.size() <= 32); } for (auto p : dp) cout << dp.begin()->second << "\n"; } int main() { solve(); }