#include <bits/stdc++.h>
#pragma GCC target("popcnt")
using namespace std;
int const maxn = 50000;
int const maxm = 7;
bitset<maxn> cnt[6][26];
bitset<maxn> tmp, at;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<string> v(n);
for (int i = 0; i < n; i++) {
auto& s = v[i];
cin >> s;
for (int j = 0; j < m; j++) {
if (s[j] == '?')
for (int k = 0; k < 26; k++)
cnt[j][k][i] = true;
else
cnt[j][s[j] - 'a'][i] = true;
}
}
int64_t ans = 0;
at.flip();
for (int j = 0; j < n; j++) {
auto const& s = v[j];
at[j] = false;
tmp = at;
for (int i = 0; i < m; i++) {
char c = s[i];
if (c == '?') continue;
tmp &= cnt[i][c-'a'];
}
ans += tmp.count();
}
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
55 ms |
2048 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
47 ms |
1664 KB |
Output is correct |
2 |
Correct |
44 ms |
1664 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
54 ms |
1920 KB |
Output is correct |
2 |
Correct |
86 ms |
2176 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
65 ms |
1792 KB |
Output is correct |
2 |
Correct |
52 ms |
1792 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
83 ms |
2432 KB |
Output is correct |
2 |
Correct |
59 ms |
1664 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
145 ms |
2560 KB |
Output is correct |
2 |
Correct |
63 ms |
2304 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
98 ms |
2304 KB |
Output is correct |
2 |
Correct |
47 ms |
2176 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
142 ms |
2560 KB |
Output is correct |
2 |
Incorrect |
134 ms |
2688 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
128 ms |
2432 KB |
Output is correct |
2 |
Correct |
49 ms |
2304 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
186 ms |
2944 KB |
Output is correct |
2 |
Correct |
144 ms |
2816 KB |
Output is correct |