| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1258766 | nuggetbrain007 | Bitaro the Brave (JOI19_ho_t1) | C++20 | 0 ms | 328 KiB |
#include<bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> v(h);
for (int i = 0; i < h; i++) {
cin >> v[i];
}
vector<int> v1(h, 0);
vector<int> v2(w, 0);
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (v[i][j] == 'O') {
v1[i]++;
} else if (v[i][j] == 'I') {
v2[j]++;
}
}
}
long long sum = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (v[i][j] == 'J') {
sum += (long long)v1[i] * v2[j];
}
}
}
cout << sum;
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
