結果

問題 No.767 配られたジャパリまん
ユーザー parukiparuki
提出日時 2019-01-01 08:31:43
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,341 ms / 2,000 ms
コード長 4,219 bytes
コンパイル時間 2,316 ms
コンパイル使用メモリ 181,656 KB
実行使用メモリ 17,152 KB
最終ジャッジ日時 2024-04-24 03:13:24
合計ジャッジ時間 6,312 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
5,248 KB
testcase_01 AC 55 ms
5,376 KB
testcase_02 AC 53 ms
5,376 KB
testcase_03 AC 53 ms
5,376 KB
testcase_04 AC 54 ms
5,376 KB
testcase_05 AC 133 ms
5,760 KB
testcase_06 AC 54 ms
5,376 KB
testcase_07 AC 53 ms
5,376 KB
testcase_08 AC 54 ms
5,376 KB
testcase_09 AC 56 ms
5,376 KB
testcase_10 AC 93 ms
5,376 KB
testcase_11 AC 57 ms
5,376 KB
testcase_12 AC 57 ms
5,376 KB
testcase_13 AC 95 ms
5,376 KB
testcase_14 AC 55 ms
5,376 KB
testcase_15 AC 54 ms
5,376 KB
testcase_16 AC 56 ms
5,376 KB
testcase_17 AC 54 ms
5,376 KB
testcase_18 AC 54 ms
5,376 KB
testcase_19 AC 59 ms
5,376 KB
testcase_20 AC 1,341 ms
17,152 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

template<int MOD>
class ModInt {
public:
    ModInt() :value(0) {}
    ModInt(long long val) :value((int)(val<0 ? MOD + val % MOD : val % MOD)) { }

    ModInt& operator+=(ModInt that) {
        value = value + that.value;
        if (value >= MOD)value -= MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that) {
        value -= that.value;
        if (value<0)value += MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that) {
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that) {
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const {
        return ModInt(*this) += that;
    }
    ModInt operator-(ModInt that) const {
        return ModInt(*this) -= that;
    }
    ModInt operator*(ModInt that) const {
        return ModInt(*this) *= that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const {
        ModInt n = *this, res = 1;
        while (k) {
            if (k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const { return value; }

private:
    int value;
};
typedef ModInt<100000007> mint;
ostream& operator<<(ostream& os, const mint& x) {
    os << x.toi();
    return os;
}

namespace comb {
    const int N = 200005;
    mint fact[N];
    mint rev[N];

    void init() {
        fact[0] = 1;
        for (int i = 1; i < N; ++i)fact[i] = fact[i - 1] * i;
        for (int i = 0; i < N; ++i)rev[i] = fact[i].inverse();
    }

    mint C(int n, int r) {
        if (n < r)return 0;
        return fact[n] * rev[r] * rev[n - r];
    }
}

template<class Val>
vector<Val> zeta(vector<Val> f) {
    int len = (int)f.size();
    for (int i = 0; (1 << i) < len; ++i) {
        for (int S = i; S < len; ++S)if (S >> i & 1) {
            f[S] += f[S ^ 1 << i];
        }
    }
    return f;
}

template<class Val>
vector<Val> mobius(vector<Val> f) {
    int len = (int)f.size();
    for (int i = 0; (1 << i) < len; ++i) {
        for (int S = i; S < len; ++S)if (S >> i & 1) {
            f[S] -= f[S ^ 1 << i];
        }
    }
    return f;
}

void solve() {
    comb::init();
    
    int H, W, K;
    cin >> H >> W >> K;

    vector<tuple<int, int, int> > abk(K);
    rep(i, K) {
        int a, b;
        cin >> a >> b;
        abk[i] = tie(a, b, i);
    }
    sort(all(abk));

    vector<mint> f(1 << K);
    vector<pii> p;
    rep(S, 1 << K) {
        p.clear();
        p.emplace_back(0, 0);
        int T = (1 << K) - 1;
        rep(i, K) if (S >> i & 1) {
            int a, b, k;
            tie(a, b, k) = abk[i];
            p.emplace_back(a, b);
            T ^= 1 << k;
        }
        p.emplace_back(H, W);

        mint res = 1;
        rep(i, sz(p) - 1) {
            int d = p[i + 1].first - p[i].first;
            int r = p[i + 1].second - p[i].second;
            if (d < 0 || r < 0) {
                T = -1;
                break;
            }
            res *= comb::C(d + r, d);
        }
        if (T >= 0)f[T] = res;
    }

    auto g = mobius(f);
    reverse(all(g));
    auto h = zeta(g);
    reverse(all(h));
    each(ans, h)cout << ans << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}
0