# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334940 | Swan | Bitaro the Brave (JOI19_ho_t1) | C++14 | 318 ms | 88428 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 stop system("pause")
#define INP freopen("hopscotch.in","r",stdin)
#define OUTP freopen("hopscotch.out","w",stdout)
#define int long long
using namespace std;
const int maxn = 3001;
const int maxm = 3001;
char arr[maxn][maxm];
int ingotDown[maxn][maxm];
main(){
ios_base::sync_with_stdio(0);
int n, m; cin >> n >> m;
for(int i = 0; i < n;i++){
for(int j = 0; j < m;j++){
cin >> arr[i][j];
}
}
for(int i = n-1 ;i>= 0;i--){
for(int j = 0;j < m;j++){
if(arr[i][j] == 'I'){
ingotDown[i][j]++;
}
if(i!=n-1){
ingotDown[i][j]+=ingotDown[i + 1][j];
}
}
}
int ans = 0;
for(int i = 0;i < n;i++){
int orbCnt = 0;
for(int j = m-1 ;j>=0;j--){
if(arr[i][j] == 'O')orbCnt++;
if(arr[i][j] == 'J'){
//cout << "QWE " << i << ' ' << j << ' ' << orbCnt << ' ' << ingotDown[i][j] << endl;
ans+= ingotDown[i][j] * orbCnt;
}
}
//cout << ans << endl;
}
cout << ans;
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... |