답안 #1024585

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1024585	2024-07-16T08:23:02 Z	toast12	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	6 ms	860 KB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int h, w;
    cin >> h >> w;
    vector<vector<char>> grid(h+1, vector<char>(w+1));
    vector<int> orb(h+1), ingot(w+1);
    for (int i = 1; i <= h; i++) {
        for (int j = 1; j <= w; j++) {
            cin >> grid[i][j];
            if (grid[i][j] == 'O')
                orb[i]++;
            else if (grid[i][j] == 'I')
                ingot[j]++;
        }
    }
    int ans = 0;
    vector<int> rcnt(h+1), ccnt(w+1);
    for (int i = 1; i <= h; i++) {
        for (int j = 1; j <= w; j++) {
            if (grid[i][j] == 'J')
                ans += (orb[i]-rcnt[i])*(ingot[j]-ccnt[j]);
            else if (grid[i][j] == 'O')
                rcnt[i]++;
            else
                ccnt[j]++;
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 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	384 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 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	384 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	5 ms	788 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	6 ms	860 KB	Output is correct
19	Correct	3 ms	860 KB	Output is correct
20	Incorrect	3 ms	860 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 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	384 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	5 ms	788 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	6 ms	860 KB	Output is correct
19	Correct	3 ms	860 KB	Output is correct
20	Incorrect	3 ms	860 KB	Output isn't correct
21	Halted	0 ms	0 KB	-