제출 #1150819

#제출 시각아이디문제언어결과실행 시간메모리
1150819pinbuBitaro the Brave (JOI19_ho_t1)C++20
20 / 100
6 ms7752 KiB
#include <bits/stdc++.h> using namespace std; const int N = 3003; const long long oo = 1e18; int n, m; char c[N][N]; int pO[N][N], pI[N][N]; void solve(void) { cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> c[i][j]; pO[i][j] = pO[i][j - 1] + (c[i][j] == 'O'); pI[i][j] = pI[i - 1][j] + (c[i][j] == 'I'); } } int ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { ans += (c[i][j] == 'J') * (pO[i][m] - pO[i][j]) * (pI[n][j] - pI[i][j]); } } cout << ans; } signed main(void) { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1;// cin >> t; while (t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...