oj.uz

Submission #889053

# Submission time Handle Problem Language Result Execution time Memory
889053 2023-12-18T17:42:00 Z BBart888 Bitaro the Brave (JOI19_ho_t1) C++14
0 / 100
 0 ms 356 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN= 3e3 + 11;
using ll = long long;


int H,W;
string S[MAXN];
ll cntI[MAXN];
ll cntO[MAXN];
ll ans;

int main()
{
	cin.tie(0);
	cout.tie(0);
	
	cin >> H >> W;
	
	for(int i = 0;i<H;i++)
	{
		cin>>S[i];
	}
	
	
	for(int i =0;i<H;i++)
	{
		for(int j = 0;j<W;j++)
		{
			cntO[i]+=(S[i][j] == 'O');
			cntI[j]+=(S[i][j] == 'I');
		}
	}
	
	for(int i = 0;i<H;i++)
	{
		for(int j = 0;j<W;j++)
		{
			if(S[i][j] == 'J')
			{
				ans+=(cntO[i]*cntI[j]);
			}
		}
	}
	
	
	cout<<ans<<'\n';
	
	
	
	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -