제출 #1321624

#제출 시각아이디문제언어결과실행 시간메모리
1321624exoworldgdBitaro the Brave (JOI19_ho_t1)C++20
100 / 100
182 ms150356 KiB
#include<bits/stdc++.h> #define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0) #define int long long using namespace std; const int N=3005; int n,m,a[N][N],b[N][N],s; char c[N][N]; signed main(void){ exoworldgd; cin>>n>>m; for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>c[i][j]; for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)a[i][j]+=c[i][j]=='O',a[i][j]+=a[i][j-1],b[i][j]+=c[i][j]=='I',b[i][j]+=b[i-1][j]; for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(c[i][j]=='J')s+=(a[i][m]-a[i][j])*(b[n][j]-b[i][j]); cout<<s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...