oj.uz

Submission #838552

# Submission time Handle Problem Language Result Execution time Memory
838552 2023-08-27T11:29:46 Z green_gold_dog Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 200 ms 171280 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n, m;
        cin >> n >> m;
        vector<vector<char>> arr(n, vector<char>(m));
        for (ll i = 0; i < n; i++) {
                for (ll j = 0; j < m; j++) {
                        cin >> arr[i][j];
                }
        }
        vector<vector<ll>> os(n, vector<ll>(1, 0)), is(1, vector<ll>(m, 0));
        for (ll i = 0; i < n; i++) {
                vector<ll> ni;
                for (ll j = 0; j < m; j++) {
                        os[i].push_back(os[i].back() + (arr[i][j] == 'O'));
                        ni.push_back(is.back()[j] + (arr[i][j] == 'I'));
                }
                is.push_back(ni);
        }
        ll ans = 0;
        for (ll i = 0; i < n; i++) {
                for (ll j = 0; j < m; j++) {
                        if (arr[i][j] == 'J') {
                                ans += (os[i][m] - os[i][j]) * (is[n][j] - is[i][j]);
                        }
                }
        }
        cout << ans << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:81:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:82:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 472 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 472 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 6 ms 4308 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 3 ms 2644 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 6 ms 4820 KB Output is correct
19 Correct 6 ms 4740 KB Output is correct
20 Correct 6 ms 4692 KB Output is correct
21 Correct 6 ms 4812 KB Output is correct
22 Correct 6 ms 4692 KB Output is correct
23 Correct 7 ms 4692 KB Output is correct
24 Correct 7 ms 4820 KB Output is correct
25 Correct 5 ms 4692 KB Output is correct
26 Correct 6 ms 4692 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 1 ms 472 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 6 ms 4308 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 3 ms 2644 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 6 ms 4820 KB Output is correct
19 Correct 6 ms 4740 KB Output is correct
20 Correct 6 ms 4692 KB Output is correct
21 Correct 6 ms 4812 KB Output is correct
22 Correct 6 ms 4692 KB Output is correct
23 Correct 7 ms 4692 KB Output is correct
24 Correct 7 ms 4820 KB Output is correct
25 Correct 5 ms 4692 KB Output is correct
26 Correct 6 ms 4692 KB Output is correct
27 Correct 188 ms 162528 KB Output is correct
28 Correct 2 ms 1108 KB Output is correct
29 Correct 18 ms 12860 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 140 ms 120888 KB Output is correct
32 Correct 176 ms 170300 KB Output is correct
33 Correct 178 ms 170828 KB Output is correct
34 Correct 162 ms 140104 KB Output is correct
35 Correct 185 ms 170316 KB Output is correct
36 Correct 187 ms 170720 KB Output is correct
37 Correct 200 ms 171280 KB Output is correct
38 Correct 121 ms 120036 KB Output is correct
39 Correct 121 ms 120432 KB Output is correct