Submission #1242799

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <array>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>

using namespace std;

const char cir = 'o';
const char crs = 'x';
const char dot = '.';

int R, C, K;

vector<string> row;
vector<string> col;

vector< vector<int> > rasc;
vector< vector<int> > rdsc;

vector< vector<int> > casc;
vector< vector<int> > cdsc;

void continuity(vector< vector<int> > &asc, vector< vector<int> > &dsc,
    const char c)
{
    int fst = 'c' == c ? C : R;
    int snd = 'c' == c ? R : C;

    vector<string> cr = 'c' == c ? col : row;

    for (int i = 0; i < fst; i++)
    {
        int tmp = 0;
        for (int j = 0; j < snd; j++)
        {
            if (cir == cr[i][j])
            {
                tmp++;
                asc[i][j] = tmp;
            }
            else tmp = 0;
        }
    }

    for (int i = 0; i < fst; i++)
    {
        int tmp = 0;
        for (int j = snd - 1; 0 <= j; j--)
        {
            if (cir == cr[i][j])
            {
                tmp++;
                dsc[i][j] = tmp;
            }
            else tmp = 0;
        }
    }
}

int main()
{
    if (scanf("%d%d%d", &R, &C, &K) < 3) return 0;

    row.resize(R);
    col.resize(C);

    for (int i = 0; i < R; i++)
    {
        char s[500];
        if (scanf("%s", s) < 1) return 0;
        row[i] = s;
    }

    for (int i = 0; i < C; i++)
    {
        string str(R, dot);
        col[i] = str;
        for (int j = 0; j < R; j++) col[i][j] = row[j][i];
    }

    rasc = vector< vector<int> >(R, vector<int>(C, 0));
    rdsc = vector< vector<int> >(R, vector<int>(C, 0));
    continuity(rasc, rdsc, 'r');

    casc = vector< vector<int> >(C, vector<int>(R, 0));
    cdsc = vector< vector<int> >(C, vector<int>(R, 0));
    continuity(casc, cdsc, 'c');

    int cnt = 0;
    for (int i = K - 1; i <= R - K; i++)
    {
        for (int j = K - 1; j <= C - K; j++)
        {
            bool flg = true;
            // same row
            if (K <= rasc[i][j] && K <= rdsc[i][j])
            {
                for (int k = j - K + 1; k <= j + K - 1; k++)
                {
                    // distance from center
                    int dst = abs(j - k);
                    int tgt = K - dst;
                    if ((casc[k][i] < tgt)
                        || (cdsc[k][i] < tgt))
                    {
                        flg = false;
                        break;
                    }
                }
            }
            else
            {
                flg = false;
                break;
            }

            if (flg) cnt++;
        }
    }

    printf("%d\n", cnt);
    return 0;
}

Submission Info

Judge Result