Submission #739583

#TimeUsernameProblemLanguageResultExecution timeMemory
739583PagodePaivaBitaro the Brave (JOI19_ho_t1)C++14
20 / 100
20 ms7932 KiB
#include<bits/stdc++.h> #define N 3010 using namespace std; int n, m; char c[N][N]; int dir[N][N], bai[N][N]; int main(){ 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 = m;j > 0;j--){ dir[i][j] = dir[i][j+1] + (c[i][j] == 'O' ? 1 : 0); } } for(int j = 1;j <= m;j++){ for(int i = n;i > 0;i--){ bai[i][j] = bai[i+1][j] + (c[i][j] == 'I' ? 1 : 0); } } int res = 0; for(int i = 1;i <= n;i++){ for(int j = 1;j <= m;j++){ if(c[i][j] == 'J'){ res += dir[i][j]*bai[i][j]; } } } cout << res << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...