oj.uz

답안 #872938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872938 2023-11-14T06:20:54 Z 20163070 Bitaro the Brave (JOI19_ho_t1) C++14
0 / 100
 0 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N=3010;

int n,m;
char a[N][N];
int h[N],h2[N];

signed main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i]+1;
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(a[i][j]=='O') h[i]++;
		}
	}
	for(int k=1;k<=n;k++)
	{
		for(int j=1;j<=m;j++)
		{
			if(a[k][j]=='I') h2[j]++;
		}
	}
	int res=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			if(a[i][j]=='J'&&h[i]&&h2[j])
			{
				res+=h[i]*h2[j];
			}
		}
	}
	cout<<res;
	return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:17:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |   cin>>a[i]+1;
      |        ~~~~^~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -