제출 #702482

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

joi2019_ho_t1

//~ #pragma GCC optimize("Ofast,unroll-loops")
//~ #pragma GCC target("avx,avx2,fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define fi first
#define se second
#define space " "
#define endl "\n"
#define mp make_pair
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define md 1000000007
#define inf 1000000000
#define li 3005
#define int long long
using namespace std;
int n,m,prei[li][li],preo[li][li],flag;
char c[li][li];
int32_t main(){
	scanf("%lld %lld",&n,&m);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			scanf(" %c",&c[i][j]);
		}
	}
	for(int i=n;i>=1;i--){
		for(int j=m;j>=1;j--){
			if(j!=m){
				preo[i][j]=preo[i][j+1];
				if(c[i][j+1]=='O') preo[i][j]++;
			}
			if(i!=n){
				prei[i][j]=prei[i+1][j];
				if(c[i+1][j]=='I') prei[i][j]++;
			}
			if(c[i][j]=='J') flag+=prei[i][j]*preo[i][j];
		}
	}
	printf("%lld\n",flag);
	return 0;
}

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

joi2019_ho_t1.cpp: In function 'int32_t main()':
joi2019_ho_t1.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  scanf("%lld %lld",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:25:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |    scanf(" %c",&c[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~

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