# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075267 | quangminh412 | Bitaro the Brave (JOI19_ho_t1) | C++14 | 1071 ms | 1884 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;
/*
John Watson
https://codeforces.com/profile/quangminh98
Mua Code nhu mua Florentino !!
*/
#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
const int maxn = 3009;
char a[maxn][maxn];
int H, W;
signed main()
{
if (fopen("test.inp", "r"))
{
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
faster();
cin >> H >> W;
for (int i = 1; i <= H; i++)
for (int j = 1; j <= W; j++)
cin >> a[i][j];
int res = 0;
for (int i = 1; i <= H; i++)
for (int j = 1; j <= W; j++)
for (int k = i + 1; k <= H; k++)
for (int l = j + 1; l <= W; l++)
res += (a[i][j] == 'J' && a[i][l] == 'O' && a[k][j] == 'I');
cout << res << '\n';
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... |