Submission #47929979

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
using ModInt [[maybe_unused]] = atcoder::modint998244353;
using Num [[maybe_unused]] = long long int;
using Vec [[maybe_unused]] = std::vector<Num>;
using Set [[maybe_unused]] = std::set<Num>;
using Mset [[maybe_unused]] = std::multiset<Num>;
using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

template<typename T>
using Q [[maybe_unused]] = std::queue<T>;

template<typename T>
using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

bool grid[2009][2009];

Num to_index(Num y, Num x) {
    return y * 2009 + x;
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    is >> n;

    std::vector<Num> rows(n, 0);
    std::vector<Num> cols(n, 0);
    for(Num y{0}; y<n; ++y) {
        std::string s;
        is >> s;
        for(Num x{0}; x<n; ++x) {
            if (s.at(x) == 'o') {
                rows.at(y) += 1;
                cols.at(x) += 1;
                grid[y][x] = true;
            }
        }
    }

    Num ans {0};
    for(Num y{0}; y<n; ++y) {
        for(Num x{0}; x<n; ++x) {
            const auto r = rows.at(y);
            const auto c = cols.at(x);
            if (grid[y][x]) {
                if ((r >= 2) && (c >= 2)) {
                    ans += (r - 1) * (c - 1);
                }
            }
        }
    }

    os << ans << "\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result