Submission #340491

#	Time	Username	Problem	Language	Result	Execution time	Memory
340491		Kerim	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	105 ms	18028 KiB

joi2019_ho_t1

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=3003;
int a[N];
char arr[N][N];
int main(){
    //freopen("sample-1.in", "r", stdin);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)
		scanf("%s",arr[i]);
	ll ans=0;
	for(int i=n-1;i>=0;i--){
		int b=0;
		for(int j=m-1;j>=0;j--){
			if(arr[i][j]=='O')
				b++;
			else if(arr[i][j]=='I')
				a[j]++;
			else
				ans+=b*1LL*a[j];
		}
	}
	printf("%lld\n",ans);
	return 0;
}

Compilation message (stderr)

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t1.cpp:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |   scanf("%s",arr[i]);
      |   ~~~~~^~~~~~~~~~~~~

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