# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824159 | Trisanu_Das | Parametriziran (COCI19_parametriziran) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define N 50000
bitset<N> vis[6][26], a;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n, m; cin >> n >> m;
string s[n];
for(int i = 0; i < n; i++){
cin >> s[i];
for(int j = 0; j < m; j++) {
if(s[i][j] == '?') for(int k = 0; k < 26; k++) vis[j][k][i] = true;
else q[j][s[i][j] - 'a'][i] = true;
}
}
for(int i = 0; i < n; i++) a[i] = true;
long long ans = 0;
for(int i = 0; i < n; i++){
a[i] = false;
bitset<N> curr = a;
for(int j = 0; j < m; j++) if(s[i][j] != '?') cur &= vis[j][s[i][j] - 'a'];
ans += cur.count();
}
cout << ans << '\n';
}