P3654-First Step

对限制条件,范围要仔细写,写错了,还过了样例,这种情况就白吃一发WA,写的时候得注意

// Problem: P3654 First Step (ファーストステップ)
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P3654
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// Date: 2024-03-25 10:46:33
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define endl '\n'
#define int int64_t
#define ld long double
using namespace std;
int dx[] = { -1,0,1,0 };
int dy[] = { 0,1,0,-1 };
const int NC = 2e3 + 10;
char ches[NC][NC];
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
int a[N], b[N], n, m, k, ans;
void cal(int x, int y) {
	bool ok = (y + k - 1 <= m);
	for (int j = y;j <= y + k - 1; ++j) {
		if (ches[x][j] != '.') {
			ok = false;
			break;
		}
	}
	if (ok) ans++;
	ok = (x + k - 1 <= n);
	for (int i = x; i <= x + k - 1; ++i) {
		if (ches[i][y] != '.') {
			ok = false;
			break;
		}
	}
	if (ok) ans++;
	if (k == 1)ans--;
}
void solve() {
	cin >> n >> m >> k;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			cin >> ches[i][j];
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			if(ches[i][j] == '.')
				cal(i, j);
		}
	}
	cout << ans << endl;
}
signed main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}