1624.cpp

#include <bits/stdc++.h>
 
using namespace std;
 
#define print_op(...) ostream& operator<<(ostream& out, const __VA_ARGS__& u)
template<typename A, typename B> print_op(pair<A, B>) { return out << "(" << u.first << ", " << u.second << ")"; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> print_op(T_container) { out << "{"; string sep; for (const T &x : u) out << sep << x, sep = ", "; return out << "}"; }
template<typename T> void dbg_out(string s, T x) {cerr << "\033[1;35m" << s << "\033[0;32m = \033[33m" << x << "\033[0m\n";}
template<typename T, typename... Args> void dbg_out(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << "\033[1;35m" << s.substr(0, i) << "\033[0;32m = \033[33m" << x << "\033[31m | "; dbg_out(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}
#ifdef LOCAL
#define dbg(...) dbg_out(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...)
#endif
 
#define ar array
#define ll long long
#define ld long double
#define sz(x) ((int)x.size())
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++) 
#define all(a) (a).begin(), (a).end()
 
const int MAX_N = 1e5 + 5;
const int MAX_L = 20;
const int MAX_C = 26;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;

// classic problem: using bitmask to mark which cells are good

const int n = 8;
 
void solve(int tc = 0) {
    vector<int> row(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            char c; cin >> c;
            if (c == '*') row[i] |= (1 << j);
        }
    }
    int ans = 0; // upper bound is 8^8 = 2^24
    function<void(int, int, int, int)> backtrack = [&](int r, int c, int d1, int d2) {
        if (r == n) {
            ans++;
            return;
        }
        d1 <<= 1; d2 >>= 1;
        int mask = row[r] | c | d1 | d2;
        for (int i = 0; i < n; i++) {
            if (mask & (1 << i)) continue;
            int nc = c | (1 << i);
            int nd1 = d1 | (1 << i);
            int nd2 = d2 | (1 << i);
            backtrack(r + 1, nc, nd1, nd2);
        }
    };
    backtrack(0, 0, 0, 0);
    cout << ans << "\n";
}
 
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t << ": ";
        solve(t);
    }
}