Submission #1184075

#	Time	Username	Problem	Language	Result	Execution time	Memory
1184075		soyk	Collecting Mushrooms (NOI18_collectmushrooms)	C++20	60 / 100	2093 ms	3304 KiB

mushrooms

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<vector>
using namespace std;
#define abs(x) ((x>0)?(x):(-(x)))
#define max(x,y) ((x>y)?x:y)

int main()
{
	int R, C, D, K;
	cin >> R >> C >> D >> K;
	vector<pair<int, int>> mushroom = {};
	vector<pair<int, int>> sprinkler = {};
	for (int a = 0; a < R; a++)
	{
		for (int b = 0; b < C; b++)
		{
			char in;
			cin >> in;
			if (in == 'M')
				mushroom.push_back({ a,b });
			if (in == 'S')
				sprinkler.push_back({ a,b });
		}
	}
	int s1 = mushroom.size(), s2 = sprinkler.size();
	int out=0;
	for (int a = 0; a < s1; a++)
	{
		int num = 0;
		for (int b = 0; b < s2; b++)
		{
			//cout << max(abs(mushroom[a].first - sprinkler[b].first), abs(mushroom[a].second - sprinkler[b].second))<<" ";
			if (max(abs(mushroom[a].first - sprinkler[b].first), abs(mushroom[a].second - sprinkler[b].second)) <= D)
				num++;
		}
		//cout << endl;
		if (num >= K)
			out++;
	}
	cout << out;
	//cout << endl << endl << abs((- 3)) << " " << abs((5));
}

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