# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105992 | Hideo | Bitaro the Brave (JOI19_ho_t1) | C++14 | 980 ms | 88812 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;
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector < int >
#define vl vector < ll >
#define pi pair < int, int >
#define pii pair < int, pi >
#define vii vector < pi >
const int N = 3007;
const int INF = 1e9 + 7;
char a[N][N];
int orb[N][N], ing[N][N];
int n, m;
ll ans;
main(){
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> a[i][j];
for (int i = 1; i <= n; i++){
for (int j = m; j >= 1; j--){
orb[i][j] = orb[i][j + 1];
if (a[i][j] == 'O')
orb[i][j]++;
}
}
for (int j = 1; j <= m; j++){
for (int i = n; i >= 1; i--){
ing[i][j] = ing[i + 1][j];
if (a[i][j] == 'I')
ing[i][j]++;
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (a[i][j] == 'J')
ans += (ll) orb[i][j] * ing[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... |