oj.uz

Submission #1095490

# Submission time Handle Problem Language Result Execution time Memory
1095490 2024-10-02T12:06:01 Z TrinhKhanhDung Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 103 ms 88656 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18 + 10
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 3003;

int N, M;
int preO[MAX][MAX], preI[MAX][MAX];
string mat[MAX];

void solve(){
    cin >> N >> M;
    for(int i = 1; i <= N; i++){
        cin >> mat[i];
        mat[i] = " " + mat[i];
    }

    clock_t start = clock();

    for(int i = N; i >= 1; i--){
        for(int j = M; j >= 1; j--){
            preO[i][j] = preO[i][j + 1] + (mat[i][j] == 'O');
            preI[i][j] = preI[i + 1][j] + (mat[i][j] == 'I');
        }
    }

    ll ans = 0;
    for(int i = 1; i <= N; i++) for(int j = 1; j <= M; j++) if(mat[i][j] == 'J'){
        ans += 1LL * preO[i][j + 1] * preI[i + 1][j];
    }

    cout << ans << '\n';


    cerr << "Time elapsed: " << clock() - start << " ms\n";
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//     freopen("bdbang.inp","r",stdin);
//     freopen("bdbang.out","w",stdout);

    int t = 1;
//    cin >> t;
    while(t--)
        solve();

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 1304 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1456 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 1304 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1456 KB Output is correct
14 Correct 4 ms 6236 KB Output is correct
15 Correct 1 ms 3932 KB Output is correct
16 Correct 2 ms 3676 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 4 ms 7004 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 4 ms 7004 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 3 ms 6748 KB Output is correct
24 Correct 4 ms 6828 KB Output is correct
25 Correct 4 ms 6748 KB Output is correct
26 Correct 4 ms 6748 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 1304 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1456 KB Output is correct
14 Correct 4 ms 6236 KB Output is correct
15 Correct 1 ms 3932 KB Output is correct
16 Correct 2 ms 3676 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 4 ms 7004 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 4 ms 7004 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 3 ms 6748 KB Output is correct
24 Correct 4 ms 6828 KB Output is correct
25 Correct 4 ms 6748 KB Output is correct
26 Correct 4 ms 6748 KB Output is correct
27 Correct 97 ms 87584 KB Output is correct
28 Correct 7 ms 19288 KB Output is correct
29 Correct 6 ms 7768 KB Output is correct
30 Correct 1 ms 860 KB Output is correct
31 Correct 79 ms 71612 KB Output is correct
32 Correct 87 ms 88640 KB Output is correct
33 Correct 80 ms 88404 KB Output is correct
34 Correct 89 ms 82732 KB Output is correct
35 Correct 81 ms 88412 KB Output is correct
36 Correct 83 ms 88440 KB Output is correct
37 Correct 103 ms 88656 KB Output is correct
38 Correct 60 ms 71500 KB Output is correct
39 Correct 56 ms 71248 KB Output is correct