Submission #172049

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
172049	2019-12-30T23:16:43 Z	mdn2002	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	17 ms	8056 KB

joi2019_ho_t1

#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
int n,m,ans,orb[3050][3050],ing[3050][3050];
char c[3050][3050];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>m;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            cin>>c[i][j];
            if(c[i][j]=='I')ing[i][j]++;
            else if(c[i][j]=='O') orb[i][j]++;
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int j=m-1;j>=0;j--)orb[i][j]+=orb[i][j+1];
    }
    for(int i=0;i<m;i++)
    {
        for(int j=n-1;j>=0;j--)ing[j][i]+=ing[j+1][i];
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(c[i][j]=='J')ans+=ing[i][j]*orb[i][j];
        }
    }
    cout<<ans;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	380 KB	Output is correct
4	Correct	2 ms	504 KB	Output is correct
5	Correct	3 ms	1528 KB	Output is correct
6	Correct	3 ms	1528 KB	Output is correct
7	Correct	3 ms	1404 KB	Output is correct
8	Correct	3 ms	1528 KB	Output is correct
9	Correct	3 ms	1528 KB	Output is correct
10	Correct	3 ms	1400 KB	Output is correct
11	Correct	3 ms	1528 KB	Output is correct
12	Correct	3 ms	1528 KB	Output is correct
13	Correct	3 ms	1400 KB	Output is correct
14	Correct	14 ms	7544 KB	Output is correct
15	Correct	5 ms	4984 KB	Output is correct
16	Correct	8 ms	4344 KB	Output is correct
17	Correct	2 ms	504 KB	Output is correct
18	Correct	17 ms	8000 KB	Output is correct
19	Correct	13 ms	8056 KB	Output is correct
20	Incorrect	13 ms	7928 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	380 KB	Output is correct
4	Correct	2 ms	504 KB	Output is correct
5	Correct	3 ms	1528 KB	Output is correct
6	Correct	3 ms	1528 KB	Output is correct
7	Correct	3 ms	1404 KB	Output is correct
8	Correct	3 ms	1528 KB	Output is correct
9	Correct	3 ms	1528 KB	Output is correct
10	Correct	3 ms	1400 KB	Output is correct
11	Correct	3 ms	1528 KB	Output is correct
12	Correct	3 ms	1528 KB	Output is correct
13	Correct	3 ms	1400 KB	Output is correct
14	Correct	14 ms	7544 KB	Output is correct
15	Correct	5 ms	4984 KB	Output is correct
16	Correct	8 ms	4344 KB	Output is correct
17	Correct	2 ms	504 KB	Output is correct
18	Correct	17 ms	8000 KB	Output is correct
19	Correct	13 ms	8056 KB	Output is correct
20	Incorrect	13 ms	7928 KB	Output isn't correct
21	Halted	0 ms	0 KB	-