oj.uz

Submission #899340

# Submission time Handle Problem Language Result Execution time Memory
899340 2024-01-05T19:53:03 Z joccccca Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 405 ms 154812 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;


int prefo[3000][3000];
int prefi[3000][3000];
signed main()
{
    int n,m;

    cin>>n>>m;
    char a[n][m];

    for(int i=0; i < n; i++)
        for(int j=0; j < m;j++)
            cin >> a[i][j];


    for(int i=0; i<n;i++) {
        for(int j=0; j<m; j++) {
            if(a[i][j] == 'I'){
                prefi[i][j]++;
            }
            if(a[i][j] == 'O'){
                prefo[i][j]++;
            }
        }
    }
     for(int i=0; i < n; i++){
        for(int j=0; j < m;j++){
           prefo[i][j] += prefo[i][j - 1];

        }

    }
    for(int i=0; i < n; i++){
        for(int j=0; j < m;j++){
            prefi[i][j] += prefi[i - 1][j];

        }

    }
    long long rez=0;
    long long brI=0;
    long long brO=0;


    /* for(int i=0; i < n; i++){
        for(int j=0; j < m;j++){
           cout<<prefi[i][j]<< " ";
        }
        cout<<"\n";
    }
    cout<<"\n";
     for(int i=0; i < n; i++){
        for(int j=0; j < m;j++){
           cout<<prefo[i][j]<< " ";
        }
        cout<<"\n";
    }
    cout<<"\n";*/



    for(int i=0; i < n; i++){
        for(int j=0; j < m;j++){
            if(a[i][j]=='J'){
                brI = prefi[n-1][j] - prefi[i][j];
                brO = prefo[i][m-1] - prefo[i][j];

                rez+=brI*brO;
            }

        }
    }
    cout<<rez;

}

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 2496 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8692 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 1 ms 8536 KB Output is correct
13 Correct 1 ms 6492 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 2496 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8692 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 1 ms 8536 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 15 ms 25436 KB Output is correct
15 Correct 3 ms 20924 KB Output is correct
16 Correct 6 ms 15092 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 15 ms 25612 KB Output is correct
19 Correct 12 ms 25432 KB Output is correct
20 Correct 12 ms 25436 KB Output is correct
21 Correct 17 ms 25504 KB Output is correct
22 Correct 11 ms 25436 KB Output is correct
23 Correct 12 ms 25436 KB Output is correct
24 Correct 14 ms 25436 KB Output is correct
25 Correct 12 ms 25436 KB Output is correct
26 Correct 12 ms 25492 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 2496 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8692 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 1 ms 8536 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 15 ms 25436 KB Output is correct
15 Correct 3 ms 20924 KB Output is correct
16 Correct 6 ms 15092 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 15 ms 25612 KB Output is correct
19 Correct 12 ms 25432 KB Output is correct
20 Correct 12 ms 25436 KB Output is correct
21 Correct 17 ms 25504 KB Output is correct
22 Correct 11 ms 25436 KB Output is correct
23 Correct 12 ms 25436 KB Output is correct
24 Correct 14 ms 25436 KB Output is correct
25 Correct 12 ms 25436 KB Output is correct
26 Correct 12 ms 25492 KB Output is correct
27 Correct 404 ms 153732 KB Output is correct
28 Correct 13 ms 106076 KB Output is correct
29 Correct 25 ms 16028 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 286 ms 129152 KB Output is correct
32 Correct 345 ms 154436 KB Output is correct
33 Correct 333 ms 154324 KB Output is correct
34 Correct 328 ms 150992 KB Output is correct
35 Correct 358 ms 154812 KB Output is correct
36 Correct 335 ms 154448 KB Output is correct
37 Correct 405 ms 154628 KB Output is correct
38 Correct 247 ms 128828 KB Output is correct
39 Correct 233 ms 128852 KB Output is correct