oj.uz

답안 #895614

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
895614 2023-12-30T11:39:51 Z Andrey Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 332 ms 114900 KB 
#include<bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,m;
    cin >> n >> m;
    int haha[n][m];
    char p;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> p;
            if(p == 'J') {
                haha[i][j] = 0;
            }
            else if(p == 'O') {
                haha[i][j] = 1;
            }
            else {
                haha[i][j] = 2;
            }
        }
    }
    int br1[n][m];
    int br2[n][m];
    for(int i = 0; i < n; i++) {
        br1[i][m-1] = 0;
        if(haha[i][m-1] == 1) {
            br1[i][m-1]++;
        }
        for(int j = m-2; j >= 0; j--) {
            br1[i][j] = br1[i][j+1];
            if(haha[i][j] == 1) {
                br1[i][j]++;
            }
        }
    }
    for(int i = n-1; i >= 0; i--) {
        for(int j = 0; j < m; j++) {
            if(i == n-1) {
                br2[i][j] = 0;
            }
            else {
                br2[i][j] = br2[i+1][j];
            }
            if(haha[i][j] == 2) {
                br2[i][j]++;
            }
        }
    }
    long long ans = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(haha[i][j] == 0) {
                ans+=br1[i][j]*br2[i][j];
            }
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 10 ms 2668 KB Output is correct
15 Correct 0 ms 456 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 9 ms 3420 KB Output is correct
19 Correct 6 ms 3420 KB Output is correct
20 Correct 5 ms 3564 KB Output is correct
21 Correct 9 ms 3468 KB Output is correct
22 Correct 6 ms 3416 KB Output is correct
23 Correct 5 ms 3420 KB Output is correct
24 Correct 9 ms 3420 KB Output is correct
25 Correct 5 ms 3420 KB Output is correct
26 Correct 6 ms 3420 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 10 ms 2668 KB Output is correct
15 Correct 0 ms 456 KB Output is correct
16 Correct 3 ms 1884 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 9 ms 3420 KB Output is correct
19 Correct 6 ms 3420 KB Output is correct
20 Correct 5 ms 3564 KB Output is correct
21 Correct 9 ms 3468 KB Output is correct
22 Correct 6 ms 3416 KB Output is correct
23 Correct 5 ms 3420 KB Output is correct
24 Correct 9 ms 3420 KB Output is correct
25 Correct 5 ms 3420 KB Output is correct
26 Correct 6 ms 3420 KB Output is correct
27 Correct 316 ms 108428 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 13 ms 8472 KB Output is correct
30 Correct 1 ms 552 KB Output is correct
31 Correct 230 ms 79916 KB Output is correct
32 Correct 219 ms 113992 KB Output is correct
33 Correct 183 ms 114368 KB Output is correct
34 Correct 271 ms 92632 KB Output is correct
35 Correct 230 ms 114080 KB Output is correct
36 Correct 177 ms 114504 KB Output is correct
37 Correct 332 ms 114900 KB Output is correct
38 Correct 148 ms 79204 KB Output is correct
39 Correct 137 ms 79564 KB Output is correct