Submission #160527

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
160527	2019-10-28T09:40:53 Z	dantoh000	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	92 ms	10232 KB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
int ct[3000];
int n,m;
string s[3000];
long long ans;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++){
        cin >> s[i];
    }
    for (int i = n-1; i >= 0; i--){
        for (int j = m-1, ct2 = 0; j >= 0; j--){
            if (s[i][j] == 'O') ct2++;
            else if (s[i][j] == 'I') ct[j]++;
            else ans += ct[j]*ct2;
        }
    }
    cout << ans;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	504 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	504 KB	Output is correct
13	Correct	3 ms	504 KB	Output is correct
14	Correct	4 ms	760 KB	Output is correct
15	Correct	5 ms	504 KB	Output is correct
16	Correct	4 ms	760 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	5 ms	760 KB	Output is correct
19	Correct	3 ms	768 KB	Output is correct
20	Correct	3 ms	760 KB	Output is correct
21	Correct	5 ms	760 KB	Output is correct
22	Correct	3 ms	760 KB	Output is correct
23	Correct	4 ms	760 KB	Output is correct
24	Correct	5 ms	760 KB	Output is correct
25	Correct	3 ms	760 KB	Output is correct
26	Correct	3 ms	760 KB	Output is correct

Subtask #3

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	504 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	504 KB	Output is correct
13	Correct	3 ms	504 KB	Output is correct
14	Correct	4 ms	760 KB	Output is correct
15	Correct	5 ms	504 KB	Output is correct
16	Correct	4 ms	760 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	5 ms	760 KB	Output is correct
19	Correct	3 ms	768 KB	Output is correct
20	Correct	3 ms	760 KB	Output is correct
21	Correct	5 ms	760 KB	Output is correct
22	Correct	3 ms	760 KB	Output is correct
23	Correct	4 ms	760 KB	Output is correct
24	Correct	5 ms	760 KB	Output is correct
25	Correct	3 ms	760 KB	Output is correct
26	Correct	3 ms	760 KB	Output is correct
27	Correct	90 ms	9692 KB	Output is correct
28	Correct	2 ms	504 KB	Output is correct
29	Correct	5 ms	1272 KB	Output is correct
30	Correct	2 ms	504 KB	Output is correct
31	Correct	67 ms	7160 KB	Output is correct
32	Correct	43 ms	10076 KB	Output is correct
33	Correct	37 ms	10232 KB	Output is correct
34	Correct	77 ms	8316 KB	Output is correct
35	Correct	40 ms	10232 KB	Output is correct
36	Correct	37 ms	10232 KB	Output is correct
37	Correct	92 ms	10232 KB	Output is correct
38	Correct	25 ms	7288 KB	Output is correct
39	Correct	26 ms	7160 KB	Output is correct