# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
157928 | GioChkhaidze | Bitaro the Brave (JOI19_ho_t1) | C++14 | 520 ms | 88632 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;
const int N=3005;
int n,m,Orb[N][N],Ingot[N][N];
long long ANS;
char c[N][N];
main () {
ios::sync_with_stdio(false);
cin>>n>>m;
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++)
cin>>c[i][j];
}
for (int i=1; i<=n; i++) {
int cnt=0;
for (int j=m; j>=1; j--) {
Orb[i][j]=cnt;
cnt+=(c[i][j]=='O');
}
}
for (int j=1; j<=m; j++) {
int cnt=0;
for (int i=n; i>=1; i--) {
Ingot[i][j]=cnt;
cnt+=(c[i][j]=='I');
}
}
for (int i=1; i<=n; i++) {
for (int j=1; j<=m; j++)
if (c[i][j]=='J') ANS+=Ingot[i][j]*Orb[i][j];
}
cout<<ANS<<endl;
}
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... |