Submission #383994

#TimeUsernameProblemLanguageResultExecution timeMemory
383994danielcm585Bitaro the Brave (JOI19_ho_t1)C++14
100 / 100
622 ms159064 KiB
#include <bits/stdc++.h> using namespace std; #define fi first #define se second typedef long long ll; typedef pair<int,int> ii; const int N = 3e3; int n, m; char a[N+2][N+2]; ll orb[N+2][N+2], ing[N+2][N+2]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; orb[i][j] = orb[i][j-1] + (a[i][j] == 'O'); ing[j][i] = ing[j][i-1] + (a[i][j] == 'I'); } } ll ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (a[i][j] == 'J') { ans += (orb[i][m]-orb[i][j])*(ing[j][n]-ing[j][i]); } } } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...