This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//~ #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 lo long long
using namespace std;
int T,Q,n,m,k,a[li],vis1[li],vis2[li],flag;
string s,t;
vector<int> v;
char c[li][li];
int main(){
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
scanf(" %c",&c[i][j]);
}
}
for(int i=1;i<=n;i++){
int sayi=0;
for(int j=1;j<=m;j++){
if(c[i][j]=='O') sayi++;
}
vis1[i]=sayi;
}
for(int i=1;i<=m;i++){
int sayi=0;
for(int j=1;j<=n;j++){
if(c[j][i]=='I') sayi++;
}
vis2[i]=sayi;
}
for(int i=1;i<=min(n,m);i++){
int vl1=vis2[i];
if(vl1==0) continue;
for(int j=1;j<=n;j++){
if(c[j][i]!='J') continue;
int vl2=vis1[j];
if(vl2==0) continue;
flag+=vl1*vl2;
}
}
printf("%d\n",flag);
return 0;
}
Compilation message (stderr)
joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:24:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
24 | scanf("%d %d",&n,&m);
| ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:27:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
27 | scanf(" %c",&c[i][j]);
| ~~~~~^~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |