Submission #110318

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
110318	2019-05-10T17:16:27 Z	pamaj	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	1000 ms	1920 KB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e3 + 10;

int main()
{
	char tab[maxn][maxn];

	int H, W;

	cin >> H >> W;

	for(int i = 0; i < H; i++)
	{
		for(int j = 0; j < W; j++)
		{
			cin >> tab[i][j];
		}
	}

	int cont = 0;

	for(int i = 0; i < H - 1; i++)
	{
		for(int k = i + 1; k < H; k++)
		{
			for(int j = 0; j < W - 1; j++)
			{
				for(int l = j + 1; l < W; l++)
				{
					if(tab[i][j] == 'J' and tab[i][l] == 'O' and tab[k][j] == 'I')
						cont++;
				}
			}
		}
	}

	cout << cont << "\n";
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	3 ms	256 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	47 ms	612 KB	Output is correct
6	Correct	15 ms	640 KB	Output is correct
7	Correct	37 ms	632 KB	Output is correct
8	Correct	41 ms	640 KB	Output is correct
9	Correct	23 ms	640 KB	Output is correct
10	Correct	28 ms	640 KB	Output is correct
11	Correct	59 ms	652 KB	Output is correct
12	Correct	17 ms	640 KB	Output is correct
13	Correct	28 ms	640 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	3 ms	256 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	47 ms	612 KB	Output is correct
6	Correct	15 ms	640 KB	Output is correct
7	Correct	37 ms	632 KB	Output is correct
8	Correct	41 ms	640 KB	Output is correct
9	Correct	23 ms	640 KB	Output is correct
10	Correct	28 ms	640 KB	Output is correct
11	Correct	59 ms	652 KB	Output is correct
12	Correct	17 ms	640 KB	Output is correct
13	Correct	28 ms	640 KB	Output is correct
14	Execution timed out	1064 ms	1920 KB	Time limit exceeded
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	3 ms	256 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	47 ms	612 KB	Output is correct
6	Correct	15 ms	640 KB	Output is correct
7	Correct	37 ms	632 KB	Output is correct
8	Correct	41 ms	640 KB	Output is correct
9	Correct	23 ms	640 KB	Output is correct
10	Correct	28 ms	640 KB	Output is correct
11	Correct	59 ms	652 KB	Output is correct
12	Correct	17 ms	640 KB	Output is correct
13	Correct	28 ms	640 KB	Output is correct
14	Execution timed out	1064 ms	1920 KB	Time limit exceeded
15	Halted	0 ms	0 KB	-