传送门:QAQ
题意:n天完成n个任务,有m个限制,求总共有多少种完成任务方案
思路:很明显是容斥的应用,但是很难推出容斥系数,鉴于限制条件只有25(瞎了,比赛的时候一直以为是50,傻傻的推公式),爆搜即可.
附上代码:
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<iostream>
#include<set>
#include<vector>
using namespace std;
const int maxv = 55;
const int mod = 55566677;
int vis[100][100];
int vis1[100];
int vis2[100];
int cnt;
int n, m;
int ax[maxv], bn[maxv];
long long sum = 0;
long long F[maxv], Finv[maxv], inv[maxv];
void init() {
F[0] = 1;
for (int i = 1; i < maxv; i++) {
F[i] = F[i - 1] * i%mod;
}
}
long long comb(int n, int m) {
if (m<0 || m>n) return 0;
return F[n] * 1ll * Finv[n - m] % mod*Finv[m] % mod;
}
void dfs(int i, int ans) {
if (i >= cnt) {
//printf("%lld\n", ans);
if (ans % 2 == 0) {
sum = (sum + F[n-ans] % mod) % mod;
}
else
sum = ((sum - F[n-ans] % mod) % mod + mod) % mod;
return;
}
dfs(i+1, ans);
if (!vis1[ax[i]] && !vis2[bn[i]]) {
vis1[ax[i]] = vis2[bn[i]] = 1;
dfs(i, ans + 1);
vis1[ax[i]] = vis2[bn[i]] = 0;
}
}
int main(void) {
init();
while (scanf("%d%d", &n, &m) != EOF) {
memset(vis, 0, sizeof(vis));
memset(vis1, 0, sizeof(vis1));
memset(vis2, 0, sizeof(vis2));
cnt = 1;
sum = 0;
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
if (!vis[a][b]) {
vis[a][b] = 1;
ax[cnt] = a;
bn[cnt++] = b;
}
}
dfs(1, 0);
printf("%lld\n", sum);
}
return 0;
}