제출 #701781

#제출 시각아이디문제언어결과실행 시간메모리
701781vjudge1Bitaro the Brave (JOI19_ho_t1)C++17
100 / 100
622 ms84812 KiB
#include<bits/stdc++.h> #define int long long #define MOD 1000000007 #define all(x) x.begin(),x.end() #define ff first #define ss second #define pb push_back using namespace std; int32_t main(){ int n,m; cin>>n>>m; char arr[n][m]; for(int i=0;i<n;i++){ for(int j=0;j<m;j++)cin>>arr[i][j]; } int a[n+5][m+5]; memset(a,0,sizeof(a)); for(int i=0;i<n;i++){ for(int j=m-1;j>=0;j--){ a[i][j]=a[i][j+1]+(arr[i][j]=='O'); } } int ans=0; for(int j=0;j<m;j++){ int x=0; for(int i=n-1;i>=0;i--){ x+=(arr[i][j]=='I'); if(arr[i][j]=='J')ans+=(x*a[i][j]); } } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...