# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107154 | abil | Bitaro the Brave (JOI19_ho_t1) | C++14 | 1052 ms | 158868 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 mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define int long long
using namespace std;
const int inf = (int)1e9 + 7 ;
const long long mod = 1e9 + 7;
const int N = (int)3007;
int n, m;
char ch[N][N];
int jo[N][N], joop[N][N];
main(){
cin >> n >> m;
for(int i = 1;i <= n; i++){
int cnt = 0;
for(int j = 1;j <= m; j++){
cin >> ch[i][j];
cnt += (ch[i][j] == 'O');
}
for(int j = 1;j <= m; j++){
if(ch[i][j] == 'J'){
jo[i][j] = cnt;
}
cnt -= (ch[i][j] == 'O');
}
}
for(int j = 1;j <= m; j++){
for(int i = 1;i <= n; i++){
joop[i][j] = joop[i - 1][j] + jo[i][j];
}
}
int ans = 0;
for(int i = 1;i <= n; i++){
for(int j = 1;j <= m; j++){
if(ch[i][j] == 'I'){
ans += joop[i][j];
}
}
}
cout << 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... |