結果

問題 No.2071 Shift and OR
ユーザー tanakanotarou2tanakanotarou2
提出日時 2022-09-16 22:13:54
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 486 ms / 2,000 ms
コード長 7,319 bytes
コンパイル時間 2,505 ms
コンパイル使用メモリ 220,140 KB
実行使用メモリ 8,900 KB
最終ジャッジ日時 2023-08-23 15:50:57
合計ジャッジ時間 9,210 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 14 ms
5,460 KB
testcase_03 AC 150 ms
7,364 KB
testcase_04 AC 59 ms
7,500 KB
testcase_05 AC 325 ms
7,132 KB
testcase_06 AC 87 ms
7,864 KB
testcase_07 AC 25 ms
6,524 KB
testcase_08 AC 46 ms
6,628 KB
testcase_09 AC 69 ms
7,392 KB
testcase_10 AC 83 ms
7,724 KB
testcase_11 AC 352 ms
7,496 KB
testcase_12 AC 346 ms
8,900 KB
testcase_13 AC 295 ms
7,412 KB
testcase_14 AC 1 ms
4,380 KB
testcase_15 AC 208 ms
7,340 KB
testcase_16 AC 196 ms
7,344 KB
testcase_17 AC 368 ms
7,436 KB
testcase_18 AC 3 ms
4,380 KB
testcase_19 AC 486 ms
7,432 KB
testcase_20 AC 392 ms
6,772 KB
testcase_21 AC 2 ms
4,384 KB
testcase_22 AC 479 ms
7,120 KB
testcase_23 AC 18 ms
4,724 KB
testcase_24 AC 3 ms
4,380 KB
testcase_25 AC 9 ms
4,376 KB
testcase_26 AC 11 ms
4,376 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 19 ms
4,720 KB
testcase_29 AC 19 ms
4,700 KB
testcase_30 AC 181 ms
8,796 KB
testcase_31 AC 56 ms
6,820 KB
testcase_32 AC 68 ms
7,672 KB
testcase_33 AC 80 ms
7,864 KB
testcase_34 AC 99 ms
7,848 KB
testcase_35 AC 120 ms
8,640 KB
testcase_36 AC 156 ms
8,792 KB
testcase_37 AC 101 ms
8,528 KB
testcase_38 AC 81 ms
7,928 KB
testcase_39 AC 65 ms
7,524 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
// @formatter:off

#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
using ll = long long;
using P = pair<ll, ll>;
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 VVVVL = vector<VVVL>;
using VP = vector<P>;
using VVP = vector<vector<P>>;
using VS = vector<string>;
using VC = vector<char>;
using VVC = vector<vector<char>>;
using VD = vector<double>;
using VVD = vector<vector<double>>;
using VVVD = vector<VVD>;
// #define MOD 1000000007
#define MOD 998244353
const int INF = 1000000007;
const long long INFL = (ll)INF * INF;
const int JU_5 = 100000;
const int JU_6 = 1000000;
const ll JU_9 = 1000000000;
const ll JU_18 = JU_9 * JU_9;

template <class T, class C>
bool chmax(T& a, C b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T, class C>
bool chmin(T& a, C b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T, class C>
T min(T a, C b) { return a <= b ? a : T(b); }

template <class T, class C>
T max(T a, C b) { return a >= b ? a : T(b); }

template <typename T>
ostream& operator<<(ostream& os, const deque<T>& vec) {
    for (int i = 0; i < vec.size() - 1; i++) os << vec[i] << " ";
    if (vec.size()) os << vec.back();
    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;
}

struct mint {
    ll x;
    int mod;
    mint(ll x = 0, int mod = MOD) : x((x % mod + mod) % mod), mod(mod) {}
    mint operator-() const { return mint(-x); }
    mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += mod - a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res *= a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t >> 1);
        a *= a;
        if (t & 1) a *= *this;
        return a;
    }

    mint inv() const { return pow(mod - 2); }
    mint& operator/=(const mint a) { return (*this) *= a.inv(); }
    mint operator/(const mint a) const {
        mint res(*this);
        return res /= a;
    }
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
using VMI = vector<mint>;
using VVMI = vector<vector<mint>>;

void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail) != 0) cout << " ";
    print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T>& vec) {
    for (auto& a : vec) {
        cout << a;
        if (&a != &vec.back()) cout << " ";
    }
    cout << endl
         << flush;
}
template <class T>
void print(vector<vector<T>>& df) {
    for (auto& vec : df) {
        print(vec);
    }
}

#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }

/////////////////////////////////////////////////////////
// @formatter:on

struct Comb {
    int n;
    vector<mint> kaijo;
    vector<mint> gyaku;

    ll r(ll x) {
        while (x % MOD == 0) x /= MOD;
        return x;
    }
    // xの mod 進数
    int rcnt(ll x) {
        if (x <= 0) return 0;
        return rcnt(x / MOD) + x / MOD;
    }

    Comb(int mn) : n(mn + 1), kaijo(mn + 1), gyaku(mn + 1) {
        // mod で割り切れるだけ割ったときの nCm を求められるように, 階乗と逆元を求める
        kaijo[0] = 1;
        for (int i = 1; i < n; i++) {
            kaijo[i] = kaijo[i - 1] * r(i);
        }
        gyaku[n - 1] = kaijo[n - 1].pow(MOD - 2);
        for (int i = n - 1; i > 0; i--) {
            gyaku[i - 1] = gyaku[i] * r(i);
        }
    }

    mint nCm(int n, int m) {
        if (n < m || m < 0) return 0;

        int cnt1 = rcnt(n);
        int cnt2 = rcnt(n - m) + rcnt(m);
        if (cnt1 > cnt2) return mint(0);
        assert(n < kaijo.size());
        assert(m < gyaku.size());
        return kaijo[n] * gyaku[n - m] * gyaku[m];
    }
    mint nPm(int n, int m) {
        if (n < 0 || m > n) return 0;
        if (n == m) return kaijo[n];
        int cnt1 = rcnt(n);
        int cnt2 = rcnt(n - m);
        if (cnt1 > cnt2) return mint(0);
        return kaijo[n] * gyaku[n - m];
    }
    // 重複組合せ. n 種類の中から重複を許し m 個とる
    mint nHm(int n, int m) {
        int l = n + m - 1;
        int r = n - 1;
        if (l < 0 || r < 0) return mint(0);
        return nCm(l, r);
    }
};
int bitcnt(long long x) {
    return __builtin_popcount(x);
}

void _main() {
    ll n;
    cin >> n;
    VL a(n);
    rep(i, n) cin >> a[i];
    if (n >= 15) {
        print((1ll << 16) - 1);
        return;
    }

    auto shift = [](ll v) {
        ll res = v >> 1;
        res += (v & 1) << 15;
        return res;
    };
    set<ll> st;
    st.insert(0);
    rep(i, n) {
        set<ll> nxt;
        ll v = a[i];
        rep(j, 15) {
            for (auto p : st) {
                nxt.insert(v | p);
            }
            v=shift(v);
        }
        st=nxt;
    }
    print(*st.rbegin());
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    std::cout << std::setprecision(15);
    //////////////////////////////////////////
    int t = 1;
    // cin >> t;
    while (t--) _main();

    return 0;
}
0