Submission #3431188

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll MAX_N = ll(1e5 + 5);
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i,n) for (int i = n; i >=0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()


int main() {
    int n, cnt = 0;
    bool a[9]{};
    cin >> n;
    REP(i,n){
        string s;
        cin >> s;
        REP(j,9){
            if(s[j]=='x')cnt++;
            if(s[j]=='o'){
                if(!a[j]){
                    cnt++;
                    a[j] = true;
                }
            }
            else if(a[j])a[j] = false;
        }
    }
    cout << cnt << endl;
    return 0;
}

Submission Info

Judge Result