제출 #99732

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
99732		Fasho	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	236 ms	80760 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
#define N 1000005
#define ll long long int 	
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("myfile.in","r",stdin);freopen ("myfile.out","w",stdout);
#define mod 1000000007
#define fs(x,y) for(int i=1;i<=y;i++) cin>>x[i];
#define fo(i,x,y) for(int i=x;i<=y;i++)
using namespace std;

ll n,ar[N],sum;

int preo[3005][3005],prei[3005][3005],m;

char s[3005][3005];

int main()
{
	fast;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		cin>>s[i]+1;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{
			preo[i][j]+=preo[i][j-1],prei[i][j]+=prei[i-1][j];
			if(s[i][j]=='I')
				prei[i][j]++;
			if(s[i][j]=='O')
				preo[i][j]++;
		}
	// for(int i=1;i<=n;i++)
	// {
	// 	for(int j=1;j<=m;j++)
	// 		cout<<prei[i][j]<<sp;
	// 	cout<<endl;
	// }
	// cout<<endl;
	// for(int i=1;i<=n;i++)
	// {
	// 	for(int j=1;j<=m;j++)
	// 		cout<<preo[i][j]<<sp;
	// 	cout<<endl;
	// }
	// cout<<endl;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(s[i][j]!='J')
				continue;
			int o=preo[i][m]-preo[i][j-1];
			int p=prei[n][j]-prei[i-1][j];
			// cout<<o<<sp<<p<<sp<<i<<sp<<j<<endl;
			sum+=o*p;
		}
	}
	cout<<sum;

}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50