# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
162705 | 2019-11-09T12:04:17 Z | NachoLibre | Bitaro the Brave (JOI19_ho_t1) | C++14 | 391 ms | 114516 KB |
#include <bits/stdc++.h> using namespace std; unsigned int n, m, d[3003][3003][3], fp; char a; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for(int i = 1; i <= n; ++i) { for(int j = 1; j <= m; ++j) { cin >> a; if(a == 'J') d[i][j][0] = 1; else if(a == 'O') d[i][j][1] = 1; else d[i][j][2] = 1; } } for(int i = n; i; --i) { for(int j = m; j; --j) { d[i][j][1] += d[i][j + 1][1]; d[i][j][2] += d[i + 1][j][2]; } } for(int i = 1; i <= n; ++i) { for(int j = 1; j <= m; ++j) { if(d[i][j][0]) { fp += d[i][j][1] * d[i][j][2]; } } } cout << fp << endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 3 ms | 888 KB | Output is correct |
6 | Correct | 2 ms | 888 KB | Output is correct |
7 | Correct | 2 ms | 888 KB | Output is correct |
8 | Correct | 3 ms | 888 KB | Output is correct |
9 | Correct | 3 ms | 888 KB | Output is correct |
10 | Correct | 2 ms | 760 KB | Output is correct |
11 | Correct | 3 ms | 888 KB | Output is correct |
12 | Correct | 2 ms | 888 KB | Output is correct |
13 | Correct | 2 ms | 888 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 3 ms | 888 KB | Output is correct |
6 | Correct | 2 ms | 888 KB | Output is correct |
7 | Correct | 2 ms | 888 KB | Output is correct |
8 | Correct | 3 ms | 888 KB | Output is correct |
9 | Correct | 3 ms | 888 KB | Output is correct |
10 | Correct | 2 ms | 760 KB | Output is correct |
11 | Correct | 3 ms | 888 KB | Output is correct |
12 | Correct | 2 ms | 888 KB | Output is correct |
13 | Correct | 2 ms | 888 KB | Output is correct |
14 | Correct | 12 ms | 4600 KB | Output is correct |
15 | Correct | 4 ms | 2168 KB | Output is correct |
16 | Correct | 7 ms | 2936 KB | Output is correct |
17 | Correct | 2 ms | 380 KB | Output is correct |
18 | Correct | 15 ms | 5368 KB | Output is correct |
19 | Correct | 11 ms | 5240 KB | Output is correct |
20 | Correct | 11 ms | 5240 KB | Output is correct |
21 | Correct | 15 ms | 5624 KB | Output is correct |
22 | Correct | 11 ms | 5368 KB | Output is correct |
23 | Correct | 11 ms | 5368 KB | Output is correct |
24 | Correct | 15 ms | 5624 KB | Output is correct |
25 | Correct | 12 ms | 5496 KB | Output is correct |
26 | Correct | 12 ms | 5448 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 3 ms | 888 KB | Output is correct |
6 | Correct | 2 ms | 888 KB | Output is correct |
7 | Correct | 2 ms | 888 KB | Output is correct |
8 | Correct | 3 ms | 888 KB | Output is correct |
9 | Correct | 3 ms | 888 KB | Output is correct |
10 | Correct | 2 ms | 760 KB | Output is correct |
11 | Correct | 3 ms | 888 KB | Output is correct |
12 | Correct | 2 ms | 888 KB | Output is correct |
13 | Correct | 2 ms | 888 KB | Output is correct |
14 | Correct | 12 ms | 4600 KB | Output is correct |
15 | Correct | 4 ms | 2168 KB | Output is correct |
16 | Correct | 7 ms | 2936 KB | Output is correct |
17 | Correct | 2 ms | 380 KB | Output is correct |
18 | Correct | 15 ms | 5368 KB | Output is correct |
19 | Correct | 11 ms | 5240 KB | Output is correct |
20 | Correct | 11 ms | 5240 KB | Output is correct |
21 | Correct | 15 ms | 5624 KB | Output is correct |
22 | Correct | 11 ms | 5368 KB | Output is correct |
23 | Correct | 11 ms | 5368 KB | Output is correct |
24 | Correct | 15 ms | 5624 KB | Output is correct |
25 | Correct | 12 ms | 5496 KB | Output is correct |
26 | Correct | 12 ms | 5448 KB | Output is correct |
27 | Incorrect | 391 ms | 114516 KB | Output isn't correct |
28 | Halted | 0 ms | 0 KB | - |