Submission #720004

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
720004	2023-04-07T08:35:33 Z	vjudge1	Bitaro the Brave (JOI19_ho_t1)	C++17	50 / 100	278 ms	149800 KB

joi2019_ho_t1

#include<bits/stdc++.h>
#define ll unsigned long long
using namespace std;

const int N=3001;
int n,m;
ll cnt;
string mp[N],s;
ll I[N][N],O[N][N];

int main(){
  ios_base::sync_with_stdio(0),cin.tie(0);
  cin >> n >> m;
  for(int i=1; i<=n; i++){
    cin >> s;
    mp[i]="x"+s;
  }
  for(int i=1; i<=n; i++){
    for(int j=m; j>=1; j--){
      O[i][j]+=O[i][j+1];
      if(mp[i][j]=='O')O[i][j]++;
    }
  }
  for(int j=1; j<=m; j++){
    for(int i=n; i>=1; i--){
      I[i][j]+=I[i+1][j];
      if(mp[i][j]=='I')I[i][j]++;
    }
  }
  for(int i=1; i<=n; i++){
    for(int j=1; j<=m; j++){
      if(mp[i][j]=='J')cnt+=I[i][j]*O[i][j];
    }
  }
  cout << cnt;

  return 0;
}

/*
J--O
| /
I
*/

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	1 ms	340 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	2 ms	1364 KB	Output is correct
6	Correct	1 ms	1364 KB	Output is correct
7	Correct	1 ms	1236 KB	Output is correct
8	Correct	1 ms	1364 KB	Output is correct
9	Correct	1 ms	1364 KB	Output is correct
10	Correct	1 ms	1236 KB	Output is correct
11	Correct	1 ms	1364 KB	Output is correct
12	Correct	1 ms	1364 KB	Output is correct
13	Correct	1 ms	1236 KB	Output is correct

Subtask #2

30.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	1 ms	340 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	2 ms	1364 KB	Output is correct
6	Correct	1 ms	1364 KB	Output is correct
7	Correct	1 ms	1236 KB	Output is correct
8	Correct	1 ms	1364 KB	Output is correct
9	Correct	1 ms	1364 KB	Output is correct
10	Correct	1 ms	1236 KB	Output is correct
11	Correct	1 ms	1364 KB	Output is correct
12	Correct	1 ms	1364 KB	Output is correct
13	Correct	1 ms	1236 KB	Output is correct
14	Correct	7 ms	7636 KB	Output is correct
15	Correct	2 ms	3796 KB	Output is correct
16	Correct	6 ms	4564 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	10 ms	8544 KB	Output is correct
19	Correct	7 ms	8404 KB	Output is correct
20	Correct	7 ms	8404 KB	Output is correct
21	Correct	10 ms	8532 KB	Output is correct
22	Correct	8 ms	8532 KB	Output is correct
23	Correct	8 ms	8404 KB	Output is correct
24	Correct	12 ms	8532 KB	Output is correct
25	Correct	7 ms	8404 KB	Output is correct
26	Correct	7 ms	8368 KB	Output is correct

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	1 ms	340 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	2 ms	1364 KB	Output is correct
6	Correct	1 ms	1364 KB	Output is correct
7	Correct	1 ms	1236 KB	Output is correct
8	Correct	1 ms	1364 KB	Output is correct
9	Correct	1 ms	1364 KB	Output is correct
10	Correct	1 ms	1236 KB	Output is correct
11	Correct	1 ms	1364 KB	Output is correct
12	Correct	1 ms	1364 KB	Output is correct
13	Correct	1 ms	1236 KB	Output is correct
14	Correct	7 ms	7636 KB	Output is correct
15	Correct	2 ms	3796 KB	Output is correct
16	Correct	6 ms	4564 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	10 ms	8544 KB	Output is correct
19	Correct	7 ms	8404 KB	Output is correct
20	Correct	7 ms	8404 KB	Output is correct
21	Correct	10 ms	8532 KB	Output is correct
22	Correct	8 ms	8532 KB	Output is correct
23	Correct	8 ms	8404 KB	Output is correct
24	Correct	12 ms	8532 KB	Output is correct
25	Correct	7 ms	8404 KB	Output is correct
26	Correct	7 ms	8368 KB	Output is correct
27	Incorrect	278 ms	149800 KB	Output isn't correct
28	Halted	0 ms	0 KB	-