Submission #465987

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
465987	2021-08-17T13:12:46 Z	Supersonic	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	20 ms	768 KB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
int main(){
    int h,w;cin>>h>>w;
    int o[h];int n[w];char g[h][w];
    memset(o,0,sizeof(o));memset(n,0,sizeof(n));
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            cin>>g[i][j];
            if(g[i][j]=='O')o[i]++;
            if(g[i][j]=='I')n[j]++;
        }
    }
    int t=0;
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            if(g[i][j]=='J')t+=o[i]*n[j];
            if(g[i][j]=='O')o[i]--;
            if(g[i][j]=='I')n[j]--;
        }
    }
    cout<<t<<endl;
    return 0;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	304 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	15 ms	588 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	11 ms	540 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	20 ms	716 KB	Output is correct
19	Correct	18 ms	756 KB	Output is correct
20	Incorrect	16 ms	768 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	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	304 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	15 ms	588 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	11 ms	540 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	20 ms	716 KB	Output is correct
19	Correct	18 ms	756 KB	Output is correct
20	Incorrect	16 ms	768 KB	Output isn't correct
21	Halted	0 ms	0 KB	-