# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288852 | BeanZ | Bitaro the Brave (JOI19_ho_t1) | C++14 | 267 ms | 274436 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 endl '\n'
const int N = 2e5 + 5;
char a[3005][3005];
ll col[3005][3005][3], row[3005][3005][3];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("VietCT.INP", "r")){
freopen("VietCT.INP", "r", stdin);
freopen("VietCT.OUT", "w", stdout);
}
ll n, m;
cin >> n >> m;
string s = "JOI";
for (int i = 1; i <= n; i++){
for (int j = 1; j <= m; j++){
cin >> a[i][j];
for (int k = 0; k < 3; k++){
col[i][j][k] = col[i - 1][j][k] + (a[i][j] == s[k]);
row[i][j][k] = row[i][j - 1][k] + (a[i][j] == s[k]);
}
}
}
ll ans = 0;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= m; j++){
if (a[i][j] == 'J'){
ans = ans + (row[i][m][1] - row[i][j][1]) * (col[n][j][2] - col[i][j][2]);
}
}
}
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... |