Submission #753075

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
753075	2023-06-04T14:21:27 Z	CdS	Bitaro the Brave (JOI19_ho_t1)	C++17	20 / 100	9 ms	3668 KB

joi2019_ho_t1

#include <bits/stdc++.h>

using namespace std;


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int h, w;

    cin >> h >> w;

    vector<pair<int, int>> joia;
    int orbes[h+1][w+1];
    int ingots[h+1][w+1];
    orbes[0][0] = 0;
    ingots[0][0] = 0;

    for (int i = 1; i <= h; i++)
    {
	for (int j = 1; j <= w; j++)
	{
	    char x;
	    cin >> x;
	    if (x == 'J') 
	    {
		joia.push_back({i, j});
	    }
	    orbes[i][j] = orbes[i][j-1];
	    if (x == 'O') 
	    {
		orbes[i][j] += 1;
	    }
	    ingots[i][j] = ingots[i-1][j];
	    if (x == 'I')
	    {
		ingots[i][j] += 1;
	    }
	}
    }

    int ans = 0;

    for (auto i : joia)
    {
	int a = orbes[i.first][w] - orbes[i.first][i.second];
	int b = ingots[h][i.second] - ingots[i.first][i.second];

	ans+=a*b;
    }

    cout << ans;

    return 0;
}

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	448 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	456 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	448 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	456 KB	Output is correct
14	Correct	9 ms	2648 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	5 ms	2008 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	9 ms	3668 KB	Output is correct
19	Correct	6 ms	2772 KB	Output is correct
20	Incorrect	6 ms	3540 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	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	448 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	456 KB	Output is correct
14	Correct	9 ms	2648 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	5 ms	2008 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	9 ms	3668 KB	Output is correct
19	Correct	6 ms	2772 KB	Output is correct
20	Incorrect	6 ms	3540 KB	Output isn't correct
21	Halted	0 ms	0 KB	-