oj.uz

Submission #945239

# Submission time Handle Problem Language Result Execution time Memory
945239 2024-03-13T14:49:17 Z professionalACer Bitaro the Brave (JOI19_ho_t1) C++17
0 / 100
 0 ms 348 KB 
#include <iostream>

using namespace std;

int main() {
    int H, W;
    cin >> H >> W;
    int ans = 0;
    char grid[H][W];
    for (int i = 1; i <= H; i++) {
        for (int j = 1; j <= W; j++) {
            for (int k = 1; k <= H; k++) {
                for (int l = 1; l <= W; l++) {
                    ans += (grid[i - 1][j - 1] == 'J' && grid[i - 1][l - 1] == 'O' && grid[k - 1][j - 1] == 'I');
                }
            }
        }
    }
    cout << ans << endl;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 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 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -