Submission #580747

#TimeUsernameProblemLanguageResultExecution timeMemory
580747HeyYouNotYouYouBitaro the Brave (JOI19_ho_t1)C++14
0 / 100
1 ms468 KiB
#include <bits/stdc++.h> #define int long long #define endl '\n' using namespace std; const int N = 3001,INF=1e12; char arr[N][N]; int jew[N][N],ob[N][N],col[N][N]; int32_t main() { //freopen("abc.in", "r", stdin); int h , w; cin >> h >> w; for(int i = 0 ; i < h ; i ++){ for(int j = 0 ; j < w; j ++){ cin>>arr[i][j]; if(arr[i][j]=='J') jew[i][j]++; else if(arr[i][j]=='O') ob[i][j]++; else if(arr[i][j]=='I') col[i][j]++; if(j) ob[i][j]+=ob[i][j-1],col[i][j]+=col[i][j-1]; } } int ans=0; for(int i = 0; i < h ; i ++) { for(int j = 0 ; j < w ; j ++) { if(jew[i][j]){ ans+=(ob[i][w-1]-ob[i][j])*(col[h-1][j]-col[i][j]); } } } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...