oj.uz

Submission #820596

# Submission time Handle Problem Language Result Execution time Memory
820596 2023-08-11T04:56:42 Z flash Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 408 ms 114772 KB 
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
*/

using namespace std;
// using namespace __gnu_pbds;
using namespace chrono;

// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
*/

//***************** CONSTANTS *****************

const int MXN = 2e5;
const int mod = 1000000007;

//***************** GLOBAL VARIABLES *****************



//***************** AUXILIARY STRUCTS *****************



//***************** MAIN BODY *****************

void solve(){
	int H, W;
	cin >> H >> W;

	int grid[H][W];

	for(int i = 0; i < H; i++)
		for(int j = 0; j < W; j++){
			char x;
			cin >> x;

			if(x == 'J') grid[i][j] = 2;
			if(x == 'O') grid[i][j] = 0;
			if(x == 'I') grid[i][j] = 1;
		}

	int orbs[H][W];
	for(int i = 0; i < H; i++){
		orbs[i][W - 1] = (grid[i][W - 1] == 0 ? 1 : 0);
		for(int j = W - 2; j >= 0; --j){
			orbs[i][j] = orbs[i][j + 1] + (grid[i][j] == 0 ? 1 : 0); 
		}
	}

	int ingots[H][W];
	for(int j = 0; j < W; j++){
		ingots[H - 1][j] = (grid[H - 1][j] == 1 ? 1 : 0);
		for(int i = H - 2; i >= 0; --i){
			ingots[i][j] = ingots[i + 1][j] + (grid[i][j] == 1 ? 1 : 0);
		}
	}

	int64_t ans = 0;

	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			if(grid[i][j] != 2)
				continue;

			ans += orbs[i][j] * 1LL * ingots[i][j];
		}
	}

	cout << ans << '\n';
}

//***************** *****************

int32_t main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);

	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

	int tc = 1;
	// cin >> tc; 
	for (int t = 0; t < tc; t++)
		solve()
;
	#ifdef LOCAL 
		auto end = high_resolution_clock::now();
		cout << fixed << setprecision(4);
		cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
	#endif

	return 0;
}

/*
If code gives a WA, check for the following : 
1. I/O format

2. Are you clearing all global variables in between tests if multitests are a thing

3. Can you definitively prove the logic
*/

/*
JO
I
*/

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 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 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 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct

Subtask #2
30.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 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 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 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 7 ms 2644 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 1876 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 8 ms 3404 KB Output is correct
19 Correct 5 ms 3284 KB Output is correct
20 Correct 5 ms 3412 KB Output is correct
21 Correct 8 ms 3412 KB Output is correct
22 Correct 5 ms 3284 KB Output is correct
23 Correct 5 ms 3540 KB Output is correct
24 Correct 9 ms 3412 KB Output is correct
25 Correct 5 ms 3284 KB Output is correct
26 Correct 5 ms 3396 KB Output is correct

Subtask #3
50.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 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 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 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 7 ms 2644 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 1876 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 8 ms 3404 KB Output is correct
19 Correct 5 ms 3284 KB Output is correct
20 Correct 5 ms 3412 KB Output is correct
21 Correct 8 ms 3412 KB Output is correct
22 Correct 5 ms 3284 KB Output is correct
23 Correct 5 ms 3540 KB Output is correct
24 Correct 9 ms 3412 KB Output is correct
25 Correct 5 ms 3284 KB Output is correct
26 Correct 5 ms 3396 KB Output is correct
27 Correct 399 ms 108396 KB Output is correct
28 Correct 1 ms 568 KB Output is correct
29 Correct 17 ms 8448 KB Output is correct
30 Correct 1 ms 584 KB Output is correct
31 Correct 275 ms 79784 KB Output is correct
32 Correct 308 ms 114000 KB Output is correct
33 Correct 295 ms 114384 KB Output is correct
34 Correct 329 ms 92504 KB Output is correct
35 Correct 340 ms 113996 KB Output is correct
36 Correct 297 ms 114380 KB Output is correct
37 Correct 408 ms 114772 KB Output is correct
38 Correct 213 ms 79056 KB Output is correct
39 Correct 199 ms 79468 KB Output is correct