Submission #1165273

#TimeUsernameProblemLanguageResultExecution timeMemory
1165273GoBananas69Bitaro the Brave (JOI19_ho_t1)C++20
20 / 100
2 ms584 KiB
#include <iostream> #include <vector> #include <algorithm> #include <string> typedef long long ll; using namespace std; int main() { cin.tie() -> sync_with_stdio(0); int n, m; cin >> n >> m; vector<string> s(n); for (auto &i: s) cin >> i; vector<int> O(n + 1); vector<int> I(m + 1); int ans = 0; for (int i = n - 1; i >= 0; --i) { for (int j = m - 1; j >= 0; --j) { if (s[i][j] == 'J') ans += O[i] * I[j]; if (s[i][j] == 'O') O[i]++; if (s[i][j] == 'I') I[j]++; } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...