Submission #925621

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
925621	2024-02-12T06:24:49 Z	vjudge1	Collecting Mushrooms (NOI18_collectmushrooms)	C++17	79 / 100	2000 ms	25680 KB

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=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;
}

Subtask #1

9.0 / 9.0

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

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	12124 KB	Output is correct
2	Correct	3 ms	12380 KB	Output is correct
3	Correct	4 ms	12380 KB	Output is correct
4	Correct	3 ms	12124 KB	Output is correct
5	Correct	3 ms	12124 KB	Output is correct
6	Correct	3 ms	12124 KB	Output is correct
7	Correct	4 ms	12124 KB	Output is correct
8	Correct	3 ms	12124 KB	Output is correct
9	Correct	3 ms	12124 KB	Output is correct
10	Correct	3 ms	12124 KB	Output is correct

Subtask #3

18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	12124 KB	Output is correct
2	Correct	3 ms	12124 KB	Output is correct
3	Correct	4 ms	12648 KB	Output is correct
4	Correct	3 ms	12124 KB	Output is correct
5	Correct	4 ms	12380 KB	Output is correct

Subtask #4

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	13916 KB	Output is correct
2	Correct	7 ms	13912 KB	Output is correct
3	Correct	7 ms	14172 KB	Output is correct
4	Correct	7 ms	13912 KB	Output is correct
5	Correct	7 ms	13912 KB	Output is correct

Subtask #5

19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	22988 KB	Output is correct
2	Correct	18 ms	25428 KB	Output is correct
3	Correct	18 ms	25680 KB	Output is correct
4	Correct	15 ms	22480 KB	Output is correct
5	Correct	18 ms	25428 KB	Output is correct

Subtask #6

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	12124 KB	Output is correct
2	Correct	3 ms	12380 KB	Output is correct
3	Correct	4 ms	12380 KB	Output is correct
4	Correct	3 ms	12124 KB	Output is correct
5	Correct	3 ms	12124 KB	Output is correct
6	Correct	3 ms	12124 KB	Output is correct
7	Correct	4 ms	12124 KB	Output is correct
8	Correct	3 ms	12124 KB	Output is correct
9	Correct	3 ms	12124 KB	Output is correct
10	Correct	3 ms	12124 KB	Output is correct
11	Correct	4 ms	12124 KB	Output is correct
12	Correct	3 ms	12124 KB	Output is correct
13	Correct	4 ms	12648 KB	Output is correct
14	Correct	3 ms	12124 KB	Output is correct
15	Correct	4 ms	12380 KB	Output is correct
16	Correct	7 ms	13916 KB	Output is correct
17	Correct	7 ms	13912 KB	Output is correct
18	Correct	7 ms	14172 KB	Output is correct
19	Correct	7 ms	13912 KB	Output is correct
20	Correct	7 ms	13912 KB	Output is correct
21	Correct	15 ms	22988 KB	Output is correct
22	Correct	18 ms	25428 KB	Output is correct
23	Correct	18 ms	25680 KB	Output is correct
24	Correct	15 ms	22480 KB	Output is correct
25	Correct	18 ms	25428 KB	Output is correct
26	Execution timed out	2057 ms	20696 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-