Submission #110352

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
110352	2019-05-10T17:57:41 Z	pamaj	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	9 ms	640 KB

joi2019_ho_t1

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

int numO[maxn][maxn], numI[maxn][maxn];

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];
		}
	}

	for(int i = 0; i < H; i++)
	{
		for(int j = 1; j < W; j++)
		{
			if(j)numO[i][j] += numO[i][j - 1];
			if(tab[i][j] == 'O') numO[i][j]++;
		}
	}

	for(int i = 0; i < W; i++)
	{
		for(int j = 0; j < H; j++)
		{
			if(j) numI[j][i] += numI[j - 1][i];
			if(tab[j][i] == 'I') numI[j][i]++;
		}
	}

	//for(int i = 0; i < H; i++) cout << numO[i][W - 1] << " \n"[i== H-1];

	//for(int i = 0; i < W; i++) cout << numI[H - 1][i] << " \n"[i== W-1];
	
	int cont = 0;

	for(int i = 0; i < H; i++)
	{
		for(int j = 0; j < W; j++)
		{
				if(tab[i][j] == 'J')
				{
					//cout << i << " " << j << "\n";
					cont += (numO[i][W - 1] - numO[i][j])*(numI[H - 1][j] -numI[i][j]);
				}
		}
	}

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

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	5 ms	640 KB	Output is correct
6	Correct	4 ms	640 KB	Output is correct
7	Correct	4 ms	640 KB	Output is correct
8	Correct	3 ms	640 KB	Output is correct
9	Correct	3 ms	640 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct
11	Correct	3 ms	640 KB	Output is correct
12	Correct	3 ms	640 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	5 ms	640 KB	Output is correct
6	Correct	4 ms	640 KB	Output is correct
7	Correct	4 ms	640 KB	Output is correct
8	Correct	3 ms	640 KB	Output is correct
9	Correct	3 ms	640 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct
11	Correct	3 ms	640 KB	Output is correct
12	Correct	3 ms	640 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Runtime error	9 ms	640 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	5 ms	640 KB	Output is correct
6	Correct	4 ms	640 KB	Output is correct
7	Correct	4 ms	640 KB	Output is correct
8	Correct	3 ms	640 KB	Output is correct
9	Correct	3 ms	640 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct
11	Correct	3 ms	640 KB	Output is correct
12	Correct	3 ms	640 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Runtime error	9 ms	640 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
15	Halted	0 ms	0 KB	-