比赛 |
2024暑假C班集训A |
评测结果 |
AAAAAAAAAA |
题目名称 |
牧场的安排 |
最终得分 |
100 |
用户昵称 |
darkMoon |
运行时间 |
0.032 s |
代码语言 |
C++ |
内存使用 |
3.42 MiB |
提交时间 |
2024-07-10 09:14:19 |
显示代码纯文本
#include<bits/stdc++.h>
#define int long long
using namespace std;
// #define fin cin
// #define fout cout
ifstream fin("cowfood.in");
ofstream fout("cowfood.out");
auto mread = [](){int x;fin >> x;return x;};
const int N = 20, M = 5005, MOD = 1e8;
int n = mread(), m = mread(), a[N][N], f[N][M];
signed main(){
for(int i = 1; i <= n; i ++){
for(int j = 0; j < m; j ++){
a[i][j] = mread();
}
}
int ma = (1 << m);
f[0][0] = 1;
for(int i = 1; i <= n; i ++){
for(int j = 0; j < ma; j ++){
int e = 1;
for(int k = 0; k < m; k ++){
if(((j >> k) & 1) && !a[i][k]){
e = 0;
break;
}
if(k < m - 1){
if(((j >> k) & 1) && ((j >> k + 1) & 1)){
e = 0;
break;
}
}
}
if(e == 0){
continue;
}
int tmp = (ma - 1) ^ j;
for(int k = tmp; k; --k &= tmp){
(f[i][j] += f[i - 1][k]) %= MOD;
}
(f[i][j] += f[i - 1][0]) %= MOD;
// cout << i << " " << (bitset<5>)j << " " << f[i][j] << "\n";
}
}
int ans = 0;
for(int i = 0; i < ma; i ++){
(ans += f[n][i]) %= MOD;
}
fout << ans;
return 0;
}