oj.uz

Submission #554703

# Submission time Handle Problem Language Result Execution time Memory
554703 2022-04-29T08:23:33 Z DrearyJoke Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 77 ms 89636 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define END "\n"
#define rall(v) (v).rbegin(), (v).rend()
#define all(v) (v).begin(), (v).end()
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve(){
    int h, w;
    cin >> h >> w;
    vector<string> A(h);
    for (int i = 0; i < h; ++i) cin >> A[i];
    vector<vector<int>> ccnt(h, vector<int>(w)), rcnt(h, vector<int>(w));
    for (int i = 0; i < h; ++i) {
        for (int j = w - 1; j >= 0; --j) {
            ccnt[i][j] = (j == w - 1 ? 0 : ccnt[i][j + 1]) + (A[i][j] == 'O');
        }
    }
    for (int i = h - 1; i >= 0; --i) {
        for (int j = 0; j < w; ++j) {
            rcnt[i][j] = (i == h - 1 ? 0 : rcnt[i + 1][j]) + (A[i][j] == 'I');
        }
    }
    ll ans = 0;
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            ans += 1LL * (A[i][j] == 'J') * rcnt[i][j] * ccnt[i][j];
        }
    }
    cout << ans << END;
}
int main()
{
    fastio
    int t = 1;
    // cin>> t;
    while(t--) 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 316 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 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 332 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 316 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 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 332 KB Output is correct
14 Correct 2 ms 2256 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 2 ms 1612 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 3 ms 2764 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 3 ms 2772 KB Output is correct
21 Correct 3 ms 2772 KB Output is correct
22 Correct 4 ms 2644 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 3 ms 2764 KB Output is correct
25 Correct 3 ms 2644 KB Output is correct
26 Correct 3 ms 2772 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 316 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 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 332 KB Output is correct
14 Correct 2 ms 2256 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 2 ms 1612 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 3 ms 2764 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 3 ms 2772 KB Output is correct
21 Correct 3 ms 2772 KB Output is correct
22 Correct 4 ms 2644 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 3 ms 2764 KB Output is correct
25 Correct 3 ms 2644 KB Output is correct
26 Correct 3 ms 2772 KB Output is correct
27 Correct 72 ms 84548 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 6 ms 6708 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 58 ms 62216 KB Output is correct
32 Correct 75 ms 89044 KB Output is correct
33 Correct 77 ms 89292 KB Output is correct
34 Correct 61 ms 72172 KB Output is correct
35 Correct 74 ms 88900 KB Output is correct
36 Correct 76 ms 89236 KB Output is correct
37 Correct 76 ms 89636 KB Output is correct
38 Correct 55 ms 61764 KB Output is correct
39 Correct 56 ms 62132 KB Output is correct