제출 #1289176

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289176		m.zeeshanrashid	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	103 ms	10296 KiB

joi2019_ho_t1

#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

const int mod=998244353;
// const int mod1=998244353;
// const int mod=1e9+7;
const int N=2e5+5;

int bexp(int a,int b,int m){
	int ans=1;
	while(b>0){
		if(b&1){
			ans*=a;
			ans%=m;
		}
		b>>=1;
		a*=a;
		a%=m;
	}
	return ans;
}

int iter=1,itera=1;
void solve(){
	int n,m;
	cin>>n>>m;
	vec<string>s(n);
	inp(s)
	vec<int>o(n,0),in(m,0);
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(s[i][j]=='O') o[i]++;
			if(s[i][j]=='I') in[j]++;
		}
	}
	int ans=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(s[i][j]=='O') o[i]--;
			elif(s[i][j]=='I') in[j]--;
			else ans+=o[i]*in[j];
		}
	}
	cout<<ans<<endl;
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

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