結果

問題 No.389 ロジックパズルの組み合わせ
ユーザー t98slidert98slider
提出日時 2021-10-28 03:48:30
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 83 ms / 2,000 ms
コード長 10,683 bytes
コンパイル時間 1,646 ms
コンパイル使用メモリ 173,904 KB
実行使用メモリ 13,524 KB
最終ジャッジ日時 2024-10-07 07:50:42
合計ジャッジ時間 6,834 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
11,028 KB
testcase_01 AC 15 ms
11,228 KB
testcase_02 AC 14 ms
11,144 KB
testcase_03 AC 15 ms
11,164 KB
testcase_04 AC 15 ms
11,164 KB
testcase_05 AC 14 ms
11,200 KB
testcase_06 AC 15 ms
11,196 KB
testcase_07 AC 14 ms
11,124 KB
testcase_08 AC 15 ms
11,340 KB
testcase_09 AC 21 ms
11,564 KB
testcase_10 AC 19 ms
11,424 KB
testcase_11 AC 23 ms
11,508 KB
testcase_12 AC 18 ms
11,348 KB
testcase_13 AC 40 ms
12,376 KB
testcase_14 AC 24 ms
11,640 KB
testcase_15 AC 18 ms
11,384 KB
testcase_16 AC 19 ms
11,376 KB
testcase_17 AC 21 ms
11,504 KB
testcase_18 AC 62 ms
13,520 KB
testcase_19 AC 15 ms
11,028 KB
testcase_20 AC 15 ms
11,240 KB
testcase_21 AC 15 ms
11,032 KB
testcase_22 AC 16 ms
11,304 KB
testcase_23 AC 15 ms
11,164 KB
testcase_24 AC 15 ms
11,180 KB
testcase_25 AC 15 ms
11,100 KB
testcase_26 AC 14 ms
11,128 KB
testcase_27 AC 14 ms
11,124 KB
testcase_28 AC 14 ms
11,028 KB
testcase_29 AC 14 ms
11,116 KB
testcase_30 AC 14 ms
11,120 KB
testcase_31 AC 15 ms
11,124 KB
testcase_32 AC 14 ms
11,152 KB
testcase_33 AC 15 ms
11,144 KB
testcase_34 AC 15 ms
11,112 KB
testcase_35 AC 14 ms
11,036 KB
testcase_36 AC 15 ms
11,088 KB
testcase_37 AC 15 ms
11,148 KB
testcase_38 AC 15 ms
11,204 KB
testcase_39 AC 15 ms
11,184 KB
testcase_40 AC 15 ms
11,104 KB
testcase_41 AC 15 ms
11,144 KB
testcase_42 AC 15 ms
11,152 KB
testcase_43 AC 14 ms
11,260 KB
testcase_44 AC 15 ms
11,264 KB
testcase_45 AC 15 ms
11,236 KB
testcase_46 AC 15 ms
11,156 KB
testcase_47 AC 15 ms
11,176 KB
testcase_48 AC 16 ms
11,024 KB
testcase_49 AC 65 ms
13,264 KB
testcase_50 AC 18 ms
11,320 KB
testcase_51 AC 17 ms
11,316 KB
testcase_52 AC 24 ms
11,644 KB
testcase_53 AC 20 ms
11,380 KB
testcase_54 AC 26 ms
11,600 KB
testcase_55 AC 15 ms
11,192 KB
testcase_56 AC 18 ms
11,220 KB
testcase_57 AC 36 ms
12,372 KB
testcase_58 AC 57 ms
13,524 KB
testcase_59 AC 47 ms
12,368 KB
testcase_60 AC 29 ms
11,820 KB
testcase_61 AC 83 ms
13,264 KB
testcase_62 AC 30 ms
11,728 KB
testcase_63 AC 58 ms
13,392 KB
testcase_64 AC 27 ms
11,616 KB
testcase_65 AC 22 ms
11,568 KB
testcase_66 AC 27 ms
11,728 KB
testcase_67 AC 27 ms
11,760 KB
testcase_68 AC 26 ms
11,728 KB
testcase_69 AC 15 ms
11,212 KB
testcase_70 AC 15 ms
11,116 KB
testcase_71 AC 15 ms
11,212 KB
testcase_72 AC 15 ms
11,096 KB
testcase_73 AC 16 ms
11,196 KB
testcase_74 AC 15 ms
11,200 KB
testcase_75 AC 15 ms
11,140 KB
testcase_76 AC 14 ms
11,124 KB
testcase_77 AC 14 ms
11,124 KB
testcase_78 AC 14 ms
11,100 KB
testcase_79 AC 15 ms
11,148 KB
testcase_80 AC 15 ms
11,036 KB
testcase_81 AC 14 ms
10,972 KB
testcase_82 AC 15 ms
11,148 KB
testcase_83 AC 15 ms
11,180 KB
testcase_84 AC 15 ms
11,116 KB
testcase_85 AC 15 ms
11,316 KB
testcase_86 AC 15 ms
11,140 KB
testcase_87 AC 14 ms
11,208 KB
testcase_88 AC 15 ms
11,104 KB
testcase_89 AC 32 ms
11,820 KB
testcase_90 AC 43 ms
12,368 KB
testcase_91 AC 63 ms
13,396 KB
testcase_92 AC 22 ms
11,592 KB
testcase_93 AC 44 ms
12,496 KB
testcase_94 AC 15 ms
11,164 KB
testcase_95 AC 47 ms
12,244 KB
testcase_96 AC 40 ms
12,368 KB
testcase_97 AC 37 ms
12,372 KB
testcase_98 AC 27 ms
11,904 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

namespace internal {constexpr long long safe_mod(long long x, long long m) {x %= m;if (x < 0) x += m;return x;}struct barrett {unsigned int _m;unsigned long long im;explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}unsigned int umod() const { return _m; }unsigned int mul(unsigned int a, unsigned int b) const {unsigned long long z = a;z *= b;
#ifdef _MSC_VER
        unsigned long long x;_umul128(z, im, &x);
#else 
        unsigned long long x =(unsigned long long)(((unsigned long long)(z)*im));
#endif
        unsigned int v = (unsigned int)(z - x * _m);if (_m <= v) v += _m;return v;}
};
constexpr long long pow_mod_constexpr(long long x, long long n, int m) {if (m == 1) return 0;unsigned int _m = (unsigned int)(m);unsigned long long r = 1;unsigned long long y = safe_mod(x, m);while (n) {if (n & 1) r = (r * y) % _m;y = (y * y) % _m;n >>= 1;}return r;}constexpr bool is_prime_constexpr(int n) {if (n <= 1) return false;if (n == 2 || n == 7 || n == 61) return true;if (n % 2 == 0) return false;long long d = n - 1;while (d % 2 == 0) d /= 2;constexpr long long bases[3] = {2, 7, 61};for (long long a : bases) {long long t = d;long long y = pow_mod_constexpr(a, t, n);while (t != n - 1 && y != 1 && y != n - 1) {y = y * y % n;t <<= 1;}if (y != n - 1 && t % 2 == 0) {return false;}}return true;}template <int n> constexpr bool is_prime = is_prime_constexpr(n);
constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {a = safe_mod(a, b);if (a == 0) return {b, 0};long long s = b, t = a;long long m0 = 0, m1 = 1;while (t) {long long u = s / t;s -= t * u;m0 -= m1 * u;auto tmp = s;s = t;t = tmp;tmp = m0;m0 = m1;m1 = tmp;}if (m0 < 0) m0 += b / s;return {s, m0};}constexpr int primitive_root_constexpr(int m) {if (m == 2) return 1;if (m == 167772161) return 3;if (m == 469762049) return 3;if (m == 754974721) return 11;if (m == 998244353) return 3;int divs[20] = {};divs[0] = 2;int cnt = 1;int x = (m - 1) / 2;while (x % 2 == 0) x /= 2;for (int i = 3; (long long)(i)*i <= x; i += 2) {if (x % i == 0) {divs[cnt++] = i;while (x % i == 0) {x /= i;}}}if (x > 1) {divs[cnt++] = x;}for (int g = 2;; g++) {bool ok = true;for (int i = 0; i < cnt; i++) {if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {ok = false;break;}}if (ok) return g;}}
template <int m> constexpr int primitive_root = primitive_root_constexpr(m);unsigned long long floor_sum_unsigned(unsigned long long n,unsigned long long m,unsigned long long a,unsigned long long b) {unsigned long long ans = 0;while (true) {if (a >= m) {ans += n * (n - 1) / 2 * (a / m);a %= m;}if (b >= m) {ans += n * (b / m);b %= m;}unsigned long long y_max = a * n + b;if (y_max < m) break;n = (unsigned long long)(y_max / m);b = (unsigned long long)(y_max % m);std::swap(m, a);}return ans;}
template <class T> using is_integral = typename std::is_integral<T>;template <class T>using is_signed_int =typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int =typename std::conditional<is_integral<T>::value &&std::is_unsigned<T>::value,std::true_type,std::false_type>::type;template <class T>using to_unsigned = typename std::conditional<is_signed_int<T>::value,std::make_unsigned<T>,std::common_type<T>>::type;template <class T> using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;template <class T> using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;template <class T> using to_unsigned_t = typename to_unsigned<T>::type;struct modint_base {};struct static_modint_base : modint_base {};template <class T> using is_modint = std::is_base_of<modint_base, T>;template <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;}  // namespace internal
template <int m, std::enable_if_t<(1 <= m)>* = nullptr>
struct static_modint : internal::static_modint_base {using mint = static_modint;
  public:
    static constexpr int mod() { return m; }static mint raw(int v) {mint x;x._v = v;return x;}static_modint() : _v(0) {}template <class T, internal::is_signed_int_t<T>* = nullptr>static_modint(T v) {long long x = (long long)(v % (long long)(umod()));if (x < 0) x += umod();_v = (unsigned int)(x);}template <class T, internal::is_unsigned_int_t<T>* = nullptr>static_modint(T v) {_v = (unsigned int)(v % umod());}unsigned int val() const { return _v; }mint& operator++() {_v++;if (_v == umod()) _v = 0;return *this;}mint& operator--() {if (_v == 0) _v = umod();_v--;return *this;}mint operator++(int) {mint result = *this;++*this;return result;}mint operator--(int) {mint result = *this;--*this;return result;}mint& operator+=(const mint& rhs) {_v += rhs._v;if (_v >= umod()) _v -= umod();return *this;}mint& operator-=(const mint& rhs) {_v -= rhs._v;if (_v >= umod()) _v += umod();return *this;}mint& operator*=(const mint& rhs) {unsigned long long z = _v;z *= rhs._v;_v = (unsigned int)(z % umod());return *this;}mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }mint operator-() const { return mint() - *this; }mint pow(long long n) const {assert(0 <= n);mint x = *this, r = 1;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}mint inv() const {if (prime) {assert(_v);return pow(umod() - 2);} else {auto eg = internal::inv_gcd(_v, m);assert(eg.first == 1);return eg.second;}}friend mint operator+(const mint& lhs, const mint& rhs) {return mint(lhs) += rhs;}friend mint operator-(const mint& lhs, const mint& rhs) {return mint(lhs) -= rhs;}friend mint operator*(const mint& lhs, const mint& rhs) {return mint(lhs) *= rhs;}friend mint operator/(const mint& lhs, const mint& rhs) {return mint(lhs) /= rhs;}friend bool operator==(const mint& lhs, const mint& rhs) {return lhs._v == rhs._v;}friend bool operator!=(const mint& lhs, const mint& rhs) {return lhs._v != rhs._v;}friend istream& operator>>(istream& os,mint& rhs) noexcept {long long v;rhs = mint{(os >> v, v)};return os;}friend constexpr ostream& operator << (ostream &os, const mint& rhs) noexcept {return os << rhs._v;}
  private:
    unsigned int _v;static constexpr unsigned int umod() { return m; }static constexpr bool prime = internal::is_prime<m>;
};
using mint = static_modint<1000000007>;
using mint2 = static_modint<998244353>;

