oj.uz

Submission #702453

# Submission time Handle Problem Language Result Execution time Memory
702453 2023-02-24T05:59:28 Z nicecoder37 Bitaro the Brave (JOI19_ho_t1) C++17
0 / 100
 0 ms 340 KB 
//~ #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 T,Q,n,m,k,a[li],vis1[li],vis2[li],flag;
string s,t;
vector<int> v;
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=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("%lld\n",flag);
	return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int32_t 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("%lld %lld",&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]);
      |    ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Halted 0 ms 0 KB -