# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1258700 | truongnhattung | Bitaro the Brave (JOI19_ho_t1) | C++20 | 598 ms | 206620 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
char a[3004][3004];
int sil[3004][3004];
int sir[3004][3004];
int sjl[3004][3004];
int sjr[3004][3004];
main()
{
int n,m;
cin>>n>>m;
int kq=0;
vector <pair<int,int>> s;
for (int i=1;i<=n;i++) {
for (int j=1;j<=m;j++) {
cin>>a[i][j];
if(a[i][j]=='J')s.push_back({i,j});
}
}
for (int i=1;i<=n;i++) {
for (int j=m;j>=1;j--) {
sir[i][j]=sir[i][j+1];
if(a[i][j]=='O') {
sir[i][j]++;
}
}
}
for (int i=1;i<=m;i++) {
for (int j=n;j>=1;j--) {
sjr[j][i]=sjr[j+1][i];
if(a[j][i]=='I') {
sjr[j][i]++;
}
}
}
for (auto x:s) {
kq+=sjr[x.first+1][x.second]*sir[x.first][x.second+1];
}
cout<<kq;
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... |