oj.uz

Submission #702247

# Submission time Handle Problem Language Result Execution time Memory
702247 2023-02-23T11:22:48 Z vjudge1 Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 165 ms 159204 KB 
#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

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

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 448 KB Output is correct
13 Correct 1 ms 460 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 448 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 4 ms 3712 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 2612 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 5 ms 4680 KB Output is correct
19 Correct 4 ms 4564 KB Output is correct
20 Correct 4 ms 4692 KB Output is correct
21 Correct 5 ms 4692 KB Output is correct
22 Correct 5 ms 4544 KB Output is correct
23 Correct 4 ms 4692 KB Output is correct
24 Correct 6 ms 4692 KB Output is correct
25 Correct 4 ms 4560 KB Output is correct
26 Correct 4 ms 4692 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 448 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 4 ms 3712 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 2612 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 5 ms 4680 KB Output is correct
19 Correct 4 ms 4564 KB Output is correct
20 Correct 4 ms 4692 KB Output is correct
21 Correct 5 ms 4692 KB Output is correct
22 Correct 5 ms 4544 KB Output is correct
23 Correct 4 ms 4692 KB Output is correct
24 Correct 6 ms 4692 KB Output is correct
25 Correct 4 ms 4560 KB Output is correct
26 Correct 4 ms 4692 KB Output is correct
27 Correct 156 ms 150496 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 11 ms 11808 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 109 ms 110640 KB Output is correct
32 Correct 127 ms 158132 KB Output is correct
33 Correct 134 ms 158672 KB Output is correct
34 Correct 123 ms 128280 KB Output is correct
35 Correct 131 ms 158108 KB Output is correct
36 Correct 136 ms 158548 KB Output is correct
37 Correct 165 ms 159204 KB Output is correct
38 Correct 103 ms 109728 KB Output is correct
39 Correct 89 ms 110132 KB Output is correct