제출 #560069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
560069		Baytoro	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	284 ms	159116 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#define Baytoro_Mayrambekov void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
const int INF=1e18;
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
	if(n==0)
		return 1;
	if(n%2==1)
		return binpow(a, n-1)*a;
	else{
		int b=binpow(a, n/2);
		return b*b;
	}
}
char ar[3005][3005];
int pref[3005][3005],suf[3005][3005];
int a,b,c,n,m,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_Mayrambekov{
	cin>>n>>m;
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			cin>>ar[i][j];
		}
	}
	for(i=1;i<=n;i++){
		for(j=m;j>=1;j--){
			pref[i][j]=pref[i][j+1];
			if(ar[i][j]=='O')
				pref[i][j]++;
		}
	}
	for(i=n;i>=1;i--){
		for(j=1;j<=m;j++){
			suf[i][j]=suf[i+1][j];
			if(ar[i][j]=='I')
				suf[i][j]++;
		}
	}
	res=0;
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			if(ar[i][j]=='J'){
				res+=pref[i][j]*suf[i][j];
			}
		}
	}
	cout<<res<<endl;
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

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

joi2019_ho_t1.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main(){
      | ^~~~
joi2019_ho_t1.cpp: In function 'void fopn(std::string)':
joi2019_ho_t1.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:15:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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