Submission #110327

#TimeUsernameProblemLanguageResultExecution timeMemory
110327pamajBitaro the Brave (JOI19_ho_t1)C++14
0 / 100
2 ms384 KiB
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e3 + 10;

int numO[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 = 0; j < W; j++)
		{
			if(tab[i][j] == 'O') numO[i]++;
		}
	}

	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++)
			{
				if(tab[i][j] == 'J' and tab[k][j] == 'I')
					cont += numO[i];
			}
		}
	}

	cout << cont << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...