Submission #652831

#TimeUsernameProblemLanguageResultExecution timeMemory
652831ShinBitaro the Brave (JOI19_ho_t1)C++14
100 / 100
230 ms17996 KiB
#include <bits/stdc++.h> #define fi first #define se second #define mp make_pair using namespace std; template <class X, class Y> bool minimize(X &a, Y b) { if (a > b) return a = b, true; return false; } template <class X, class Y> bool maximize(X &a, Y b) { if (a < b) return a = b, true; return false; } const int N = 3e3 + 7; char a[N][N]; int cnt[N]; signed main() { cin.tie(0)->sync_with_stdio(0); int n, m; cin >> n >> m; for (int i = 1; i <= n; i ++) { for (int j = 1; j <= m; j ++) { cin >> a[i][j]; } } long long res = 0; for (int i = n; i > 0; i --) { int cnt_o = 0; for (int j = m; j > 0; j --) { if (a[i][j] == 'J') { res += 1LL * cnt_o * cnt[j]; } if (a[i][j] == 'O') { cnt_o ++; } if (a[i][j] == 'I') { cnt[j] ++; } } } cout << res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...