Submission #716186

#TimeUsernameProblemLanguageResultExecution timeMemory
716186YeoBLBitaro the Brave (JOI19_ho_t1)C++14
100 / 100
274 ms158812 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define fi first #define se second #define mp make_pair #define pb emplace_back int32_t main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k, ans = 0; cin >> n >> k; char ch[n][k]; int cnt[n][k], cnt2[n][k]; for (int i = 0; i < n; i++){ for (int j = 0; j < k; j++){ cin >> ch[i][j]; } } for (int i = n - 1; i >= 0; i--){ for (int j = k - 1; j >= 0; j--){ if (i == n - 1) cnt[i][j] = 0; else cnt[i][j] = cnt[i + 1][j]; if (j == k - 1) cnt2[i][j] = 0; else cnt2[i][j] = cnt2[i][j + 1]; if (ch[i][j] == 'I') cnt[i][j]++; if (ch[i][j] == 'O') cnt2[i][j]++; } } for (int i = 0; i < n; i++){ for (int j = 0; j < k; j++){ if (ch[i][j] == 'J') ans += cnt[i][j] * cnt2[i][j]; } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...