Submission #15069

#TimeUsernameProblemLanguageResultExecution timeMemory
15069gs14004빨간 직사각형 (kriii3_QQ)C++14
0 / 20
1 ms45176 KiB
#include <cstdio> int a[3005][3005]; char str[3005][3005]; int n, m; long long ret; int main(){ scanf("%d %d",&n,&m); for(int i=1; i<=n; i++){ scanf("%s",str[i] + 1); } for(int i=1; i<=n; i++){ for(int j=1; j<=m; j++){ if(str[i][j] == 'B'){ a[i][j] = 0; } else{ a[i][j] = a[i-1][j] + a[i-1][j] - a[i-1][j-1] + 1; } ret += a[i][j]; } } printf("%lld",ret); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...