Submission #891305

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
891305	2023-12-22T17:32:20 Z	Irate	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	172 ms	88912 KB

joi2019_ho_t1

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

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<vector<char>>grid(n + 1, vector<char>(m + 1));
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= m;++j){
            cin >> grid[i][j];
        }
    }
    vector<vector<int>>orbs(n + 1, vector<int>(m + 1));
    
    for(int i = 1;i <= n;++i){
        for(int j = m;j >= 1;--j){
            if(j + 1 <= m)orbs[i][j] = orbs[i][j + 1] + (grid[i][j] == 'O');
            else orbs[i][j] = (grid[i][j] == 'O');
        }
    }
    vector<vector<int>>ingots(n + 1, vector<int>(m + 1));
    for(int i = n;i >= 1;--i){
        for(int j = 1;j <= m;++j){
            if(i + 1 <= n)ingots[i][j] = ingots[i + 1][j] + (grid[i][j] == 'I');
            else ingots[i][j] = (grid[i][j] == 'I');
        }
    }
    long long res = 0;
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= m;++j){
            if(grid[i][j] == 'J'){
                res += ingots[i][j] * orbs[i][j];
            }
        }
    }
    cout << res;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	452 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	480 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	4 ms	2396 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	1624 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	5 ms	2908 KB	Output is correct
19	Correct	4 ms	2800 KB	Output is correct
20	Correct	5 ms	2748 KB	Output is correct
21	Correct	5 ms	2908 KB	Output is correct
22	Correct	4 ms	2648 KB	Output is correct
23	Correct	4 ms	2908 KB	Output is correct
24	Correct	5 ms	2904 KB	Output is correct
25	Correct	6 ms	2652 KB	Output is correct
26	Correct	4 ms	2844 KB	Output is correct

Subtask #3

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	452 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	480 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	4 ms	2396 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	1624 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	5 ms	2908 KB	Output is correct
19	Correct	4 ms	2800 KB	Output is correct
20	Correct	5 ms	2748 KB	Output is correct
21	Correct	5 ms	2908 KB	Output is correct
22	Correct	4 ms	2648 KB	Output is correct
23	Correct	4 ms	2908 KB	Output is correct
24	Correct	5 ms	2904 KB	Output is correct
25	Correct	6 ms	2652 KB	Output is correct
26	Correct	4 ms	2844 KB	Output is correct
27	Correct	165 ms	83948 KB	Output is correct
28	Correct	1 ms	856 KB	Output is correct
29	Correct	11 ms	6724 KB	Output is correct
30	Correct	1 ms	600 KB	Output is correct
31	Correct	116 ms	61776 KB	Output is correct
32	Correct	155 ms	88144 KB	Output is correct
33	Correct	143 ms	88604 KB	Output is correct
34	Correct	138 ms	71832 KB	Output is correct
35	Correct	143 ms	88148 KB	Output is correct
36	Correct	148 ms	88444 KB	Output is correct
37	Correct	172 ms	88912 KB	Output is correct
38	Correct	100 ms	61256 KB	Output is correct
39	Correct	100 ms	61520 KB	Output is correct