Submission #465111

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
465111	2021-08-15T08:09:35 Z	okaragul	Bitaro the Brave (JOI19_ho_t1)	C++17	20 / 100	20 ms	1788 KB

joi2019_ho_t1

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

#define ll long long
#define endl "\n"
#define all(aa) aa.begin(), aa.end()

int main(){
	int n, m;
	cin>>n>>m;
	vector<vector<char>> mat(n, vector<char>(m));
	vector<vector<int>> below(n, vector<int>(m));
	for(auto &r:mat) for(auto &e:r) cin>>e;

	for(int j = 0; j < m; j++) for(int i = n-1; i >= 0; i--)
		below[i][j]=below[min(n-1, i+1)][j]+(mat[i][j]=='I');

	int ans=0;
	for(int i = 0; i < n; i++){
		int cur=0;
		for(int j = m-1; j >= 0; j--) ans+=(mat[i][j]=='J')*(cur+=(mat[i][j]=='O'))*below[i][j];
	}

	cout<<ans<<endl;
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	14 ms	1356 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	10 ms	1068 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	20 ms	1788 KB	Output is correct
19	Correct	17 ms	1740 KB	Output is correct
20	Incorrect	17 ms	1764 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	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	14 ms	1356 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	10 ms	1068 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	20 ms	1788 KB	Output is correct
19	Correct	17 ms	1740 KB	Output is correct
20	Incorrect	17 ms	1764 KB	Output isn't correct
21	Halted	0 ms	0 KB	-