Submission #343670

#TimeUsernameProblemLanguageResultExecution timeMemory
343670GalebickosikasaBitaro the Brave (JOI19_ho_t1)C++17
100 / 100
434 ms159980 KiB
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx") // #pragma comment(linker, "/stack:200000000"] #include <iostream> #include <vector> #include <cmath> #include <algorithm> #include <unordered_set> #include <unordered_map> #include <set> #include <map> #include <queue> #include <deque> #include <bitset> #include <stack> #include <random> #include <fstream> #include <sstream> #include <chrono> #define fi first #define se second #define pb push_back #define ll long long #define ld long double #define hm unordered_map #define pii pair<int, int> #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() #define cinv(v) for (auto& x: v) cin >> x #define fr(i, n) for (int i = 0; i < n; ++i) #define fl(i, l, n) for (int i = l; i < n; ++i) #define int ll template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;} template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;} using namespace std; #ifdef LOCAL #define dbg(x) cerr << #x << " : " << x << '\n' const int maxn = 20; #else #define dbg(x) const int maxn = 3000 + 20; #endif //tg: @galebickosikasa ostream& operator << (ostream& out, const pii& v) { out << v.fi << ", " << v.se; return out; } template<typename T> ostream& operator << (ostream& out, const vector<T>& v) { for (auto& x: v) out << x << " "; return out; } istream& operator >> (istream& in, pii& a) { in >> a.fi >> a.se; return in; } const ll inf = (ll) 2e9; const ld pi = asin (1) * 2; const ld eps = 1e-8; const ll mod = (ll)1e9 + 7; const ll ns = 97; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); int dp1[maxn][maxn], dp2[maxn][maxn]; char goo[maxn][maxn]; signed main () { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n, m; cin >> n >> m; fr (i, n) fr (j, m) cin >> goo[i][j]; for (int i = 0; i < n; ++i) { for (int j = m - 1; j >= 0; --j) { dp1[i][j] = dp1[i][j + 1] + (goo[i][j] == 'O'); } } for (int j = 0; j < m; ++j) { for (int i = n - 1; i >= 0; --i) { dp2[i][j] = dp2[i + 1][j] + (goo[i][j] == 'I'); } } int ans = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { ans += dp1[i][j] * dp2[i][j] * (goo[i][j] == 'J'); if (goo[i][j] == 'J') { dbg (i); dbg (j); dbg (dp1[i][j]); dbg (dp2[i][j]); } } } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...