Submission #1027164

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1027164	2024-07-19T01:23:21 Z	vjudge1	Bitaro the Brave (JOI19_ho_t1)	C++17	20 / 100	1000 ms	2900 KB

joi2019_ho_t1

#include <bits/stdc++.h>
#define ll long long
#define nikah ios_base::sync_with_stdio(0); cin.tie(0);
const ll maxn = 1e4+7;
using namespace std;

ll t,n,m;
char a[3007][3007];

int main () {
	nikah
	cin>>n>>m;
	for (ll i=1; i<=n; i++) {
		for (ll j=1; j<=m; j++) {
			cin>>a[i][j];
		}
	}
	ll ans = 0;
	for (ll i=1; i<=n; i++) {
		for (ll j=1; j<=m; j++) {
			if (a[i][j] != 'J') continue;
			for (ll k=i+1; k<=n; k++) {
				if (a[k][j] != 'I') continue;
				for (ll l=j+1; l<=m; l++) {
					if (a[i][j] == 'J' && a[i][l] == 'O'&& a[k][j] == 'I') {
						ans++;
					//	cout<<i<<" "<<j<<" "<<k<<" "<<l<<endl;
					}
				}
			}
		}
	}
	cout<<ans<<endl;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
5	Correct	3 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	7 ms	2652 KB	Output is correct
8	Correct	3 ms	2652 KB	Output is correct
9	Correct	2 ms	2652 KB	Output is correct
10	Correct	6 ms	2712 KB	Output is correct
11	Correct	2 ms	2652 KB	Output is correct
12	Correct	1 ms	2652 KB	Output is correct
13	Correct	6 ms	2712 KB	Output is correct
14	Correct	732 ms	2900 KB	Output is correct
15	Correct	3 ms	2652 KB	Output is correct
16	Correct	250 ms	2652 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Execution timed out	1097 ms	2784 KB	Time limit exceeded
19	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	Correct	0 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	3 ms	2652 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	7 ms	2652 KB	Output is correct
8	Correct	3 ms	2652 KB	Output is correct
9	Correct	2 ms	2652 KB	Output is correct
10	Correct	6 ms	2712 KB	Output is correct
11	Correct	2 ms	2652 KB	Output is correct
12	Correct	1 ms	2652 KB	Output is correct
13	Correct	6 ms	2712 KB	Output is correct
14	Correct	732 ms	2900 KB	Output is correct
15	Correct	3 ms	2652 KB	Output is correct
16	Correct	250 ms	2652 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Execution timed out	1097 ms	2784 KB	Time limit exceeded
19	Halted	0 ms	0 KB	-