# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484164 | ToroTN | Bitaro the Brave (JOI19_ho_t1) | C++14 | 183 ms | 274436 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;
long long n,m,c[3005][3005][2],r[3005][3005][2],cnt=0;
char s[3005][3005];
int main()
{
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%s",s[i]+1);
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(s[i][j]=='O')
{
c[i][j][0]=c[i-1][j][0]+1;
r[i][j][0]=r[i][j-1][0]+1;
}else
{
c[i][j][0]=c[i-1][j][0];
r[i][j][0]=r[i][j-1][0];
}
if(s[i][j]=='I')
{
c[i][j][1]=c[i-1][j][1]+1;
r[i][j][1]=r[i][j-1][1]+1;
}else
{
c[i][j][1]=c[i-1][j][1];
r[i][j][1]=r[i][j-1][1];
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(s[i][j]=='J')
{
//cnt+=(c[n][j][0]-c[i][j][0])*(r[i][m][1]-r[i][j][1]);
cnt+=(c[n][j][1]-c[i][j][1])*(r[i][m][0]-r[i][j][0]);
}
}
}
printf("%lld\n",cnt);
}
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... |