Pagini recente » Cod sursa (job #2602561) | Cod sursa (job #1460284) | Cod sursa (job #2597605) | Cod sursa (job #600262) | Cod sursa (job #2833346)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("matrix.in");
ofstream fout("matrix.out");
const int NMAX = 1005;
int m, n, ans;
char a[NMAX][NMAX];
int dp[NMAX][NMAX], fr[30];
bool viz[NMAX][NMAX];
void citire()
{
char x;
fin >> n >> m;
for (int i = 1; i <= n; i++)
{
fin >> (a[i] + 1);
}
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= m; j++)
{
fin >> x;
fr[x - 'a']++;
}
}
}
void solve()
{
for (int k = 0; k < 26; k++)
{
for (int i = 0; i <= n; i++)
{
dp[i][0] = 0;
dp[0][i] = 0;
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1];
if ((a[i][j] - 'a') == k)
{
dp[i][j]++;
}
}
}
for (int i = m; i <= n; i++)
{
for (int j = m; j <= n; j++)
{
if (dp[i][j] - dp[i][j - m] - dp[i - m][j] + dp[i - m][j - m] != fr[k])
viz[i][j] = true;
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (!(i < m || j < m) && !viz[i][j])
{
ans++;
}
}
}
fout << ans;
}
int main()
{
citire();
solve();
return 0;
}