#828900 (C++17) No.2171 OR Assignment

• 問題: No.2171 OR Assignment
• ユーザー: akua
• 提出日時: 2022-12-28 17:28:43
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: RE
• 実行時間: -
• コード長: 6,151 bytes
• コンパイル時間: 5,153 ms
• コンパイル使用メモリ: 225,912 KB
• 実行使用メモリ: 99,456 KB
• 最終ジャッジ日時: 2024-11-23 18:51:14
• 合計ジャッジ時間: 18,786 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	42 ms; 11,008 KB
testcase_01	AC	42 ms; 11,136 KB
testcase_02	AC	41 ms; 11,136 KB
testcase_03	AC	43 ms; 11,136 KB
testcase_04	AC	41 ms; 11,008 KB
testcase_05	AC	40 ms; 11,008 KB
testcase_06	AC	42 ms; 11,008 KB
testcase_07	RE	-
testcase_08	RE	-
testcase_09	AC	43 ms; 11,008 KB
testcase_10	AC	43 ms; 11,008 KB
testcase_11	AC	44 ms; 11,008 KB
testcase_12	AC	307 ms; 80,512 KB
testcase_13	AC	297 ms; 80,512 KB
testcase_14	AC	298 ms; 80,384 KB
testcase_15	AC	142 ms; 77,440 KB
testcase_16	AC	151 ms; 77,568 KB
testcase_17	AC	154 ms; 77,440 KB
testcase_18	AC	399 ms; 91,904 KB
testcase_19	AC	386 ms; 91,904 KB
testcase_20	AC	579 ms; 97,664 KB
testcase_21	AC	593 ms; 98,432 KB
testcase_22	AC	659 ms; 99,456 KB
testcase_23	AC	691 ms; 99,328 KB
testcase_24	AC	834 ms; 99,328 KB
testcase_25	AC	782 ms; 99,328 KB
testcase_26	AC	746 ms; 99,328 KB
testcase_27	AC	653 ms; 99,328 KB
testcase_28	AC	697 ms; 99,328 KB
testcase_29	AC	653 ms; 99,328 KB
testcase_30	AC	728 ms; 99,456 KB
testcase_31	AC	689 ms; 99,328 KB

ソースコード

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
using namespace std;  
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;  
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vpp=vector<vp>;
using vd=vector<double>;
using vvd =vector<vd>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
void putsYes(bool f){cout << (f?"Yes":"No") << endl;}
void putsYES(bool f){cout << (f?"YES":"NO") << endl;}
void putsFirst(bool f){cout << (f?"First":"Second") << endl;}
void debug(int test){cout << "TEST" << " " << test << endl;}
ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
ll gcd(ll x,ll y){
    if(y==0)return x;
    return gcd(y,x%y);
}
 
ll lcm(ll x,ll y){
    return ll(x/gcd(x,y))*y;
}
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
 
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
ll mod =998244353;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%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 { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    //assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(500000); 
  using vm=vector<mint> ;
using vvm=vector<vm> ;
 
 
ll sqrt_(ll x) {
  ll l = 0, r = ll(3e9)+1;
  while (l+1<r) {
    ll c = (l+r)/2;
    if (c*c <= x) l = c; else r = c;
  }
  return l;
}
 
 
int valid(int x,int y,int h,int w){
  if(x>=0 && y>=0 && x<h && y<w)return 1;
  else return 0;
}
 
struct edge{
  int to; ll cost;
  edge(int to,ll cost) : to(to),cost(cost){}
};
//snuke
template<typename T>
struct Matrix {
  int h, w;
  vector<vector<T> > d;
  Matrix() {}
  Matrix(int h, int w, T val=0): h(h), w(w), d(h, vector<T>(w,val)) {}
  Matrix& unit() {
    //assert(h == w);
    rep(i,h) d[i][i] = 1;
    return *this;
  }
  const vector<T>& operator[](int i) const { return d[i];}
  vector<T>& operator[](int i) { return d[i];}
  Matrix operator*(const Matrix& a) const {
    //assert(w == a.h);
    Matrix r(h, a.w);
    rep(i,h)rep(k,w)rep(j,a.w) {
      r[i][j] += d[i][k]*a[k][j];
    }
    return r;
  }
  Matrix pow(ll t) const {
  //  assert(h == w);
    if (!t) return Matrix(h,h).unit();
    if (t == 1) return *this;
    Matrix r = pow(t>>1);
    r = r*r;
    if (t&1) r = r*(*this);
    return r;
  }
};
using ve=vector<edge>;
using vve=vector<ve>;
//g++ main.cpp -std=c++17 -I .
int main(){cin.tie(0);ios::sync_with_stdio(false);
  int n; cin >> n;
  vi a(n+1);repi(i,1,n+1)cin >> a[i];
  vi id(30,-1);
  vvi g(n+1);
  repi(i,1,n+1)g[i].push_back(i);
  for(int i=1; i<=n; i++){
    if(i>=2){
      set<int> st;
      rep(j,30){
        if(a[i]>>j&1)continue;
        if(id[j]!=-1)st.insert(id[j]);
      }
      auto it=st.begin();
      while(it!=st.end())g[i].push_back(*it++);
    }
    rep(j,30)if(a[i]>>j&1)id[j]=i; 
  } 
  vvm dp(n+1,vm(31));
  rep(i,g[n].size())dp[n][i]=1;
  //for(auto u:g[n])cout << u << endl;
  for(int i=n; i>=3; i--)for(int j=0; j<g[i].size(); j++){
     mint now=dp[i][j];
     int pre=g[i][j];
     rep(k,g[i-1].size()){
       int next=g[i-1][k];
       if(next<=pre){
         dp[i-1][k]+=now;
       }
     }
  }
  mint ans=0;
  rep(j,g[2].size())ans+=dp[2][j];
  cout << ans << endl;
}