oj.uz

Submission #586386

# Submission time Handle Problem Language Result Execution time Memory
586386 2022-06-30T08:05:26 Z TheEvilBird Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 134 ms 19012 KB 
#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <numeric>
#include <string>
#include <bitset>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <random>
#include <ctime>
#include <chrono>

using namespace std;

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

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
//typedef __int128_t int128;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const char en = '\n';
const int INF = 1e9 + 7;
const ll INFLL = 1e18;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

void solve() {
    int h, w;
    cin >> h >> w;
    vector<string> a(h);
    for (int i = 0; i < h; ++i) {
        cin >> a[i];
    }
    vector<int> cnt_o(h), cnt_i(w);
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            if (a[i][j] == 'O') {
                ++cnt_o[i];
            }
            if (a[i][j] == 'I') {
                ++cnt_i[j];
            }
        }
    }
    ll ans = 0;
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            if (a[i][j] == 'J') {
                ans += 1LL * cnt_o[i] * cnt_i[j];
            }
            else if (a[i][j] == 'O') {
                --cnt_o[i];
            }
            else if (a[i][j] == 'I') {
                --cnt_i[j];
            }
        }
    }
    cout << ans << en;
}

int main() {
#ifdef __APPLE__
    freopen("input.txt", "r", stdin);
#else
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif
    solve();
    return 0;
}

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 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 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 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 2 ms 812 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 2 ms 712 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 2 ms 712 KB Output is correct
26 Correct 2 ms 720 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 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 2 ms 812 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 2 ms 712 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 2 ms 712 KB Output is correct
26 Correct 2 ms 720 KB Output is correct
27 Correct 131 ms 17848 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 5 ms 1616 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 108 ms 13148 KB Output is correct
32 Correct 58 ms 18816 KB Output is correct
33 Correct 46 ms 18880 KB Output is correct
34 Correct 113 ms 15212 KB Output is correct
35 Correct 71 ms 18668 KB Output is correct
36 Correct 43 ms 18764 KB Output is correct
37 Correct 134 ms 19012 KB Output is correct
38 Correct 45 ms 13060 KB Output is correct
39 Correct 31 ms 13092 KB Output is correct