# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
809079 | vjudge1 | Bitaro the Brave (JOI19_ho_t1) | C++17 | 1084 ms | 52684 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int h, w;
cin >> h >> w;
vector<vector<int>> J(h), O(h), I(w);
for (int i = 0; i < h; i++) {
string s;
cin >> s;
for (int j = 0; j < w; j++) {
if (s[j] == 'J') {
J[i].push_back(j);
} else if (s[j] == 'O') {
O[i].push_back(j);
} else {
I[j].push_back(i);
}
}
}
for (int i = 0; i < w; i++) {
sort(I[i].begin(), I[i].end());
}
long long ans = 0;
for (int i = 0; i < h; i++) {
for (int l = 0; l < O[i].size(); l++) { // Đổi j thành l ở đây
for (int j = 0; j < J[i].size(); j++) { // Đổi l thành j ở đây
if (O[i][l] > J[i][j]) {
int temp = I[J[i][j]].size();
int left = 0, right = I[J[i][j]].size() - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (I[J[i][j]][mid] > i) {
temp = mid;
right = mid - 1;
} else {
left = mid + 1;
}
}
ans += I[J[i][j]].size() - temp;
}
}
}
}
cout << ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |