oj.uz

Submission #1023559

# Submission time Handle Problem Language Result Execution time Memory
1023559 2024-07-15T02:28:34 Z baotoan655 Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 233 ms 221016 KB 
#include <bits/stdc++.h>
#define file(name)  if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define REV(i, b, a) for(int i = (b); i >= (a); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define ll long long
#define fi first 
#define se second
#define int long long
using namespace std;
const int N = 3005;
int n, m;
int a[N][N];
int d1[N][N], d2[N][N];
void solve(int tc) {
    cin >> n >> m;
    char ch;
    FOR(i, 1, n) FOR(j, 1, m) {
        cin >> ch;
        a[i][j] = ch == 'J' ? 0 : ch == 'O' ? 1 : 2;
    }
    int ans = 0;
    REV(i, n, 1) {
        REV(j, m, 1) {
            d1[i][j] = d1[i][j + 1] + (a[i][j] == 1);
            d2[i][j] = d2[i + 1][j] + (a[i][j] == 2);
            if(a[i][j] == 0) ans += d1[i][j] * d2[i][j];    
        }
    }
    cout << ans << '\n';
}
int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int tc = 1; 
    // cin >> tc;
    for(int i = 1; i <= tc; ++i) solve(tc);
    return (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 8796 KB Output is correct
6 Correct 1 ms 7004 KB Output is correct
7 Correct 1 ms 7116 KB Output is correct
8 Correct 1 ms 8792 KB Output is correct
9 Correct 1 ms 7004 KB Output is correct
10 Correct 1 ms 7004 KB Output is correct
11 Correct 1 ms 8796 KB Output is correct
12 Correct 1 ms 7004 KB Output is correct
13 Correct 1 ms 7000 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 8796 KB Output is correct
6 Correct 1 ms 7004 KB Output is correct
7 Correct 1 ms 7116 KB Output is correct
8 Correct 1 ms 8792 KB Output is correct
9 Correct 1 ms 7004 KB Output is correct
10 Correct 1 ms 7004 KB Output is correct
11 Correct 1 ms 8796 KB Output is correct
12 Correct 1 ms 7004 KB Output is correct
13 Correct 1 ms 7000 KB Output is correct
14 Correct 7 ms 21852 KB Output is correct
15 Correct 3 ms 16220 KB Output is correct
16 Correct 3 ms 16988 KB Output is correct
17 Correct 0 ms 2652 KB Output is correct
18 Correct 8 ms 22620 KB Output is correct
19 Correct 6 ms 25180 KB Output is correct
20 Correct 6 ms 26456 KB Output is correct
21 Correct 9 ms 27996 KB Output is correct
22 Correct 7 ms 26672 KB Output is correct
23 Correct 6 ms 26460 KB Output is correct
24 Correct 9 ms 26716 KB Output is correct
25 Correct 7 ms 27996 KB Output is correct
26 Correct 6 ms 26456 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 8796 KB Output is correct
6 Correct 1 ms 7004 KB Output is correct
7 Correct 1 ms 7116 KB Output is correct
8 Correct 1 ms 8792 KB Output is correct
9 Correct 1 ms 7004 KB Output is correct
10 Correct 1 ms 7004 KB Output is correct
11 Correct 1 ms 8796 KB Output is correct
12 Correct 1 ms 7004 KB Output is correct
13 Correct 1 ms 7000 KB Output is correct
14 Correct 7 ms 21852 KB Output is correct
15 Correct 3 ms 16220 KB Output is correct
16 Correct 3 ms 16988 KB Output is correct
17 Correct 0 ms 2652 KB Output is correct
18 Correct 8 ms 22620 KB Output is correct
19 Correct 6 ms 25180 KB Output is correct
20 Correct 6 ms 26456 KB Output is correct
21 Correct 9 ms 27996 KB Output is correct
22 Correct 7 ms 26672 KB Output is correct
23 Correct 6 ms 26460 KB Output is correct
24 Correct 9 ms 26716 KB Output is correct
25 Correct 7 ms 27996 KB Output is correct
26 Correct 6 ms 26456 KB Output is correct
27 Correct 219 ms 220568 KB Output is correct
28 Correct 15 ms 46208 KB Output is correct
29 Correct 9 ms 22224 KB Output is correct
30 Correct 1 ms 2908 KB Output is correct
31 Correct 167 ms 184648 KB Output is correct
32 Correct 169 ms 221012 KB Output is correct
33 Correct 153 ms 220500 KB Output is correct
34 Correct 214 ms 213776 KB Output is correct
35 Correct 154 ms 220840 KB Output is correct
36 Correct 154 ms 220500 KB Output is correct
37 Correct 233 ms 221016 KB Output is correct
38 Correct 123 ms 183888 KB Output is correct
39 Correct 127 ms 183864 KB Output is correct