Submission #920063

#	Time	Username	Problem	Language	Result	Execution time	Memory
920063		thunopro	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	303 ms	115540 KiB

joi2019_ho_t1

#include<bits/stdc++.h>
using namespace std ; 
#define maxn 3009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 

const int mod = 1e9+7; 
const int INF = 1e9; 

typedef vector<int> vi; 
typedef pair<int,int> pii;
typedef vector<pii> vii;  
typedef vector<ll> vl;

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a > mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

template <typename T> void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template <typename T> void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ;
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

int n , m ; 
int row [maxn][maxn] , col [maxn][maxn] ; 
int a [maxn][maxn] ; 
int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ; 
	cin >> n >> m ; 
	for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= m ; j ++ ) 
	{
		char c ; cin >> c ; 
		if ( c == 'J' ) a [i][j] = 0 ; 
		else if ( c == 'O' ) a [i][j] = 1 ; 
		else a [i][j] = 2 ; 
	}
	for ( int i = 1 ; i <= n ; i ++ ) for ( int j = m ; j >= 1 ; j -- ) row [i][j] = row [i][j+1] + (a[i][j]==1) ; 
	for ( int j = 1 ; j <= m ; j ++ ) for ( int i = n ; i >= 1 ; i -- ) col [i][j] = col [i+1][j] + (a[i][j]==2) ; 
	
	ll res = 0 ; 
	for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= m ; j ++ ) 
	{
		if ( a [i][j] == 0 ) res += 1ll*row[i][j]*col[i][j] ; 
	}
	cout << res ; 
	
}

Compilation message (stderr)

joi2019_ho_t1.cpp: In function 'void rf()':
joi2019_ho_t1.cpp:40:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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