oj.uz

Submission #391392

# Submission time Handle Problem Language Result Execution time Memory
391392 2021-04-18T16:50:20 Z lukameladze Bitaro the Brave (JOI19_ho_t1) C++14
50 / 100
 558 ms 39788 KB 
# include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
using namespace std;
const int N=1005;
long long n,m,ans,sf1[N][N],sf[N][N];
char ch[N][N];
int main() {
     cin>>n>>m;
     for(int i=1; i<=n; i++) {
          for (int j=1; j<=m; j++) {
               cin>>ch[i][j];
          }
     }
     for (int i=1; i<=n; i++) {
          for (int j=m; j>=1; j--) {
               sf[i][j]=sf[i][j+1]+(ch[i][j]=='O');
          }
     }
     for (int j=1; j<=m; j++) {
          for (int i=n; i>=1; i--) {
               sf1[i][j]=sf1[i+1][j]+(ch[i][j]=='I');
          }
     }
     for (int i=1; i<=n; i++) {
          for (int j=1; j<=m; j++) {
               if (ch[i][j]!='J') continue;
               ans+=sf[i][j+1]*sf1[i+1][j];
          }
     }
     cout<<ans<<endl;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 1356 KB Output is correct
6 Correct 2 ms 1228 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 2 ms 1356 KB Output is correct
9 Correct 2 ms 1228 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 2 ms 1356 KB Output is correct
12 Correct 2 ms 1228 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 1356 KB Output is correct
6 Correct 2 ms 1228 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 2 ms 1356 KB Output is correct
9 Correct 2 ms 1228 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 2 ms 1356 KB Output is correct
12 Correct 2 ms 1228 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 19 ms 7896 KB Output is correct
15 Correct 3 ms 4276 KB Output is correct
16 Correct 13 ms 4716 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 22 ms 8908 KB Output is correct
19 Correct 21 ms 8692 KB Output is correct
20 Correct 22 ms 8644 KB Output is correct
21 Correct 23 ms 8908 KB Output is correct
22 Correct 23 ms 8744 KB Output is correct
23 Correct 23 ms 8652 KB Output is correct
24 Correct 26 ms 8880 KB Output is correct
25 Correct 21 ms 8780 KB Output is correct
26 Correct 22 ms 8744 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 1356 KB Output is correct
6 Correct 2 ms 1228 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 2 ms 1356 KB Output is correct
9 Correct 2 ms 1228 KB Output is correct
10 Correct 2 ms 1228 KB Output is correct
11 Correct 2 ms 1356 KB Output is correct
12 Correct 2 ms 1228 KB Output is correct
13 Correct 2 ms 1228 KB Output is correct
14 Correct 19 ms 7896 KB Output is correct
15 Correct 3 ms 4276 KB Output is correct
16 Correct 13 ms 4716 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 22 ms 8908 KB Output is correct
19 Correct 21 ms 8692 KB Output is correct
20 Correct 22 ms 8644 KB Output is correct
21 Correct 23 ms 8908 KB Output is correct
22 Correct 23 ms 8744 KB Output is correct
23 Correct 23 ms 8652 KB Output is correct
24 Correct 26 ms 8880 KB Output is correct
25 Correct 21 ms 8780 KB Output is correct
26 Correct 22 ms 8744 KB Output is correct
27 Runtime error 558 ms 39788 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -