結果

問題 No.389 ロジックパズルの組み合わせ
ユーザー Konton7Konton7
提出日時 2020-06-13 18:16:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 208 ms / 2,000 ms
コード長 5,378 bytes
コンパイル時間 2,372 ms
コンパイル使用メモリ 210,696 KB
実行使用メモリ 21,112 KB
最終ジャッジ日時 2024-06-25 17:15:46
合計ジャッジ時間 23,846 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 180 ms
18,816 KB
testcase_01 AC 182 ms
18,816 KB
testcase_02 AC 181 ms
18,688 KB
testcase_03 AC 180 ms
18,816 KB
testcase_04 AC 179 ms
18,864 KB
testcase_05 AC 180 ms
18,816 KB
testcase_06 AC 181 ms
18,816 KB
testcase_07 AC 181 ms
18,816 KB
testcase_08 AC 181 ms
18,816 KB
testcase_09 AC 182 ms
19,200 KB
testcase_10 AC 182 ms
19,072 KB
testcase_11 AC 184 ms
19,200 KB
testcase_12 AC 182 ms
19,048 KB
testcase_13 AC 191 ms
20,088 KB
testcase_14 AC 183 ms
19,328 KB
testcase_15 AC 182 ms
19,004 KB
testcase_16 AC 181 ms
19,072 KB
testcase_17 AC 183 ms
19,200 KB
testcase_18 AC 201 ms
20,980 KB
testcase_19 AC 182 ms
18,816 KB
testcase_20 AC 180 ms
18,816 KB
testcase_21 AC 181 ms
18,816 KB
testcase_22 AC 180 ms
18,816 KB
testcase_23 AC 182 ms
18,816 KB
testcase_24 AC 181 ms
18,812 KB
testcase_25 AC 181 ms
18,816 KB
testcase_26 AC 182 ms
18,816 KB
testcase_27 AC 181 ms
18,816 KB
testcase_28 AC 180 ms
18,816 KB
testcase_29 AC 181 ms
18,816 KB
testcase_30 AC 181 ms
18,816 KB
testcase_31 AC 182 ms
18,816 KB
testcase_32 AC 180 ms
18,816 KB
testcase_33 AC 181 ms
18,812 KB
testcase_34 AC 180 ms
18,688 KB
testcase_35 AC 182 ms
18,688 KB
testcase_36 AC 180 ms
18,816 KB
testcase_37 AC 180 ms
18,816 KB
testcase_38 AC 180 ms
18,816 KB
testcase_39 AC 181 ms
18,816 KB
testcase_40 AC 182 ms
18,816 KB
testcase_41 AC 180 ms
18,816 KB
testcase_42 AC 181 ms
18,812 KB
testcase_43 AC 181 ms
18,688 KB
testcase_44 AC 180 ms
18,816 KB
testcase_45 AC 180 ms
18,816 KB
testcase_46 AC 181 ms
18,816 KB
testcase_47 AC 181 ms
18,816 KB
testcase_48 AC 180 ms
18,688 KB
testcase_49 AC 201 ms
21,108 KB
testcase_50 AC 182 ms
18,944 KB
testcase_51 AC 181 ms
18,940 KB
testcase_52 AC 183 ms
19,200 KB
testcase_53 AC 181 ms
19,072 KB
testcase_54 AC 184 ms
19,200 KB
testcase_55 AC 180 ms
18,944 KB
testcase_56 AC 182 ms
19,032 KB
testcase_57 AC 189 ms
20,088 KB
testcase_58 AC 198 ms
21,068 KB
testcase_59 AC 193 ms
20,092 KB
testcase_60 AC 187 ms
19,332 KB
testcase_61 AC 208 ms
20,984 KB
testcase_62 AC 187 ms
19,328 KB
testcase_63 AC 199 ms
21,112 KB
testcase_64 AC 184 ms
19,248 KB
testcase_65 AC 183 ms
19,200 KB
testcase_66 AC 187 ms
19,328 KB
testcase_67 AC 185 ms
19,328 KB
testcase_68 AC 185 ms
19,328 KB
testcase_69 AC 182 ms
18,816 KB
testcase_70 AC 180 ms
18,816 KB
testcase_71 AC 181 ms
18,816 KB
testcase_72 AC 181 ms
18,816 KB
testcase_73 AC 181 ms
18,816 KB
testcase_74 AC 181 ms
18,816 KB
testcase_75 AC 180 ms
18,816 KB
testcase_76 AC 180 ms
18,816 KB
testcase_77 AC 181 ms
18,816 KB
testcase_78 AC 181 ms
18,816 KB
testcase_79 AC 181 ms
18,816 KB
testcase_80 AC 180 ms
18,808 KB
testcase_81 AC 180 ms
18,816 KB
testcase_82 AC 181 ms
18,816 KB
testcase_83 AC 181 ms
18,816 KB
testcase_84 AC 180 ms
18,816 KB
testcase_85 AC 181 ms
18,816 KB
testcase_86 AC 181 ms
18,804 KB
testcase_87 AC 180 ms
18,688 KB
testcase_88 AC 181 ms
18,816 KB
testcase_89 AC 188 ms
19,448 KB
testcase_90 AC 191 ms
19,956 KB
testcase_91 AC 201 ms
21,112 KB
testcase_92 AC 184 ms
19,200 KB
testcase_93 AC 194 ms
19,964 KB
testcase_94 AC 181 ms
18,924 KB
testcase_95 AC 195 ms
19,960 KB
testcase_96 AC 192 ms
19,956 KB
testcase_97 AC 190 ms
19,960 KB
testcase_98 AC 185 ms
19,532 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()

