# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160526 | dantoh000 | Bitaro the Brave (JOI19_ho_t1) | C++14 | 552 ms | 9720 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>
#define int long long
using namespace std;
main(){
int n,m;
scanf("%lld%lld",&n,&m);
char grid[n][m];
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++){
scanf(" %c",&grid[i][j]);
}
}
int ans = 0;
int ct[m]; memset(ct,0,sizeof(ct));
for (int i = n-1; i >= 0; i--){
int ct2 = 0;
for (int j = m-1; j >= 0; j--){
if (grid[i][j] == 'O') ct2++;
else if (grid[i][j] == 'I') ct[j]++;
else ans += ct[j]*ct2;
}
}
printf("%lld ",ans);
}
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... |