oj.uz

Submission #926462

# Submission time Handle Problem Language Result Execution time Memory
926462 2024-02-13T04:31:08 Z Cutebol Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 221 ms 161816 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
 
bool YES(bool f){ if(f) cout << "Yes\n" ; else cout << "No\n" ; return f ; }
void YES(){YES(1);}
void NO(){YES(0);}
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define ld long double
#define pii pair <int , int>
#define all(x) x.begin() , x.end()
#define ff first
#define ss second
#define endl '\n'
 
const int N = 3e3 + 5 ;
const int inf = 1e16 ;
const int mod = 1e9 + 8 ;
const double eps = 1e-8 ;
 
int binpow( int a , int b ){
  if ( b == 0 ) return 1 ;
  int x = binpow ( a , b/2 ) ;
  if ( !(b%2) ) return (x*x) ;
  return (x*x*a) ;
}
template <class T>
bool chmax( T& x , const T& y ){
  bool f = 0 ;
  if ( x < y ) x = y , f = 1 ;
  return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
  bool f = 0 ;
  if ( x > y ) x = y , f = 1 ;
  return f ;
}
 
//code
 
int n , m , ans ;
string s[N] ;
int a[N][N] , b[N][N] ;

void solve(){
	cin >> n >> m ;
	for ( int i = 0 ; i < n ; i ++ ) cin >> s[i] ;
	for ( int i = n-1 ; i >= 0 ; i -- )	for ( int j = 0 ; j < m ; j ++ ) a[i][j] = a[i+1][j] + (s[i][j] == 'I') ;
	for ( int i = 0 ; i < n ; i ++ ) for ( int j = m-1 ; j >= 0 ; j -- ) b[i][j] = b[i][j+1] + (s[i][j] == 'O') ;
	for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < m ; j ++ ) if ( s[i][j] == 'J' ) ans += a[i][j]*b[i][j] ;
	cout << ans ;
}
 
signed main(){
    //ios ;
	int t = 1 ;
	//cin >> t ;
	while ( t -- ) solve() ;
}

Compilation message

joi2019_ho_t1.cpp: In function 'void fopn(std::string)':
joi2019_ho_t1.cpp:10:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:10:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3164 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 3416 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 1 ms 3164 KB Output is correct
11 Correct 1 ms 3164 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3164 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 3416 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 1 ms 3164 KB Output is correct
11 Correct 1 ms 3164 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 7 ms 16732 KB Output is correct
15 Correct 3 ms 12380 KB Output is correct
16 Correct 4 ms 9308 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 8 ms 17500 KB Output is correct
19 Correct 8 ms 17196 KB Output is correct
20 Correct 8 ms 15964 KB Output is correct
21 Correct 9 ms 17468 KB Output is correct
22 Correct 8 ms 17192 KB Output is correct
23 Correct 8 ms 15964 KB Output is correct
24 Correct 9 ms 17500 KB Output is correct
25 Correct 8 ms 17244 KB Output is correct
26 Correct 7 ms 15964 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3164 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 3416 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 1 ms 3164 KB Output is correct
11 Correct 1 ms 3164 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 7 ms 16732 KB Output is correct
15 Correct 3 ms 12380 KB Output is correct
16 Correct 4 ms 9308 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 8 ms 17500 KB Output is correct
19 Correct 8 ms 17196 KB Output is correct
20 Correct 8 ms 15964 KB Output is correct
21 Correct 9 ms 17468 KB Output is correct
22 Correct 8 ms 17192 KB Output is correct
23 Correct 8 ms 15964 KB Output is correct
24 Correct 9 ms 17500 KB Output is correct
25 Correct 8 ms 17244 KB Output is correct
26 Correct 7 ms 15964 KB Output is correct
27 Correct 221 ms 161616 KB Output is correct
28 Correct 10 ms 63832 KB Output is correct
29 Correct 16 ms 14940 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 161 ms 134376 KB Output is correct
32 Correct 197 ms 161612 KB Output is correct
33 Correct 186 ms 161460 KB Output is correct
34 Correct 178 ms 155708 KB Output is correct
35 Correct 195 ms 161816 KB Output is correct
36 Correct 189 ms 161364 KB Output is correct
37 Correct 214 ms 161688 KB Output is correct
38 Correct 136 ms 134248 KB Output is correct
39 Correct 134 ms 133716 KB Output is correct