forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathD.cpp
More file actions
74 lines (63 loc) · 2.17 KB
/
D.cpp
File metadata and controls
74 lines (63 loc) · 2.17 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(X) ((int) ((X).size()))
using namespace std;
int n, m;
string s[11];
int correct[11], cur[11];
#define TWO(X) (1<<(X))
#define CONTAIN(S,X) (S & TWO(X))
int encode() {
int res = 0;
FOR(i,1,m) {
res = res * 6 + cur[i];
}
return res;
}
int main() {
ios :: sync_with_stdio(false);
while (cin >> n >> m) {
int left_from = 0, left_to = n / 2 - 1;
int right_from = left_to + 1, right_to = n - 1;
FOR(i,1,m) cin >> s[i] >> correct[i];
map<int,int> cnt;
REP(mask,TWO(left_to - left_from + 1)) {
FOR(i,1,m) {
cur[i] = 0;
REP(j,left_to - left_from + 1) {
if (CONTAIN(mask,j) && s[i][j] == '1') ++cur[i];
if (!CONTAIN(mask,j) && s[i][j] == '0') ++cur[i];
}
}
try {
FOR(i,1,m) if (cur[i] > correct[i]) throw 1;
cnt[encode()]++;
} catch(int e) {
}
}
ll res = 0;
REP(mask,TWO(right_to - right_from + 1)) {
FOR(i,1,m) {
cur[i] = correct[i];
REP(j,right_to - right_from + 1) {
if (CONTAIN(mask,j) && s[i][right_from + j] == '1') --cur[i];
if (!CONTAIN(mask,j) && s[i][right_from + j] == '0') --cur[i];
}
}
try {
FOR(i,1,m) if (cur[i] < 0) throw 1;
res += cnt[encode()];
} catch (int e) {
}
}
cout << res << endl;
}
}