oj.uz

Submission #1093660

# Submission time Handle Problem Language Result Execution time Memory
1093660 2024-09-27T07:54:54 Z v1vy Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
 5 ms 8860 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=3005;
int h,w,ai[N][N],ao[N][N],cnt;
char a[N][N];
int main(){
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>h>>w;
    for (int i=1; i<=h; i++){
        string s;
        cin>>s;
        for (int j=1; j<=w; j++){
            a[i][j]=s[j-1];
        }
    }/*
    for (int i=1; i<=h; i++){
        for (int j=1; j<=w; j++){
            cout<<a[i][j];
        }
        cout<<'\n';
    }*/
    for (int i=h; i>0; i--){
        for (int j=w; j>0; j--){
            if (a[i][j]=='I') ai[i][j]=ai[i+1][j]+1;
            else ai[i][j]=ai[i+1][j];
            if (a[i][j]=='O') ao[i][j]=ao[i][j+1]+1;
            else ao[i][j]=ao[i][j+1];
        }
    }
    for (int i=1; i<=h; i++){
        for (int j=1; j<=w; j++){
            if(a[i][j]=='J') cnt+=ai[i][j]*ao[i][j];
        }
    }
    cout<<cnt;
    /*
    for (int i=1; i<=h; i++){
        for (int j=1; j<=w; j++){
            cout<<ai[i][j]<<' ';
        }
        cout<<'\n';
    }

    for (int i=1; i<=h; i++){
        for (int j=1; j<=w; j++){
            cout<<ao[i][j]<<' ';
        }
        cout<<'\n';
    }*/
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 1 ms 3544 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3292 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 1 ms 3544 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3292 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct
14 Correct 4 ms 8332 KB Output is correct
15 Correct 2 ms 5976 KB Output is correct
16 Correct 2 ms 5856 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 5 ms 8860 KB Output is correct
19 Correct 3 ms 8796 KB Output is correct
20 Incorrect 3 ms 8812 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 1 ms 3544 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3292 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct
14 Correct 4 ms 8332 KB Output is correct
15 Correct 2 ms 5976 KB Output is correct
16 Correct 2 ms 5856 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 5 ms 8860 KB Output is correct
19 Correct 3 ms 8796 KB Output is correct
20 Incorrect 3 ms 8812 KB Output isn't correct
21 Halted 0 ms 0 KB -