結果

問題 No.767 配られたジャパリまん
ユーザー omochanalomochanal
提出日時 2018-12-20 18:10:37
言語 C++11
(gcc 4.8.5)
結果
AC  
実行時間 502 ms / 2,000 ms
コード長 3,229 Byte
コンパイル時間 1,199 ms
使用メモリ 14,472 KB
最終ジャッジ日時 2020-05-17 16:34:38

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 2 ms
1,596 KB
testcase_01 AC 2 ms
1,596 KB
testcase_02 AC 2 ms
1,600 KB
testcase_03 AC 2 ms
1,600 KB
testcase_04 AC 3 ms
1,740 KB
testcase_05 AC 40 ms
5,856 KB
testcase_06 AC 2 ms
1,596 KB
testcase_07 AC 3 ms
1,596 KB
testcase_08 AC 3 ms
1,632 KB
testcase_09 AC 4 ms
2,644 KB
testcase_10 AC 20 ms
4,016 KB
testcase_11 AC 7 ms
4,040 KB
testcase_12 AC 8 ms
3,228 KB
testcase_13 AC 19 ms
3,672 KB
testcase_14 AC 7 ms
4,252 KB
testcase_15 AC 8 ms
4,732 KB
testcase_16 AC 6 ms
3,648 KB
testcase_17 AC 3 ms
2,580 KB
testcase_18 AC 4 ms
2,816 KB
testcase_19 AC 9 ms
4,516 KB
testcase_20 AC 502 ms
14,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 100000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

ll fac[MAX_N], inv[MAX_N], fiv[MAX_N]; //fiv:inv(fac(i))

ll mod_pow(ll a, ll n) {
	if(n == 0) return 1;
	ll res = mod_pow(a, n / 2);
	if(n % 2 == 0) return res * res % mod;
	else return a * res % mod * res % mod;
}

ll invf(ll a) {
	return mod_pow(a, mod - 2);
}

void C_init(int n) {
	fac[0] = fac[1] = 1; inv[1] = 1;
	fiv[0] = fiv[1] = 1;
	rep(i, 2, n + 1) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod % i] * (mod / i) % mod;
		fiv[i] = fiv[i - 1] * inv[i] % mod;
	}
}

ll C(int a, int b) { //assume a >= b
	if(a < b || a < 0 || b < 0) return 0;
	return fac[a] * fiv[b] % mod * fiv[a - b] % mod;
}

int H, W, K;
ll dp[(1 << 20)];
pi P[20];

void solve() {
	cin >> H >> W >> K;
	C_init(H + W);
	rep(i, 0, K) cin >> P[i].fst >> P[i].sec;
	rep(bit, 0, (1 << K)) {
		vector<pi> vec;
		rep(i, 0, K) {
			if(bit & (1 << i)) {
				vec.pb(P[i]);
			}
		}
		vec.pb(pi(H, W));
		sort(all(vec));
		pi p = pi(0, 0);
		dp[bit] = 1;
		rep(i, 0, sz(vec)) {
			if(p.fst > vec[i].fst || p.sec > vec[i].sec) {
				dp[bit] = 0;
			}
			else {
				int x = vec[i].fst - p.fst, y = vec[i].sec - p.sec;
				MUL(dp[bit], C(x + y, x));
				p = vec[i];
			}
		}
	}
	rep(i, 0, K) {
		rep(j, 0, (1 << K)) {
			if(j & (1 << i)) ADD(dp[j], mod - dp[j ^ (1 << i)]);
		}
	}
	rep(i, 0, (1 << K)) {
		if(__builtin_popcount(i) % 2) cout << mod - dp[i] << "\n";
		else cout << dp[i] << "\n";
	}
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}

0