Submission #666925

#TimeUsernameProblemLanguageResultExecution timeMemory
666925divadBitaro the Brave (JOI19_ho_t1)C++14
100 / 100
608 ms158868 KiB
#include <iostream> #define int long long #define MAX 3002 using namespace std; int n,m,ans; char ch,v[MAX][MAX]; int o[MAX][MAX],ig[MAX][MAX]; signed main() { cin >> n >> m; for(int i = 1; i <= n; i++){ for(int j = 1; j <= m; j++){ cin >> ch; v[i][j] = ch; } } for(int i = n; i >= 1; i--){ for(int j = 1; j <= m; j++){ ig[i][j] = (v[i][j] == 'I')+ig[i+1][j]; } } for(int i = 1; i <= n; i++){ for(int j = m; j >= 1; j--){ o[i][j] = (v[i][j] == 'O')+o[i][j+1]; } } for(int i = 1; i <= n; i++){ for(int j = 1; j <= m; j++){ if(v[i][j] == 'J'){ ans += o[i][j]*ig[i][j]; } } } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...