Submission #399789

#	Time	Username	Problem	Language	Result	Execution time	Memory
399789		SavicS	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	227 ms	88704 KiB

joi2019_ho_t1

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 3005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n, m;
string s[maxn];

int rowO[maxn][maxn];
int colI[maxn][maxn];

int main()
{
   ios::sync_with_stdio(false);
   cout.tie(nullptr);
   cin.tie(nullptr);
   cin >> n >> m;
   ff(i,1,n)cin >> s[i], s[i] = ' ' + s[i];

   ff(i,1,n){
      ff(j,1,m){
         rowO[i][j] = rowO[i][j - 1] + (s[i][j] == 'O');
      }
   }

   ff(j,1,m){
      ff(i,1,n){
         colI[j][i] = colI[j][i - 1] + (s[i][j] == 'I');
      }
   }

   ll rez = 0;
   ff(i,1,n){
      ff(j,1,m){
         if(s[i][j] == 'J')rez += 1ll * (rowO[i][m] - rowO[i][j]) * (colI[j][n] - colI[j][i]);
      }
   }

   cout << rez << endl;

   return 0;
}
/**



// probati bojenje sahovski ili slicno

**/

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