//enumeration<mint> enu(200000);のように宣言する
template<class T> struct enumeration{
    int _n;
    vector<T> fact,inv;
    enumeration() : _n(1),fact(1){}
    enumeration(int n) : _n(n+1),fact(n+1),inv(n+1){
        fact[0]=1;
        for(int i=1;i<=n;i++)fact[i]=fact[i-1]*i;
        inv[n]=T(1)/fact[n];
        for(int i=n-1;i>=0;i--)inv[i]=inv[i+1]*(i+1);
    }
    T Per(int n,int k){
        if(k>n)return 0;
        return fact[n]*inv[n-k];
    }
    //n個の中からk個を選ぶ
    T C(int n,int k){
        if(k<0||k>n)return 0;
        return fact[n]*inv[n-k]*inv[k];
    }
    //n個の中から重複を許してk個を選ぶ
    T H(int n,int k){
        if(n==0&&k==0)return 1;
        if(n<=0||k<0)return 0;
        return C(n+k-1,k);
    }
};

int main(){
    enumeration<mint> enu(1000001);
    INT(m);
    int x,sumv=0;
    vector<int> a;
    while(cin>>x){
        a.push_back(x);
        sumv+=x;
    }
    sumv+=a.size()-1;
    if(a.size()==1&&a[0]==0){
        out(1);
        return 0;
    }
    int r=m-sumv,k=a.size()+1;
    mint ans=enu.C(r+k-1,k-1);
    if(ans.val()==0)out("NA");
    else out(ans);
}
0