oj.uz

Submission #945071

# Submission time Handle Problem Language Result Execution time Memory
945071 2024-03-13T11:24:48 Z TitanicXDzz Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
 9 ms 15600 KB 
#include<bits/stdc++.h>
using namespace std;
string s[3010];
int oo[3010][3010];
int ii[3010][3010];
int main(){
  int n;
  int m;
  int sumi=0;
  cin>>n>>m;
  for(int i=0;i<n;i++){
    cin>>s[i];
  }
  for(int i=0;i<n;i++){
    for(int j=0;j<m;j++){
        if(i==0)
          ii[i][j]=0;
        if(j==0)
          oo[i][j]=0;
        if(s[i][j]=='O')
            oo[i][j]=oo[i][j-1]+1;
        else
            oo[i][j]=oo[i][j-1];
        if(s[i][j]=='I')
            ii[i][j]=ii[i-1][j]+1;
        else
            ii[i][j]=ii[i-1][j];
    }
  }
  for(int i=0;i<n;i++){
    for(int j=0;j<m;j++){
        if(s[i][j]=='J'){
            sumi+=(ii[n-1][j]-ii[i][j])*(oo[i][m-1]-oo[i][j]);
        }
    }
  }
  cout<<sumi;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4696 KB Output is correct
12 Correct 1 ms 4696 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 9 ms 15192 KB Output is correct
15 Correct 2 ms 13144 KB Output is correct
16 Correct 4 ms 9052 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 8 ms 15600 KB Output is correct
19 Correct 6 ms 15452 KB Output is correct
20 Incorrect 7 ms 15452 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4696 KB Output is correct
12 Correct 1 ms 4696 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 9 ms 15192 KB Output is correct
15 Correct 2 ms 13144 KB Output is correct
16 Correct 4 ms 9052 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 8 ms 15600 KB Output is correct
19 Correct 6 ms 15452 KB Output is correct
20 Incorrect 7 ms 15452 KB Output isn't correct
21 Halted 0 ms 0 KB -