oj.uz

답안 #114792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
114792 2019-06-02T19:17:05 Z andreiomd Bitaro the Brave (JOI19_ho_t1) C++11
100 / 100
 138 ms 88760 KB 
#include <iostream>

using namespace std;

const int NMAX = 3e3 + 5;

int N, M;

char A[NMAX][NMAX];

int O[NMAX][NMAX], I[NMAX][NMAX];

long long ans = 0;

inline void Read ()
{
    ios_base :: sync_with_stdio(false);

    cin.tie(NULL);

    cin>>N>>M;

    for(int i = 1; i <= N; ++i)
        cin>>(A[i] + 1);

    return;
}

inline void Precalculation ()
{
    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= M; ++j)
        {
            O[i][j] = O[i-1][j] + O[i][j-1] - O[i-1][j-1] + (A[i][j] == 'O');

            I[i][j] = I[i-1][j] + I[i][j-1] - I[i-1][j-1] + (A[i][j] == 'I');
        }

    return;
}

inline int Query1 (int X1, int Y1, int X2, int Y2)
{
    return O[X2][Y2] - O[X2][Y1-1] - (O[X1-1][Y2] - O[X1-1][Y1-1]);
}

inline int Query2 (int X1, int Y1, int X2, int Y2)
{
    return I[X2][Y2] - I[X2][Y1-1] - (I[X1-1][Y2] - I[X1-1][Y1-1]);
}

int main()
{
    Read();

    Precalculation();

    for(int i = 1; i < N; ++i)
        for(int j = 1; j < M; ++j)
            if(A[i][j] == 'J')
            {
                long long p1 = Query1(i, j + 1, i, M);

                long long p2 = Query2(i + 1, j, N, j);

                ans += 1LL * p1 * p2;
            }

    cout<<ans<<'\n';

    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 1536 KB Output is correct
6 Correct 3 ms 1536 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 3 ms 1536 KB Output is correct
9 Correct 3 ms 1536 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 3 ms 1536 KB Output is correct
12 Correct 3 ms 1536 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 1536 KB Output is correct
6 Correct 3 ms 1536 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 3 ms 1536 KB Output is correct
9 Correct 3 ms 1536 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 3 ms 1536 KB Output is correct
12 Correct 3 ms 1536 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct
14 Correct 10 ms 7552 KB Output is correct
15 Correct 6 ms 4992 KB Output is correct
16 Correct 6 ms 4352 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 11 ms 8064 KB Output is correct
19 Correct 10 ms 7936 KB Output is correct
20 Correct 10 ms 7936 KB Output is correct
21 Correct 13 ms 8064 KB Output is correct
22 Correct 10 ms 7936 KB Output is correct
23 Correct 10 ms 7936 KB Output is correct
24 Correct 11 ms 8064 KB Output is correct
25 Correct 10 ms 7936 KB Output is correct
26 Correct 11 ms 7936 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 1536 KB Output is correct
6 Correct 3 ms 1536 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 3 ms 1536 KB Output is correct
9 Correct 3 ms 1536 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 3 ms 1536 KB Output is correct
12 Correct 3 ms 1536 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct
14 Correct 10 ms 7552 KB Output is correct
15 Correct 6 ms 4992 KB Output is correct
16 Correct 6 ms 4352 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 11 ms 8064 KB Output is correct
19 Correct 10 ms 7936 KB Output is correct
20 Correct 10 ms 7936 KB Output is correct
21 Correct 13 ms 8064 KB Output is correct
22 Correct 10 ms 7936 KB Output is correct
23 Correct 10 ms 7936 KB Output is correct
24 Correct 11 ms 8064 KB Output is correct
25 Correct 10 ms 7936 KB Output is correct
26 Correct 11 ms 7936 KB Output is correct
27 Correct 130 ms 88056 KB Output is correct
28 Correct 26 ms 26112 KB Output is correct
29 Correct 11 ms 7808 KB Output is correct
30 Correct 3 ms 640 KB Output is correct
31 Correct 108 ms 72572 KB Output is correct
32 Correct 114 ms 88760 KB Output is correct
33 Correct 110 ms 88260 KB Output is correct
34 Correct 120 ms 84088 KB Output is correct
35 Correct 107 ms 88568 KB Output is correct
36 Correct 104 ms 88200 KB Output is correct
37 Correct 138 ms 88572 KB Output is correct
38 Correct 90 ms 72580 KB Output is correct
39 Correct 82 ms 72312 KB Output is correct