const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(const vector<T> &v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;

    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w)
{
    return 0 <= y && y < h && 0 <= x && x < w;
}

template <typename T>
vector<T> cumsum(const vector<T> &v)
{
    T s = 0;
    vector<T> ret;

    rep(i, v.size())
    {
        s += v[i];
        s %= mod;
        ret.emplace_back(s);
    }
    return ret;
}

bool iskadomatsu(int a, int b, int c)
{
    return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}

VS split(string s, char c)
{
    VS ret;
    string part;
    s += c;
    rep(i, s.length())
    {
        if (s[i] == c)
        {
            ret.emplace_back(part);
            part = "";
        }
        else if (s[i] != c)
        {
            part += s[i];
        }
    }
    return ret;
}

string removezero(string &s)
{
    string ret;
    for (auto z : s)
        if (z != '0')
            ret += z;
    return ret;
}

ll sumdigit(ll x)
{
    ll ans{0};
    while (x > 0)
    {
        ans += x % 10;
        x /= 10;
    }
    return ans;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r, ret %= mod;
        r = (r * r) % mod, q /= 2;
    }
    return ret % mod;
}

template <typename T, typename S>
ll pow_no_mod(T p, S q)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r;
        r = (r * r), q /= 2;
    }
    return ret;
}

void make_frac_tables(VL &frac_list, VL &frac_inv_list)
{
    rep(i, frac_list.size() - 1)
    {
        frac_list[i + 1] *= frac_list[i] * (i + 1);
        frac_list[i + 1] %= mod;
        frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
        frac_inv_list[i + 1] %= mod;
    }
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
    if (a < b)
        return 0;
    if (b < 0)
        return 0;
    ll ret = frac_list[a];
    ret *= frac_inv_list[b];
    ret %= mod;
    ret *= frac_inv_list[a - b];
    ret %= mod;
    return ret;
}



int main()
{

    cin.tie(0);
    ios::sync_with_stdio(false);

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int n, x, m;
    ll ans{0}, a, b, c;
    string s;
    cin >> n;
    VI num, nopaint{0};
    VL frac_list(1000000, 1), frac_inv_list(1000000, 1);
    make_frac_tables(frac_list, frac_inv_list);

    while (cin >> x)
    {
        num.emplace_back(x);
    }

    if (num == nopaint)
    {
        cout << 1 << rt;
        return 0;
    }

    m = num.size() - 1;
    // cout << n << wsp << m << rt;
    n -= accumulate(allpt_c(num), 0);
    // cout << n << wsp << m << rt;
    if (n < m)
    {
        cout << "NA" << rt;
        return 0;
    }
    if (n == m)
    {
        cout << 1 << rt;
        return 0;
    }

    // cout << comb(n - 1, m - 1, frac_list, frac_inv_list) << rt;
    // cout << comb(n - 1, m, frac_list, frac_inv_list) << rt;
    // cout << comb(n - 1, m + 1, frac_list, frac_inv_list) << rt;


    a = comb(n - 1, m - 1, frac_list, frac_inv_list);
    b = comb(n - 1, m, frac_list, frac_inv_list);
    c = comb(n - 1, m + 1, frac_list, frac_inv_list);
    ans =  (a + 2 * b + c) % mod;

    if (ans == 0)
        cout << "NA" << rt;
    else
        cout << ans << rt;

    return 0;
}
0