#739620 (C++17) No.1426 Got a Covered OR

• 問題: No.1426 Got a Covered OR
• ユーザー: 👑 potato167
• 提出日時: 2022-02-16 18:50:55
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 401 ms / 2,000 ms
• コード長: 2,647 bytes
• コンパイル時間: 2,261 ms
• コンパイル使用メモリ: 210,368 KB
• 実行使用メモリ: 31,360 KB
• 最終ジャッジ日時: 2024-06-29 07:18:06
• 合計ジャッジ時間: 3,642 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	26 ms; 18,560 KB
testcase_13	AC	43 ms; 21,376 KB
testcase_14	AC	29 ms; 17,024 KB
testcase_15	AC	23 ms; 17,408 KB
testcase_16	AC	5 ms; 5,376 KB
testcase_17	AC	6 ms; 5,888 KB
testcase_18	AC	33 ms; 22,656 KB
testcase_19	AC	34 ms; 22,912 KB
testcase_20	AC	13 ms; 10,880 KB
testcase_21	AC	18 ms; 14,848 KB
testcase_22	AC	401 ms; 31,360 KB
testcase_23	AC	54 ms; 31,360 KB
testcase_24	AC	11 ms; 5,376 KB
testcase_25	AC	53 ms; 31,360 KB
testcase_26	AC	13 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
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> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}


namespace po167{
struct combination{
	std::vector<long long> fact;
	std::vector<long long> rev;
	std::vector<long long> fact_rev;
	long long MOD;
	combination(int max,long long mod):MOD(mod),fact(max+1),rev(max+1),fact_rev(max+1){
		for(long long i=0;i<=max;i++){
			if(i<2){
				fact[i]=1;
				fact_rev[i]=1;
				rev[i]=1;
				continue;
			}
			fact[i]=(fact[i-1]*i)%mod;
			rev[i]=mod-((mod/i)*rev[mod%i])%mod;
			fact_rev[i]=(fact_rev[i-1]*rev[i])%mod;
		}
	}
	long long Comb(int x,int y){
		if (x<y||y<0||x<0) return 0;
		return (((fact_rev[y]*fact_rev[x-y])%MOD)*fact[x])%MOD;
	}
};
}
using po167::combination;

void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	int tmp=0;
	int J=0;
	vector<int> p(N);
	combination table(40,mod);
	rep(i,N){
		cin>>p[i];
		if(p[i]!=-1){
			if((tmp&p[i])!=tmp){
				J=1;
			}
			tmp=p[i];
		}
	}
	if(J){
		cout<<"0\n";
		return;
	}
	int M=31;
	vector<vector<ll>> dp(N+1,vector<ll>(M));
	vector<int> C(N);
	rep(i,N){
		if(p[i]!=-1){
			int c=0;
			rep(j,M-1) if(p[i]&(1<<j)) c++;
			rep(j,M){
				if(j!=c) dp[i][j]=0;
			}
			C[i]=c;
		}
	}
	for(int i=N-1;i>0;i--){
		if(C[i-1]==0) C[i-1]=C[i];
	}
	dp[0][0]=1;
	rep(i,N){
		//cout<<C[i]<<"\n";
		rep(j,M){
			dp[i][j]%=mod;
			//cout<<dp[i][j]<<" ";
			if(dp[i][j]==0) continue;
			for(int k=j;k<=C[i];k++){
				ll v=dp[i][j]*(ll)((1<<j));
				if(k==j) v-=dp[i][j];
				v%=mod;
				dp[i+1][k]+=(v*table.Comb(C[i]-j,C[i]-k))%mod;
			}
		}
		//cout<<"\n";
		if(p[i]!=-1){
			rep(j,M){
				if(j!=C[i]) dp[i+1][j]=0;
			}
		}
	}
	cout<<(dp[N][C[N-1]]%mod+mod)%mod<<"\n";
}