# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225978 | Ruxandra985 | Bitaro the Brave (JOI19_ho_t1) | C++14 | 12 ms | 4992 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
char s[3010][3010];
int sol[3010][3010];
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , m , i , j , cnt;
fscanf (fin,"%d%d\n",&n,&m);
for (i = 1 ; i <= n ; i++){
fgets (s[i] + 1 , 3010 , fin);
}
for (i = 1 ; i <= n ; i++){
cnt = 0;
for (j = m ; j ; j--){
if (s[i][j] == 'O')
cnt++;
else if (s[i][j] == 'J'){
sol[i][j] = cnt;
}
}
}
for (j = 1 ; j <= m ; j++){
cnt = 0;
for (i = n ; i ; i--){
if (s[i][j] == 'I')
cnt++;
else if (s[i][j] == 'J'){
sol[i][j] *= cnt;
}
}
}
cnt = 0;
for (i = 1 ; i <= n ; i++){
for (j = 1 ; j <= m ; j++)
cnt += sol[i][j];
}
fprintf (fout,"%d",cnt);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |