제출 #1118558

#제출 시각아이디문제언어결과실행 시간메모리
1118558vjudge1Bitaro the Brave (JOI19_ho_t1)C++17
20 / 100
1037 ms2336 KiB
#include <bits/stdc++.h> #define F first #define S second #define LL long long #define rep(i, x) for(auto &i : (x)) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define left(x) ((x)<<1) #define right(x) ((x)>>1) #define LSOne(x) (x & -(x)) using namespace std; using T = pair<pair<int, int>, int>; const int SZ = 2e5 + 1; const LL MOD = 1e9 + 7; const LL INF = 1e18 + 1; LL bp (LL b, LL e, LL m = MOD) { if ( e == 0 ) return 1; LL T = bp(b, e / 2); T *= T; T %= m; if ( e & 1 ) T *= b; return T %= m; } LL nv_i (LL a) { return bp(a, MOD - 2); }; LL gcd (LL a, LL b) { return (b == 0 ? a : gcd(b, a % b)); } LL lcm(LL a, LL b) { return (a * (b / gcd(a, b))); } LL ceil (LL a, LL b) { return ((a + b - 1) / b); } void solve() { int n, m; cin >> n >> m; vector<pair<int, int>> Js, Os, Is; vector<vector<char>> MC(n + 1, vector<char> (m + 1)); for(int i = 1; i <= n; i ++) { for(int j = 1; j <= m; j ++) { char x; cin >> x; MC[i][j] = x; if(x == 'J') { Js.emplace_back(i, j); } if(x == 'O') { Os.emplace_back(i, j); } if(x == 'I') { Is.emplace_back(i, j); } } } LL ans = 0; rep(J, Js) { int cnt_Os = 0, cnt_Is = 0; rep(O, Os) { if(J.F > O.F || J.S > O.S) continue; if(J.F == O.F) cnt_Os ++; } rep(I, Is) { if(J.F > I.F || J.S > I.S) continue; if(J.S == I.S) cnt_Is ++; } ans += cnt_Os * cnt_Is; } cout << ans; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...