oj.uz

Submission #676475

# Submission time Handle Problem Language Result Execution time Memory
676475 2022-12-31T03:34:30 Z penguin133 Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 38 ms 9580 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
	int r,c,d,k;
	cin >> r >> c >> d >> k;
	char g[r+1][c+1];
	int prefix[r+1][c+1];
	int a[r+1][c+1];
	for(int i=1;i<=r;i++){
		for(int j=1;j<=c;j++){
			cin >> g[i][j];
			a[i][j] = 0;
			if(g[i][j] == 'S'){
				a[i][j]++;
			}
		}
	}
	for (int i = 1; i <= r; ++i){
		for (int j = 1; j <= c; ++j){
			prefix[i][j] = 	prefix[i-1][j] + prefix[i][j-1] - prefix[i-1][j-1] + a[i][j];
		}
	}
	int cnt = 0;
	for(int i=1;i<=r;i++){
		for(int j=1;j<=c;j++){
			if(g[i][j] == 'M'){
				int s1 = max(1, i-d);
				int s2 = max(1, j-d);
				int e1 = min(r, i+d);
				int e2 = min(c, j+d); 
				if((prefix[e1][e2] - prefix[s1-1][e2] - prefix[e1][s2-1] + prefix[s1-1][s2-1]) >= k){
					cnt++;
				}
			}
		}
	}
	cout << cnt;
 }

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 304 KB Output is correct

Subtask #3
18.0 / 18.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 340 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2228 KB Output is correct
2 Correct 14 ms 2292 KB Output is correct
3 Correct 16 ms 2744 KB Output is correct
4 Correct 13 ms 2260 KB Output is correct
5 Correct 16 ms 2516 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 9556 KB Output is correct
2 Correct 38 ms 9580 KB Output is correct
3 Correct 37 ms 9572 KB Output is correct
4 Correct 37 ms 9468 KB Output is correct
5 Correct 35 ms 9556 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 12 ms 2228 KB Output is correct
17 Correct 14 ms 2292 KB Output is correct
18 Correct 16 ms 2744 KB Output is correct
19 Correct 13 ms 2260 KB Output is correct
20 Correct 16 ms 2516 KB Output is correct
21 Correct 35 ms 9556 KB Output is correct
22 Correct 38 ms 9580 KB Output is correct
23 Correct 37 ms 9572 KB Output is correct
24 Correct 37 ms 9468 KB Output is correct
25 Correct 35 ms 9556 KB Output is correct
26 Correct 34 ms 5180 KB Output is correct
27 Correct 33 ms 5188 KB Output is correct
28 Correct 32 ms 5196 KB Output is correct
29 Correct 34 ms 5232 KB Output is correct
30 Correct 35 ms 5196 KB Output is correct