#797820 (C++17) No.2071 Shift and OR

• 問題: No.2071 Shift and OR
• ユーザー: siganai
• 提出日時: 2022-09-16 21:39:02
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 26 ms / 2,000 ms
• コード長: 4,975 bytes
• コンパイル時間: 2,082 ms
• コンパイル使用メモリ: 205,528 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-12-21 18:40:09
• 合計ジャッジ時間: 3,543 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	3 ms; 5,248 KB
testcase_02	AC	3 ms; 5,248 KB
testcase_03	AC	9 ms; 5,248 KB
testcase_04	AC	5 ms; 5,248 KB
testcase_05	AC	14 ms; 5,248 KB
testcase_06	AC	6 ms; 5,248 KB
testcase_07	AC	3 ms; 5,248 KB
testcase_08	AC	4 ms; 5,248 KB
testcase_09	AC	5 ms; 5,248 KB
testcase_10	AC	6 ms; 5,248 KB
testcase_11	AC	17 ms; 5,248 KB
testcase_12	AC	18 ms; 5,248 KB
testcase_13	AC	14 ms; 5,248 KB
testcase_14	AC	2 ms; 5,248 KB
testcase_15	AC	11 ms; 5,248 KB
testcase_16	AC	10 ms; 5,248 KB
testcase_17	AC	17 ms; 5,248 KB
testcase_18	AC	2 ms; 5,248 KB
testcase_19	AC	22 ms; 5,248 KB
testcase_20	AC	18 ms; 5,248 KB
testcase_21	AC	26 ms; 5,248 KB
testcase_22	AC	23 ms; 5,248 KB
testcase_23	AC	17 ms; 5,248 KB
testcase_24	AC	3 ms; 5,248 KB
testcase_25	AC	9 ms; 5,248 KB
testcase_26	AC	11 ms; 5,248 KB
testcase_27	AC	2 ms; 5,248 KB
testcase_28	AC	18 ms; 5,248 KB
testcase_29	AC	19 ms; 5,248 KB
testcase_30	AC	9 ms; 5,248 KB
testcase_31	AC	5 ms; 5,248 KB
testcase_32	AC	5 ms; 5,248 KB
testcase_33	AC	6 ms; 5,248 KB
testcase_34	AC	6 ms; 5,248 KB
testcase_35	AC	7 ms; 5,248 KB
testcase_36	AC	9 ms; 5,248 KB
testcase_37	AC	6 ms; 5,248 KB
testcase_38	AC	6 ms; 5,248 KB
testcase_39	AC	5 ms; 5,248 KB

ソースコード

//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#ifdef LOCAL
#  include <debug.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif
//#include "atcoder/convolution.hpp"
//#include "atcoder/modint.hpp"
using namespace std;
//using namespace atcoder;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class... Ts> void in(Ts&... t);
#define elif else if
#define vec(type,name,...) vector<type> name(__VA_ARGS__)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(b == 0) return 0; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr int mod = 1000000007;
//constexpr int mod = 998244353;
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

int main() {
    INT(n);
    VEC(int,a,n);
    if(n >= 16) {
        int ans = 0;
        rep(i,16) {
            ans += 1 << i;
        }
        cout << ans << '\n';
    }
    else {
        vi dp(1 << 16);
        dp[0] = 1;
        rep(i,n) {
            vi ndp(1 << 16);
            rep(j,1<<16) {
                if(dp[j] == 1) {
                    rep(k,16) {
                        ndp[j | a[i]] = 1;
                        a[i] = a[i] / 2 + (a[i] % 2) * (1 << 15);
                    }
                }
            }
            swap(dp,ndp);
        }
        rrep(i,1<<16) {
            if(dp[i]) {
                cout << i << '\n';
                return 0;
            }
        }
    }


}