USACO 2018 US Open Contest, Bronze Problem 1. Team Tic Tac Toe

#include <bits/stdc++.h>

using namespace std;
#define pb push_back
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define F first
#define S second
typedef long long ll;
typedef vector< int > vi;
typedef vector< ll > V;
typedef map<int, int > mp;
#define debug cout << -1 << endl;
#define REP(i, a, b) for(int i=a; i<b; i++)
#define pop pop_back
#define sz(a) (int)a.size()
const ll MOD = 1000000007;
const int maxN = 2001;

int dx[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int dy[] = {-1, -1, -1, 0, 0, 1, 1, 1};

void solve()
{
    char arr[3][3];
    for(int i=0; i<3; i++ ){
        for(int j=0; j<3; j++) {
            cin >> arr[i][j];
        }
    }
    int cnt1 = 0, cnt2 = 0;
    map< char, int > m1;
    map< pair< char, char >, int > m2;
    REP(i, 0, 3) {
        set< char > s;
        REP(j, 0, 3) {
            s.insert(arr[i][j]);
        }
        if(sz(s)==1) {
            auto it = s.begin();
            if(m1[*it]==0) cnt1++;
            m1[*it]++;
        }
        else if(sz(s)==2) {
            auto it = s.begin();
            pair< char, char > p;
            p.F = *it;
            it++;
            p.S = *it;
            if(m2[p]==0) cnt2++;
            m2[p]++;
        }
    }
    REP(j, 0, 3) {
        set< char > s;
        REP(i, 0, 3) {
            s.insert(arr[i][j]);
        }
        if(sz(s)==1) {
            auto it = s.begin();
            if(m1[*it]==0) cnt1++;
            m1[*it]++;
        }
        else if(sz(s)==2) {
            auto it = s.begin();
            pair< char, char > p;
            p.F = *it;
            it++;
            p.S = *it;
            if(m2[p]==0) cnt2++;
            m2[p]++;
        }
    }
    set< char > s;
    s.insert(arr[0][0]);
    s.insert(arr[1][1]);
    s.insert(arr[2][2]);
    if(sz(s)==1) {
        auto it = s.begin();
        if(m1[*it]==0) cnt1++;
        m1[*it]++;
    }
    else if(sz(s)==2) {
        auto it = s.begin();
        pair< char, char > p;
        p.F = *it;
        it++;
        p.S = *it;
        if(m2[p]==0) cnt2++;
        m2[p]++;
    }
    s.clear();
    s.insert(arr[0][2]);
    s.insert(arr[1][1]);
    s.insert(arr[2][0]);
    if(sz(s)==1) {
        auto it = s.begin();
        if(m1[*it]==0) cnt1++;
        m1[*it]++;
    }
    else if(sz(s)==2) {
        auto it = s.begin();
        pair< char, char > p;
        p.F = *it;
        it++;
        p.S = *it;
        if(m2[p]==0) cnt2++;
        m2[p]++;
    }
    cout << cnt1 << "\n" << cnt2 << endl;
    return;
}

int main()
{
    FastIO;
    freopen("tttt.in","r",stdin);
    freopen("tttt.out","w",stdout);
    int t;
    t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}