# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
392960 | giorgikob | Bitaro the Brave (JOI19_ho_t1) | C++14 | 348 ms | 88520 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 ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N = 3e3+5, mod = 1e9+7, sq = 500;
ll answer;
int n,m;
char A[N][N];
int O[N][N],I[N][N];
inline void test_case(){
cin >> n >> m;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
cin >> A[i][j];
O[i][j] = O[i][j-1] + (A[i][j] == 'O');
I[i][j] = I[i-1][j] + (A[i][j] == 'I');
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
if(A[i][j] == 'J'){
answer += (O[i][m]-O[i][j])*(I[n][j] - I[i][j]);
}
}
}
cout << answer << endl;
}
main(){
ios::sync_with_stdio(0);
int T = 1;
//cin >> T;
while(T--){
test_case();
}
}
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... |