| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 101734 | DystoriaX | Collecting Mushrooms (NOI18_collectmushrooms) | C++14 | 58 ms | 8316 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int r, c, d, k;
vector<vector<int> > pref;
vector<vector<char> > mp;
int main(){
	scanf("%d%d%d%d", &r, &c, &d, &k);
	pref.resize(r + 2);
	mp.resize(r + 2);
	for(int i = 0; i <= r + 1; i++) pref[i].assign(c + 2, 0), mp[i].resize(c + 2);
	for(int i = 1; i <= r; i++){
		for(int j = 1; j <= c; j++){
			scanf(" %c", &mp[i][j]);
			if(mp[i][j] == 'S'){
				int i1, i2, j1, j2;
				i1 = max(1, i - d); j1 = max(1, j - d);
				i2 = min(r + 1, i + d + 1); j2 = min(c + 1, j + d + 1);
				pref[i1][j1]++;
				pref[i1][j2]--;
				pref[i2][j1]--;
				pref[i2][j2]++;
			}
		}
	}
	int ans = 0;
	for(int i = 1; i <= r; i++){
		for(int j = 1; j <= c; j++){
			pref[i][j] += pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
			if(mp[i][j] == 'M') if(pref[i][j] >= k) ans++;
		}
	}
	printf("%d\n", ans);
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
