Submission #925621

#TimeUsernameProblemLanguageResultExecution timeMemory
925621vjudge1Collecting Mushrooms (NOI18_collectmushrooms)C++17
79 / 100
2057 ms25680 KiB
#include<bits/stdc++.h>
using namespace  std;
#define ll long long
#define lld long long double
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define IShowSpeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int N=5e5+100;
const int mod=1e9+7;
const int K=500;
const ll inf=1e18+1337;
const int dx[]={-1, 0, 0, 1};
const int dy[]={0, -1, 1, 0};
vector<ll>h[N];
vector< pair<ll,ll> >v;

int main()
{
	IShowSpeed
	ll n,m,d,k,ans=0;
	cin>>n>>m>>d>>k;

	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			h[i].pb(0);

	for(int i=1;i<=n;i++)
	{
		ll sum=0;
		for(int j=1;j<=m;j++)
		{
			char c;
			cin>>c;
			if(c=='S') sum++;
			if(c=='M') v.pb({i,j});
			h[i][j]=sum;
		}
	}
	for(auto p: v)
	{
		ll x=p.F,y=p.S,sum=0;
		for(int i=max(1ll,x-d);i<=min(n,x+d);i++)
		{
			sum+=h[i][min(m,y+d)]-h[i][max(0ll,y-d-1)];
		}
		if(sum>=k) ans++;
	}
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...