Submission #558648

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
558648	2022-05-07T20:14:59 Z	Olympia	Bitaro the Brave (JOI19_ho_t1)	C++17	20 / 100	8 ms	2900 KB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
int main() {
    int H, W;
    cin >> H >> W;
    string arr[H];
    for (int i = 0; i < H; i++) {
        cin >> arr[i];
    }
    int o[H][W + 1];
    for (int i = 0; i < H; i++) {
        o[i][0] = 0;
        for (int j = 0; j < W; j++) {
            o[i][j + 1] = o[i][j] + (arr[i][j] == 'O');
        }
    }
    int x[W][H + 1];
    for (int i = 0; i < W; i++) {
        x[i][0] = 0;
        for (int j = 0; j < H; j++) {
            x[i][j + 1] = x[i][j] + (arr[j][i] == 'I');
        }
    }
    int ans = 0;
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            if (arr[i][j] && x[j] && o[i]) {
                ans += (arr[i][j] == 'J') * (o[i][W] - o[i][j]) * (x[j][H] - x[j][i]);
            }
        }
    }
    cout << ans;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	304 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	7 ms	2224 KB	Output is correct
15	Correct	1 ms	308 KB	Output is correct
16	Correct	5 ms	1620 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	8 ms	2872 KB	Output is correct
19	Correct	7 ms	2644 KB	Output is correct
20	Incorrect	8 ms	2900 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	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	304 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	7 ms	2224 KB	Output is correct
15	Correct	1 ms	308 KB	Output is correct
16	Correct	5 ms	1620 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	8 ms	2872 KB	Output is correct
19	Correct	7 ms	2644 KB	Output is correct
20	Incorrect	8 ms	2900 KB	Output isn't correct
21	Halted	0 ms	0 KB	-