結果

問題 No.2071 Shift and OR
ユーザー moharan627moharan627
提出日時 2022-09-17 14:51:19
言語 C++23(draft)
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 53 ms / 2,000 ms
コード長 4,386 bytes
コンパイル時間 5,193 ms
コンパイル使用メモリ 309,272 KB
実行使用メモリ 12,280 KB
最終ジャッジ日時 2023-08-23 17:46:28
合計ジャッジ時間 8,125 ms
ジャッジサーバーID
(参考情報)
judge14 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
5,248 KB
testcase_01 AC 3 ms
5,660 KB
testcase_02 AC 4 ms
6,784 KB
testcase_03 AC 11 ms
8,100 KB
testcase_04 AC 7 ms
7,552 KB
testcase_05 AC 20 ms
9,684 KB
testcase_06 AC 8 ms
7,640 KB
testcase_07 AC 5 ms
6,776 KB
testcase_08 AC 6 ms
7,548 KB
testcase_09 AC 7 ms
7,544 KB
testcase_10 AC 8 ms
7,640 KB
testcase_11 AC 22 ms
10,152 KB
testcase_12 AC 20 ms
10,144 KB
testcase_13 AC 19 ms
9,812 KB
testcase_14 AC 3 ms
4,720 KB
testcase_15 AC 15 ms
8,600 KB
testcase_16 AC 14 ms
8,604 KB
testcase_17 AC 22 ms
10,492 KB
testcase_18 AC 4 ms
5,852 KB
testcase_19 AC 27 ms
10,712 KB
testcase_20 AC 26 ms
10,812 KB
testcase_21 AC 35 ms
12,280 KB
testcase_22 AC 30 ms
11,236 KB
testcase_23 AC 50 ms
4,472 KB
testcase_24 AC 6 ms
4,352 KB
testcase_25 AC 24 ms
4,356 KB
testcase_26 AC 28 ms
4,352 KB
testcase_27 AC 2 ms
4,352 KB
testcase_28 AC 53 ms
4,648 KB
testcase_29 AC 53 ms
4,660 KB
testcase_30 AC 11 ms
8,088 KB
testcase_31 AC 8 ms
8,264 KB
testcase_32 AC 8 ms
8,188 KB
testcase_33 AC 8 ms
8,152 KB
testcase_34 AC 9 ms
8,100 KB
testcase_35 AC 9 ms
8,088 KB
testcase_36 AC 11 ms
8,084 KB
testcase_37 AC 9 ms
8,052 KB
testcase_38 AC 9 ms
8,032 KB
testcase_39 AC 8 ms
8,364 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#if !__INCLUDE_LEVEL__

#include __FILE__
int shift(int x){
    return x/2+32768*(x%2);
}
int main()
{
    int N;cin >> N;
    vl A(N);rep(i,N)cin >> A[i];
    if(N>=16)cout<< 65536-1 << endl;
    else{
        vvl DP(N+1,vl(70000,0));
        DP[0][0]=1;
        rep(i,N){
            rep(j,70000){
                if(DP[i][j]){
                    DP[i+1][j]=1;
                    ll a = A[i];
                    rep(k,16){
                        DP[i+1][a|j]=1;
                        a = shift(a);
                    }
                }
            }
        }
        ll Ans = 0;
        rep(i,70000){
            if(DP[N][i])Ans = i;
        }
        cout << Ans << "\n";
    }
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define range(i, m, n) for(int i = m; i < n; i++)
#define fore(i,a) for(auto &i:a)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Sum(v) accumulate(all(v),0LL)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
const ll INF = 1e16;
const ll MOD1 = 1000000007;
const ll MOD2 = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll SN(char s){return ll(s-'0');}
ll SN(string s){return stoll(s);}
int alpN(char s){return int(s-'a');}
int AlpN(char s){return int(s-'A');}
int Nalp(int n){return char(n+97);}
int NAlp(int n){return char(n+65);}
using Graph = vector<vector<ll>>;
using GraphCost = vector<vector<pair<ll,ll>>>;
using mint = modint;
using mint1 = modint1000000007;
using mint2 = modint998244353;
using pll = pair<long long, long long>;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){for(int i=0;i<(int)v.size();i++)o<<(i>0?" ":"")<<v[i];return o;}//vector空白区切り出力
ostream& operator<<(ostream& os, const mint1& N) {return os << N.val();}//mint出力。デフォはmint1
ostream& operator<<(ostream& os, const mint2& N) {return os << N.val();}
template<class T> bool contain(const std::string& s, const T& v) {
    return s.find(v) != std::string::npos;
}
ll max(int x,ll y){return max((ll)x,y);}
ll max(ll x,int y){return max(x,(ll)y);}
ll min(int x,ll y){return min((ll)x,y);}
ll min(ll x,int y){return min(x,(ll)y);}
template <typename T>
struct edge {
    int src, to;
    T cost;
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
    edge& operator=(const int& x) {
        to = x;
        return *this;
    }
    operator int() const { return to; }
};

template <typename T>
using Edges = vector<edge<T> >;
template <typename T>
using WeightedGraph = vector<Edges<T> >;
using UnWeightedGraph = vector<vector<int> >;
template <typename T>
using Matrix = vector<vector<T> >;

//unorderd_mapの拡張…https://qiita.com/hamamu/items/4d081751b69aa3bb3557
template<class T> size_t HashCombine(const size_t seed,const T &v){
    return seed^(std::hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));
}
/* pair用 */
template<class T,class S> struct std::hash<std::pair<T,S>>{
    size_t operator()(const std::pair<T,S> &keyval) const noexcept {
        return HashCombine(std::hash<T>()(keyval.first), keyval.second);
    }
};
/* vector用 */
template<class T> struct std::hash<std::vector<T>>{
    size_t operator()(const std::vector<T> &keyval) const noexcept {
        size_t s=0;
        for (auto&& v: keyval) s=HashCombine(s,v);
        return s;
    }
};
/* tuple用 */
template<int N> struct HashTupleCore{
    template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{
        size_t s=HashTupleCore<N-1>()(keyval);
        return HashCombine(s,std::get<N-1>(keyval));
    }
};
template <> struct HashTupleCore<0>{
    template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }
};
template<class... Args> struct std::hash<std::tuple<Args...>>{
    size_t operator()(const tuple<Args...> &keyval) const noexcept {
        return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);
    }
};
ll ceil(ll a, ll b){
  return (a + b - 1) / b;
}
#endif
0