oj.uz

Submission #399789

# Submission time Handle Problem Language Result Execution time Memory
399789 2021-05-06T15:39:01 Z SavicS Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 227 ms 88704 KB 
#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.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 2 ms 1228 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1228 KB Output is correct
8 Correct 2 ms 1228 KB Output is correct
9 Correct 1 ms 1188 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 2 ms 1228 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1228 KB Output is correct
8 Correct 2 ms 1228 KB Output is correct
9 Correct 1 ms 1188 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 6 ms 5836 KB Output is correct
15 Correct 2 ms 2124 KB Output is correct
16 Correct 5 ms 4656 KB Output is correct
17 Correct 2 ms 1612 KB Output is correct
18 Correct 8 ms 6824 KB Output is correct
19 Correct 7 ms 6604 KB Output is correct
20 Correct 7 ms 6800 KB Output is correct
21 Correct 8 ms 6860 KB Output is correct
22 Correct 7 ms 6692 KB Output is correct
23 Correct 7 ms 6732 KB Output is correct
24 Correct 8 ms 6860 KB Output is correct
25 Correct 7 ms 6708 KB Output is correct
26 Correct 7 ms 6736 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 2 ms 1228 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1228 KB Output is correct
8 Correct 2 ms 1228 KB Output is correct
9 Correct 1 ms 1188 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 6 ms 5836 KB Output is correct
15 Correct 2 ms 2124 KB Output is correct
16 Correct 5 ms 4656 KB Output is correct
17 Correct 2 ms 1612 KB Output is correct
18 Correct 8 ms 6824 KB Output is correct
19 Correct 7 ms 6604 KB Output is correct
20 Correct 7 ms 6800 KB Output is correct
21 Correct 8 ms 6860 KB Output is correct
22 Correct 7 ms 6692 KB Output is correct
23 Correct 7 ms 6732 KB Output is correct
24 Correct 8 ms 6860 KB Output is correct
25 Correct 7 ms 6708 KB Output is correct
26 Correct 7 ms 6736 KB Output is correct
27 Correct 178 ms 85696 KB Output is correct
28 Correct 7 ms 9932 KB Output is correct
29 Correct 19 ms 17228 KB Output is correct
30 Correct 7 ms 9804 KB Output is correct
31 Correct 133 ms 71448 KB Output is correct
32 Correct 151 ms 88296 KB Output is correct
33 Correct 164 ms 88564 KB Output is correct
34 Correct 157 ms 78144 KB Output is correct
35 Correct 183 ms 88272 KB Output is correct
36 Correct 186 ms 88524 KB Output is correct
37 Correct 227 ms 88704 KB Output is correct
38 Correct 111 ms 71184 KB Output is correct
39 Correct 128 ms 71296 KB Output is correct