oj.uz

Submission #442689

# Submission time Handle Problem Language Result Execution time Memory
442689 2021-07-08T15:21:05 Z wind_reaper Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 339 ms 114788 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 *****************



//***************** 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] = 1;
			if(x == 'I') grid[i][j] = 2;
			if(x == 'O') grid[i][j] = 3;
		}
	}

	int orb[H][W], ingot[H][W];
	memset(orb, 0, sizeof orb);
	memset(ingot, 0, sizeof ingot);

	int64_t ans = 0;
	
	for(int i = H - 1; i >= 0; --i){
		for(int j = W - 1; j >= 0; --j){
			orb[i][j] = (grid[i][j] == 3);
			ingot[i][j] = (grid[i][j] == 2);
			if(j < W - 1) orb[i][j] += orb[i][j+1];
			if(i < H - 1) ingot[i][j] += ingot[i+1][j];

			if(grid[i][j] == 1)
				ans += orb[i][j] * 1LL * ingot[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
*/

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 8 ms 2636 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 1868 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 10 ms 3448 KB Output is correct
19 Correct 9 ms 3276 KB Output is correct
20 Correct 7 ms 3332 KB Output is correct
21 Correct 10 ms 3488 KB Output is correct
22 Correct 8 ms 3276 KB Output is correct
23 Correct 7 ms 3404 KB Output is correct
24 Correct 10 ms 3368 KB Output is correct
25 Correct 7 ms 3276 KB Output is correct
26 Correct 6 ms 3404 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 8 ms 2636 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 1868 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 10 ms 3448 KB Output is correct
19 Correct 9 ms 3276 KB Output is correct
20 Correct 7 ms 3332 KB Output is correct
21 Correct 10 ms 3488 KB Output is correct
22 Correct 8 ms 3276 KB Output is correct
23 Correct 7 ms 3404 KB Output is correct
24 Correct 10 ms 3368 KB Output is correct
25 Correct 7 ms 3276 KB Output is correct
26 Correct 6 ms 3404 KB Output is correct
27 Correct 326 ms 108292 KB Output is correct
28 Correct 1 ms 588 KB Output is correct
29 Correct 17 ms 8476 KB Output is correct
30 Correct 1 ms 588 KB Output is correct
31 Correct 238 ms 79776 KB Output is correct
32 Correct 261 ms 113884 KB Output is correct
33 Correct 233 ms 114384 KB Output is correct
34 Correct 271 ms 92408 KB Output is correct
35 Correct 279 ms 113984 KB Output is correct
36 Correct 228 ms 114368 KB Output is correct
37 Correct 339 ms 114788 KB Output is correct
38 Correct 172 ms 79076 KB Output is correct
39 Correct 156 ms 79428 KB Output is correct