oj.uz

Submission #1048477

# Submission time Handle Problem Language Result Execution time Memory
1048477 2024-08-08T07:50:10 Z Whisper Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 166 ms 168156 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX             3333

char A[MAX][MAX];
int I[MAX][MAX], O[MAX][MAX];
int numRow, numCol;
void process(void){
    cin >> numRow >> numCol;
    FOR(i, 1, numRow) FOR(j, 1, numCol){
        cin >> A[i][j];
    }
    FOR(i, 1, numRow) FORD(j, 1, numCol){
        I[i][j] = I[i][j + 1] + (A[i][j] == 'O');
    }

    FORD(i, 1, numRow) FOR(j, 1, numCol){
        O[i][j] = O[i + 1][j] + (A[i][j] == 'I');
    }

    int ans = 0;
    for (int i = 1; i <= numRow; ++i){
        for (int j = 1; j <= numCol; ++j){
            if (A[i][j] == 'J'){
                ans += O[i][j] * I[i][j];
            }
        }
    }
    cout << ans;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4952 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4952 KB Output is correct
14 Correct 5 ms 20572 KB Output is correct
15 Correct 2 ms 16476 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 0 ms 2652 KB Output is correct
18 Correct 6 ms 20964 KB Output is correct
19 Correct 8 ms 20828 KB Output is correct
20 Correct 5 ms 20936 KB Output is correct
21 Correct 7 ms 21028 KB Output is correct
22 Correct 6 ms 20824 KB Output is correct
23 Correct 6 ms 20824 KB Output is correct
24 Correct 6 ms 21048 KB Output is correct
25 Correct 8 ms 20828 KB Output is correct
26 Correct 7 ms 20828 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4952 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4952 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4952 KB Output is correct
14 Correct 5 ms 20572 KB Output is correct
15 Correct 2 ms 16476 KB Output is correct
16 Correct 3 ms 12892 KB Output is correct
17 Correct 0 ms 2652 KB Output is correct
18 Correct 6 ms 20964 KB Output is correct
19 Correct 8 ms 20828 KB Output is correct
20 Correct 5 ms 20936 KB Output is correct
21 Correct 7 ms 21028 KB Output is correct
22 Correct 6 ms 20824 KB Output is correct
23 Correct 6 ms 20824 KB Output is correct
24 Correct 6 ms 21048 KB Output is correct
25 Correct 8 ms 20828 KB Output is correct
26 Correct 7 ms 20828 KB Output is correct
27 Correct 143 ms 168152 KB Output is correct
28 Correct 9 ms 79988 KB Output is correct
29 Correct 15 ms 17404 KB Output is correct
30 Correct 1 ms 2908 KB Output is correct
31 Correct 96 ms 134096 KB Output is correct
32 Correct 166 ms 168144 KB Output is correct
33 Correct 118 ms 167384 KB Output is correct
34 Correct 114 ms 155092 KB Output is correct
35 Correct 124 ms 168156 KB Output is correct
36 Correct 159 ms 167372 KB Output is correct
37 Correct 145 ms 168148 KB Output is correct
38 Correct 90 ms 134104 KB Output is correct
39 Correct 86 ms 134092 KB Output is correct