Submission #779454

#TimeUsernameProblemLanguageResultExecution timeMemory
779454borisAngelovBitaro the Brave (JOI19_ho_t1)C++17
50 / 100
1049 ms17352 KiB
#include <bits/stdc++.h> using namespace std; const int maxn = 3005; int n, m; char table[maxn][maxn]; void fastIO() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { fastIO(); cin >> n >> m; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { cin >> table[i][j]; } } long long ans = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { if (table[i][j] == 'J') { int cnt1 = 0; for (int l = j + 1; l <= m; ++l) { if (table[i][l] == 'O') { ++cnt1; } } int cnt2 = 0; for (int k = i + 1; k <= n; ++k) { if (table[k][j] == 'I') { ++cnt2; } } ans += (cnt1 * cnt2); } } } cout << ans << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...