#include <bits/stdc++.h>
using namespace std;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
const int inf = 2e9;
const int N = 3e3 + 15;
int n, m, a[N];
vector <int> O[N], I[N];
vector <pii> is;
ll ans;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen("input.txt", "r", stdin);
cin >> n >> m;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
char c;
cin >> c;
if(c == 'J')
is.pb(mp(i, j));
else if(c == 'O')
O[i].pb(j);
else
I[j].pb(i);
}
}
for(int i = 0; i < N; ++i) {
sort(O[i].begin(), O[i].end());
sort(I[i].begin(), I[i].end());
}
for(auto i : is) {
ll val1 = O[i.f].end() - upper_bound(O[i.f].begin(), O[i.f].end(), i.se);
ll val2 = I[i.se].end() - upper_bound(I[i.se].begin(), I[i.se].end(), i.f);
ans += val1 * val2;
}
cout << ans;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
512 KB |
Output is correct |
| 2 |
Correct |
2 ms |
512 KB |
Output is correct |
| 3 |
Correct |
3 ms |
512 KB |
Output is correct |
| 4 |
Correct |
2 ms |
512 KB |
Output is correct |
| 5 |
Correct |
3 ms |
640 KB |
Output is correct |
| 6 |
Correct |
3 ms |
512 KB |
Output is correct |
| 7 |
Correct |
3 ms |
512 KB |
Output is correct |
| 8 |
Correct |
3 ms |
640 KB |
Output is correct |
| 9 |
Correct |
3 ms |
512 KB |
Output is correct |
| 10 |
Correct |
3 ms |
512 KB |
Output is correct |
| 11 |
Correct |
3 ms |
512 KB |
Output is correct |
| 12 |
Correct |
3 ms |
512 KB |
Output is correct |
| 13 |
Correct |
3 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
512 KB |
Output is correct |
| 2 |
Correct |
2 ms |
512 KB |
Output is correct |
| 3 |
Correct |
3 ms |
512 KB |
Output is correct |
| 4 |
Correct |
2 ms |
512 KB |
Output is correct |
| 5 |
Correct |
3 ms |
640 KB |
Output is correct |
| 6 |
Correct |
3 ms |
512 KB |
Output is correct |
| 7 |
Correct |
3 ms |
512 KB |
Output is correct |
| 8 |
Correct |
3 ms |
640 KB |
Output is correct |
| 9 |
Correct |
3 ms |
512 KB |
Output is correct |
| 10 |
Correct |
3 ms |
512 KB |
Output is correct |
| 11 |
Correct |
3 ms |
512 KB |
Output is correct |
| 12 |
Correct |
3 ms |
512 KB |
Output is correct |
| 13 |
Correct |
3 ms |
512 KB |
Output is correct |
| 14 |
Correct |
14 ms |
2040 KB |
Output is correct |
| 15 |
Correct |
2 ms |
512 KB |
Output is correct |
| 16 |
Correct |
7 ms |
1532 KB |
Output is correct |
| 17 |
Correct |
3 ms |
512 KB |
Output is correct |
| 18 |
Correct |
19 ms |
2680 KB |
Output is correct |
| 19 |
Correct |
10 ms |
2172 KB |
Output is correct |
| 20 |
Correct |
9 ms |
2112 KB |
Output is correct |
| 21 |
Correct |
18 ms |
2680 KB |
Output is correct |
| 22 |
Correct |
12 ms |
2424 KB |
Output is correct |
| 23 |
Correct |
10 ms |
2112 KB |
Output is correct |
| 24 |
Correct |
19 ms |
2296 KB |
Output is correct |
| 25 |
Correct |
10 ms |
2172 KB |
Output is correct |
| 26 |
Correct |
9 ms |
2112 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
512 KB |
Output is correct |
| 2 |
Correct |
2 ms |
512 KB |
Output is correct |
| 3 |
Correct |
3 ms |
512 KB |
Output is correct |
| 4 |
Correct |
2 ms |
512 KB |
Output is correct |
| 5 |
Correct |
3 ms |
640 KB |
Output is correct |
| 6 |
Correct |
3 ms |
512 KB |
Output is correct |
| 7 |
Correct |
3 ms |
512 KB |
Output is correct |
| 8 |
Correct |
3 ms |
640 KB |
Output is correct |
| 9 |
Correct |
3 ms |
512 KB |
Output is correct |
| 10 |
Correct |
3 ms |
512 KB |
Output is correct |
| 11 |
Correct |
3 ms |
512 KB |
Output is correct |
| 12 |
Correct |
3 ms |
512 KB |
Output is correct |
| 13 |
Correct |
3 ms |
512 KB |
Output is correct |
| 14 |
Correct |
14 ms |
2040 KB |
Output is correct |
| 15 |
Correct |
2 ms |
512 KB |
Output is correct |
| 16 |
Correct |
7 ms |
1532 KB |
Output is correct |
| 17 |
Correct |
3 ms |
512 KB |
Output is correct |
| 18 |
Correct |
19 ms |
2680 KB |
Output is correct |
| 19 |
Correct |
10 ms |
2172 KB |
Output is correct |
| 20 |
Correct |
9 ms |
2112 KB |
Output is correct |
| 21 |
Correct |
18 ms |
2680 KB |
Output is correct |
| 22 |
Correct |
12 ms |
2424 KB |
Output is correct |
| 23 |
Correct |
10 ms |
2112 KB |
Output is correct |
| 24 |
Correct |
19 ms |
2296 KB |
Output is correct |
| 25 |
Correct |
10 ms |
2172 KB |
Output is correct |
| 26 |
Correct |
9 ms |
2112 KB |
Output is correct |
| 27 |
Correct |
799 ms |
62256 KB |
Output is correct |
| 28 |
Correct |
3 ms |
768 KB |
Output is correct |
| 29 |
Correct |
28 ms |
5616 KB |
Output is correct |
| 30 |
Correct |
4 ms |
640 KB |
Output is correct |
| 31 |
Correct |
541 ms |
44320 KB |
Output is correct |
| 32 |
Correct |
452 ms |
61136 KB |
Output is correct |
| 33 |
Correct |
417 ms |
64868 KB |
Output is correct |
| 34 |
Correct |
645 ms |
61412 KB |
Output is correct |
| 35 |
Correct |
539 ms |
65176 KB |
Output is correct |
| 36 |
Correct |
417 ms |
64864 KB |
Output is correct |
| 37 |
Correct |
875 ms |
75060 KB |
Output is correct |
| 38 |
Correct |
242 ms |
41808 KB |
Output is correct |
| 39 |
Correct |
288 ms |
49584 KB |
Output is correct |
