Submission #925687

#	Time	Username	Problem	Language	Result	Execution time	Memory
925687		vjudge1	Collecting Mushrooms (NOI18_collectmushrooms)	C++17	79 / 100	2061 ms	26196 KiB

mushrooms

#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=0;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;
		ll x1=max(1ll,x-d),x2=min(n,x+d);
		ll y1=min(m,y+d),y2=max(0ll,y-d-1);
		for(int i=x1;i<=x2;i+=5)
		{
			sum+=h[i][y1]-h[i][y2];
			if(i+1<=x2) sum+=h[i+1][y1]-h[i+1][y2];
			if(i+2<=x2) sum+=h[i+2][y1]-h[i+2][y2];
			if(i+3<=x2) sum+=h[i+3][y1]-h[i+3][y2];
			if(i+4<=x2) sum+=h[i+4][y1]-h[i+4][y2];
			if(sum>=k)
			{
				ans++;
				break;
			}
		}
	}
	cout<<ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 18 / 18
• Subtask 4: 23 / 23
• Subtask 5: 19 / 19
• Subtask 6: 0 / 21