Submission #15043

#TimeUsernameProblemLanguageResultExecution timeMemory
15043hongjun7빨간 직사각형 (kriii3_QQ)C++98
10 / 20
1000 ms45176 KiB
#include <cstdio> int n, m; int nu[3005][3005]; char S[3005][3005]; int main() { scanf("%d%d", &n, &m); for (int i = 1; i <= n; i++) scanf("%s", S[i] + 1); for (int i = 1; i <= n; i++) { for (int j = m; j >= 1; j--) { nu[i][j] = S[i][j] == 'B' ? 0 : nu[i][j+1] + 1; } } long long res = 0; for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { int v = 2147483647; for (int k = j; k >= 1; k--) { if (v > nu[k][i]) v = nu[k][i]; res += v; } } } printf("%lld", res); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...