oj.uz

Submission #1096499

# Submission time Handle Problem Language Result Execution time Memory
1096499 2024-10-04T15:57:10 Z lmToT27 Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 60 ms 25008 KB 
#include <bits/stdc++.h>
#define all(dataStructure) dataStructure.begin(),dataStructure.end()
#define ll long long

using namespace std;
namespace std {
        template <typename T, int D>
        struct _vector : public vector <_vector <T, D - 1>> {
                static_assert(D >= 1, "Dimension must be positive!");
                template <typename... Args>
                _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
        };
        // _vector <int, 3> a(n, m, k);: int a[n][m][k].
        // _vector <int, 3> a(n, m, k, x);: int a[n][m][k] initialized with x.
        template <typename T>
        struct _vector <T, 1> : public vector <T> {
                _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
        };
}

const int MAX = 3e3 + 3;
const ll MOD[] = {1000000007, 998244353};

int n, m;
string st[MAX];
int r[MAX][256], c[MAX][256];


void Solve() {
        cin >> n >> m;
        for (int i = 0; i < n; i++) {
                cin >> st[i];
        }
        ll res = 0;
        for (int i = n - 1; i >= 0; i--) {
                for (int j = m - 1; j >= 0; j--) {
                        r[i][st[i][j]]++;
                        c[j][st[i][j]]++;
                        if (st[i][j] == 'J') res += r[i]['O'] * c[j]['I'];
                }
        }
        cout << res;
}

int32_t main() {
        ios_base::sync_with_stdio(0);
        cin.tie(0);

        #define TASK "TASK"
        if (fopen(TASK".INP", "r")) {
                freopen(TASK".INP", "r", stdin);
                freopen(TASK".OUT", "w", stdout);
        }
        
        /* int TEST = 1; cin >> TEST; while (TEST--) */ Solve();

        cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
        return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'void Solve()':
joi2019_ho_t1.cpp:37:38: warning: array subscript has type 'char' [-Wchar-subscripts]
   37 |                         r[i][st[i][j]]++;
      |                                      ^
joi2019_ho_t1.cpp:38:38: warning: array subscript has type 'char' [-Wchar-subscripts]
   38 |                         c[j][st[i][j]]++;
      |                                      ^
joi2019_ho_t1.cpp: In function 'int32_t main()':
joi2019_ho_t1.cpp:51:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |                 freopen(TASK".INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:52:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |                 freopen(TASK".OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 2 ms 1628 KB Output is correct
15 Correct 1 ms 820 KB Output is correct
16 Correct 2 ms 1592 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 2 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 2 ms 1972 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 3 ms 1956 KB Output is correct
25 Correct 2 ms 1884 KB Output is correct
26 Correct 2 ms 1880 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 2 ms 1628 KB Output is correct
15 Correct 1 ms 820 KB Output is correct
16 Correct 2 ms 1592 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 2 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 2 ms 1972 KB Output is correct
21 Correct 2 ms 1884 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 3 ms 1956 KB Output is correct
25 Correct 2 ms 1884 KB Output is correct
26 Correct 2 ms 1880 KB Output is correct
27 Correct 60 ms 23660 KB Output is correct
28 Correct 1 ms 2904 KB Output is correct
29 Correct 5 ms 4444 KB Output is correct
30 Correct 1 ms 2904 KB Output is correct
31 Correct 44 ms 18228 KB Output is correct
32 Correct 46 ms 24916 KB Output is correct
33 Correct 46 ms 25008 KB Output is correct
34 Correct 44 ms 20664 KB Output is correct
35 Correct 44 ms 24660 KB Output is correct
36 Correct 47 ms 24844 KB Output is correct
37 Correct 59 ms 24916 KB Output is correct
38 Correct 31 ms 18056 KB Output is correct
39 Correct 32 ms 18000 KB Output is correct