# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
560069 | Baytoro | Bitaro the Brave (JOI19_ho_t1) | C++17 | 284 ms | 159116 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 Baytoro_Mayrambekov void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
const int INF=1e18;
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
if(n==0)
return 1;
if(n%2==1)
return binpow(a, n-1)*a;
else{
int b=binpow(a, n/2);
return b*b;
}
}
char ar[3005][3005];
int pref[3005][3005],suf[3005][3005];
int a,b,c,n,m,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_Mayrambekov{
cin>>n>>m;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
cin>>ar[i][j];
}
}
for(i=1;i<=n;i++){
for(j=m;j>=1;j--){
pref[i][j]=pref[i][j+1];
if(ar[i][j]=='O')
pref[i][j]++;
}
}
for(i=n;i>=1;i--){
for(j=1;j<=m;j++){
suf[i][j]=suf[i+1][j];
if(ar[i][j]=='I')
suf[i][j]++;
}
}
res=0;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(ar[i][j]=='J'){
res+=pref[i][j]*suf[i][j];
}
}
}
cout<<res<<endl;
}
main(){
ios;
int T=1;
//cin>>T;
while(T--){
solve();
}
}
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... |