結果

問題 No.462 6日知らずのコンピュータ
ユーザー satanicsatanic
提出日時 2016-12-13 00:13:12
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,761 bytes
コンパイル時間 1,393 ms
コンパイル使用メモリ 120,172 KB
実行使用メモリ 11,436 KB
最終ジャッジ日時 2024-11-29 18:23:49
合計ジャッジ時間 4,789 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 21 ms
11,112 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 21 ms
11,276 KB
testcase_05 AC 21 ms
11,184 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 21 ms
11,188 KB
testcase_09 AC 21 ms
11,292 KB
testcase_10 AC 21 ms
11,140 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 21 ms
11,128 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 AC 21 ms
11,164 KB
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 AC 21 ms
11,124 KB
testcase_50 AC 21 ms
11,336 KB
testcase_51 AC 21 ms
11,288 KB
testcase_52 AC 21 ms
11,184 KB
testcase_53 AC 21 ms
11,260 KB
testcase_54 AC 21 ms
11,244 KB
testcase_55 AC 21 ms
11,108 KB
testcase_56 AC 22 ms
11,240 KB
testcase_57 AC 21 ms
11,116 KB
testcase_58 AC 22 ms
11,112 KB
testcase_59 AC 21 ms
11,120 KB
testcase_60 AC 21 ms
11,276 KB
testcase_61 AC 21 ms
11,304 KB
testcase_62 WA -
testcase_63 AC 21 ms
11,268 KB
testcase_64 AC 20 ms
11,212 KB
testcase_65 AC 21 ms
11,144 KB
testcase_66 AC 21 ms
11,132 KB
testcase_67 AC 21 ms
11,136 KB
testcase_68 AC 21 ms
11,340 KB
testcase_69 AC 21 ms
11,136 KB
testcase_70 AC 21 ms
11,316 KB
testcase_71 AC 21 ms
11,136 KB
testcase_72 AC 21 ms
11,284 KB
testcase_73 AC 21 ms
11,308 KB
testcase_74 AC 21 ms
11,148 KB
testcase_75 AC 21 ms
11,252 KB
testcase_76 AC 21 ms
11,320 KB
testcase_77 AC 21 ms
11,132 KB
testcase_78 AC 21 ms
11,220 KB
testcase_79 AC 21 ms
11,192 KB
testcase_80 AC 21 ms
11,228 KB
testcase_81 AC 21 ms
11,280 KB
testcase_82 AC 21 ms
11,320 KB
testcase_83 AC 21 ms
11,104 KB
testcase_84 AC 21 ms
11,108 KB
testcase_85 AC 2 ms
6,820 KB
testcase_86 AC 21 ms
11,340 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

// need
#include <iostream>
#include <algorithm>

// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <tuple>
#include <unordered_map>
#include <unordered_set>
//#include <complex>
//#include <deque>

// stream
//#include <istream>
//#include <sstream>
//#include <ostream>

// etc
#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <cfenv>

#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define PAIRLL std::pair<ll, ll>
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWPAIR(p) {std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n";}
#define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr<<'('<<yyy.first<<", "<<yyy.second<<") ";}std::cerr << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const auto& xxx:v){std::cerr<<'('<<xxx.first<<", "<<xxx.second<<") ";}std::cerr<<"\n";}
#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";}
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }

#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^19
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

//組み合わせ(コンビネーション)
const int FACT_MAX_N = 1000000;
int fact[FACT_MAX_N];
void FactrialInitialize(ll n, ll mod) {
	fact[0] = 1;
	FORLL(i, 1, n) {
		fact[i] = i * fact[i - 1] % mod;
	}
}
ll Factrial(ll n, ll mod) {
	if (fact[0] == 0) FactrialInitialize(FACT_MAX_N, mod);
	if (fact[n] != 0) return fact[n];
	if (n == 0) return fact[n] = 1;
	return fact[n] = Factrial(n - 1, mod) * n % mod;
}

ll powMod(ll n, ll p, ll mod) {
	if (n == 0) return 0;
	if (p <= 0 || n == 1) return 1;
	if (p % 2 == 0) {
		ll t = powMod(n, p / 2, mod);
		return t*t % mod;
	}
	return n*powMod(n, p - 1, mod) % mod;
}

ll Permutation(ll n, ll r, ll mod) {
	if (n < r) return 0;
	if (n == r) return Factrial(n, mod);
	ll ans = 1;
	ans *= Factrial(n, mod); ans %= mod;
	ans *= powMod(Factrial(n - r, mod), mod - 2, mod); ans %= mod;
	return ans;
}

/*fact準備O(n), クエリO(log(mod))*/
ll Combination(ll n, ll r, ll mod) {
	if (r == 0) return 1;
	if (n < r) return 0;
	ll ans = 1;
	ans *= Factrial(n, mod); ans %= mod;
	ans *= powMod(Factrial(n - r, mod), mod - 2, mod); ans %= mod;
	ans *= powMod(Factrial(r, mod), mod - 2, mod); ans %= mod;
	return ans;
}
/*n<=10^9, r<=10^5のときなど, O(r)*/
/*ll Combination(ll n, ll r, ll mod) {
	if (n < r) return 0;
	ll ans = 1;
	if (n < 2 * r) r = n - r;
	for (int i = 1; i <= r; ++i) {
		ans *= n - i + 1; ans %= mod;
		ans *= powMod(Factrial(i, mod), mod - 2, mod); ans %= mod;
	}
	return ans;
}*/

ll CombinationWithRepetition(ll n, ll r, ll mod) {
	return Combination(n + r - 1, r, mod);
}

int popcount(ll n) {
	int cnt = 0;
	while (n) {
		if (n & 1) ++cnt;
		n >>= 1;
	}
	return cnt;
}

signed main() {
	INIT;
	VAR(int, n, k);
	VEC(int, a, k);
	if (k == 0) {
		OUT(Factrial(n, MOD))BR;
		return 0;
	}
	std::sort(ALL(a));
	if (*a.rbegin() != (1LL << n) - 1) {
		a.emplace_back((1LL << n) - 1);
	}
	int p = 0;
	int ans = 0;
	REP(i, a.size()) {
		if ((p | a[i]) != a[i]) {
			OUT(0)BR;
			return 0;
		}
		int s = popcount(a[i]);
		int t = popcount(p);
		if (s - t > 1) ans += Factrial(popcount(a[i]) - popcount(p), MOD);
		p = a[i];
	}
	OUT(ans)BR;
	return 0;
}
0