Submission #702250

#	Time	Username	Problem	Language	Result	Execution time	Memory
702250		epicci23	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	159 ms	150404 KiB

joi2019_ho_t1

#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define MOD 1000000007
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/

template<typename T>
inline T in()
{
  T x;
  cin >> x;
  return x;
}


void solve()
{
  int n=in<int>(),m=in<int>();
  vector<string> v;
  for(int i=0;i<n;i++)
  {
    string s=in<string>();
    v.pb(s);
  }

  int dp[n+2][m+2];
  int dp2[n+2][m+2];
  memset(dp,0,sizeof(dp));
  memset(dp2,0,sizeof(dp2));

  for(int i=1;i<=n;i++)
  {
    for(int j=m;j>=1;j--) 
      {
        //cout << v[i-1][j-1] << " ";
        dp[i][j] = dp[i][j+1] + (v[i-1][j-1]=='O');
        //cout << dp[i][j] <<  " ";
      }
      //cout << endl;
  }
  
  for(int i=n;i>=1;i--)
  {
    for(int j=m;j>=1;j--) dp2[i][j]=dp2[i+1][j] + (v[i-1][j-1]=='I');
  }

  int ans=0;

  for(int i=1;i<=n;i++)
  {
    for(int j=1;j<=m;j++) 
    {
      //cout << dp[i][j] <<  " ";
      ans+=(v[i-1][j-1]=='J' ? dp[i][j]*dp2[i][j] : 0);
    }
    //cout << endl;
  }

  cout << ans << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//t=in();
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message (stderr)

joi2019_ho_t1.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

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