Submission #689296

#TimeUsernameProblemLanguageResultExecution timeMemory
689296zeroesandonesBitaro the Brave (JOI19_ho_t1)C++17
50 / 100
1028 ms17732 KiB
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef long double ld; typedef vector<ll> vi; typedef pair<ll, ll> pi; #define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i) #define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i) #define nl "\n" #define sp " " #define all(x) (x).begin(), (x).end() #define sc second #define fr first #define pb emplace_back void solve() { ll n, m; cin >> n >> m; string a[n]; FOR(i, 0, n) { cin >> a[i]; } ll ans = 0; FOR(i, 0, n) { FOR(j, 0, m) { if(a[i][j] != 'J') continue; ll O = 0, I = 0; FOR(l, j + 1, m) { if(a[i][l] == 'O') ++O; } FOR(l, i + 1, n) { if(a[l][j] == 'I') ++I; } ans += (O * I); } } cout << ans << nl; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll t = 1; // cin >> t; while (t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...