oj.uz

Submission #482564

# Submission time Handle Problem Language Result Execution time Memory
482564 2021-10-25T15:46:16 Z jalsol Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 113 ms 88480 KB 
#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
#define TASK "empty"
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 3000 + 5;

int n, m;
char a[maxn][maxn];

enum { J, O, I };
constexpr const char* c = "JOI";
int pref[3][maxn][maxn];

int get(int t, int x, int y, int u, int v) {
    return pref[t][u][v]
         - pref[t][x - 1][v]
         - pref[t][u][y - 1]
         + pref[t][x - 1][y - 1];
}

signed main() {
    cin >> n >> m;
    For (i, 1, n) cin >> (a[i] + 1);

    For (i, 1, n) {
        For (j, 1, m) {
            For (k, 1, 2) {
                pref[k][i][j] = pref[k][i - 1][j]
                              + pref[k][i][j - 1]
                              - pref[k][i - 1][j - 1]
                              + (a[i][j] == c[k]);
            }
        }
    }

    ll ans = 0;

    For (i, 1, n) {
        For (j, 1, m) {
            if (a[i][j] != 'J') continue;

            int cntO = get(O, i, j + 1, i, m);
            int cntI = get(I, i + 1, j, n, j);

            ans += 1LL * cntO * cntI;
        }
    }

    cout << ans << '\n';
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 448 KB Output is correct
5 Correct 2 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1356 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1484 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1480 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1356 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 448 KB Output is correct
5 Correct 2 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1356 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1484 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1480 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1356 KB Output is correct
14 Correct 6 ms 7500 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 5 ms 4200 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 7 ms 8012 KB Output is correct
19 Correct 6 ms 7884 KB Output is correct
20 Correct 6 ms 7788 KB Output is correct
21 Correct 6 ms 8012 KB Output is correct
22 Correct 6 ms 7880 KB Output is correct
23 Correct 5 ms 7836 KB Output is correct
24 Correct 7 ms 8012 KB Output is correct
25 Correct 5 ms 7884 KB Output is correct
26 Correct 5 ms 7820 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 448 KB Output is correct
5 Correct 2 ms 1484 KB Output is correct
6 Correct 1 ms 1484 KB Output is correct
7 Correct 1 ms 1356 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1484 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1480 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1356 KB Output is correct
14 Correct 6 ms 7500 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 5 ms 4200 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 7 ms 8012 KB Output is correct
19 Correct 6 ms 7884 KB Output is correct
20 Correct 6 ms 7788 KB Output is correct
21 Correct 6 ms 8012 KB Output is correct
22 Correct 6 ms 7880 KB Output is correct
23 Correct 5 ms 7836 KB Output is correct
24 Correct 7 ms 8012 KB Output is correct
25 Correct 5 ms 7884 KB Output is correct
26 Correct 5 ms 7820 KB Output is correct
27 Correct 104 ms 87896 KB Output is correct
28 Correct 14 ms 25932 KB Output is correct
29 Correct 7 ms 7756 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 83 ms 72644 KB Output is correct
32 Correct 82 ms 88364 KB Output is correct
33 Correct 81 ms 88156 KB Output is correct
34 Correct 94 ms 84036 KB Output is correct
35 Correct 90 ms 88352 KB Output is correct
36 Correct 83 ms 88136 KB Output is correct
37 Correct 113 ms 88480 KB Output is correct
38 Correct 64 ms 72420 KB Output is correct
39 Correct 64 ms 72260 KB Output is correct