oj.uz

Submission #717231

# Submission time Handle Problem Language Result Execution time Memory
717231 2023-04-01T15:28:59 Z vjudge1 Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
 11 ms 7768 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 3001;

int m,n;
char s[N][N];
int ao[N][N],ai[N][N];
int ans;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> m >> n;
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++)
    {
        cin >> s[i][j];
        if(s[i][j]=='O') ao[i][j]++;
        else if(s[i][j]=='I') ai[i][j]++;
    }
    for(int i = m;i >= 1;i--) for(int j = n;j >= 1;j--) ao[i][j]+=ao[i][j+1],ai[i][j]+=ai[i+1][j];
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++) if(s[i][j]=='J') ans+=(long long)ao[i][j]*(long long)ai[i][j];
    cout << ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 9 ms 7252 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 5 ms 4180 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 11 ms 7768 KB Output is correct
19 Correct 8 ms 7636 KB Output is correct
20 Incorrect 8 ms 7636 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 1364 KB Output is correct
14 Correct 9 ms 7252 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 5 ms 4180 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 11 ms 7768 KB Output is correct
19 Correct 8 ms 7636 KB Output is correct
20 Incorrect 8 ms 7636 KB Output isn't correct
21 Halted 0 ms 0 KB -