oj.uz

Submission #666924

# Submission time Handle Problem Language Result Execution time Memory
666924 2022-11-29T23:30:34 Z divad Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
 20 ms 8020 KB 
#include <iostream>
#define MAX 3002
using namespace std;
int n,m,ans;
char ch,v[MAX][MAX];
int o[MAX][MAX],ig[MAX][MAX];

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> ch;
            v[i][j] = ch;
        }
    }
    for(int i = n; i >= 1; i--){
        for(int j = 1; j <= m; j++){
            ig[i][j] = (v[i][j] == 'I')+ig[i+1][j];
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = m; j >= 1; j--){
            o[i][j] = (v[i][j] == 'O')+o[i][j+1];
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(v[i][j] == 'J'){
                ans += o[i][j]*ig[i][j];
            }
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 1 ms 1364 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1496 KB Output is correct
12 Correct 2 ms 1368 KB Output is correct
13 Correct 2 ms 1364 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 1 ms 1364 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1496 KB Output is correct
12 Correct 2 ms 1368 KB Output is correct
13 Correct 2 ms 1364 KB Output is correct
14 Correct 16 ms 7372 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 10 ms 4292 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 20 ms 7892 KB Output is correct
19 Correct 19 ms 8020 KB Output is correct
20 Incorrect 20 ms 7748 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 1 ms 1364 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1496 KB Output is correct
12 Correct 2 ms 1368 KB Output is correct
13 Correct 2 ms 1364 KB Output is correct
14 Correct 16 ms 7372 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 10 ms 4292 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 20 ms 7892 KB Output is correct
19 Correct 19 ms 8020 KB Output is correct
20 Incorrect 20 ms 7748 KB Output isn't correct
21 Halted 0 ms 0 KB -