| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1355467 | gvancak | Bitaro the Brave (JOI19_ho_t1) | C++20 | 19 ms | 38932 KiB |
#include <bits/stdc++.h>
using namespace std;
int p1[3005][3005];
int main()
{
int n, m;
cin >> n >> m;
char a[n][m];
int p[3005][3005], ans = 0;
for ( int i = 0; i < n; i++ )
{
for ( int j = 0; j < m; j++ )
{
cin >> a[i][j];
}
}
for ( int i = 0; i < n; i++ )
{
p[i][m+1] = 0;
for ( int j = m - 1; j >= 0; j-- )
{
p[i][j] = p[i][j+1];
if ( a[i][j] == 'O' ) p[i][j] += 1;
}
}
for ( int j = 0; j < m; j++ )
{
for ( int i = n - 1; i >= 0; i-- )
{
p1[i][j] = p1[i+1][j];
if ( a[i][j] == 'I' ) p1[i][j] += 1;
}
}
for ( int i = 0; i < n; i++ )
{
for ( int j = 0; j < m; j++ )
{
if ( a[i][j] == 'J' )
{
ans += p[i][j] * p1[i][j];
}
}
}
cout << ans;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
