Submission #1075274

# Submission time Handle Problem Language Result Execution time Memory
1075274 2024-08-25T23:21:32 Z quangminh412 Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
5 ms 9564 KB
#include <bits/stdc++.h>
using namespace std;

/*
  John Watson
  https://codeforces.com/profile/quangminh98

  Mua Code nhu mua Florentino !!
*/

#define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long

const int maxn = 3009;

int preO[maxn][maxn], preI[maxn][maxn];
char a[maxn][maxn];
int H, W;

signed main()
{
	if (fopen("test.inp", "r"))
	{
		freopen("test.inp", "r", stdin);
		freopen("test.out", "w", stdout);
	}
	faster();

	cin >> H >> W;
	for (int i = 1; i <= H; i++)
		for (int j = 1; j <= W; j++)
		{
			cin >> a[i][j];
			
			preO[i][j] = preO[i][j - 1] + (a[i][j] == 'O');
			preI[i][j] = preI[i - 1][j] + (a[i][j] == 'I');  
		}

	int res = 0;
	for (int i = 1; i <= H; i++)
		for (int j = 1; j <= W; j++)
			if (a[i][j] == 'J')
				res += (preO[i][W] - preO[i][j]) * (preI[H][j] - preI[i][j]);

	cout << res << '\n';

	return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:24:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   freopen("test.inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:25:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |   freopen("test.out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3464 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3464 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct
14 Correct 5 ms 8028 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 3 ms 5676 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 5 ms 9564 KB Output is correct
19 Correct 5 ms 8540 KB Output is correct
20 Incorrect 5 ms 9564 KB Output isn't correct
21 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3464 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct
14 Correct 5 ms 8028 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 3 ms 5676 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 5 ms 9564 KB Output is correct
19 Correct 5 ms 8540 KB Output is correct
20 Incorrect 5 ms 9564 KB Output isn't correct
21 Halted 0 ms 0 KB -