Submission #925704

#	Time	Username	Problem	Language	Result	Execution time	Memory
925704		vjudge1	Collecting Mushrooms (NOI18_collectmushrooms)	C++17	79 / 100	2037 ms	27048 KiB

mushrooms

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define emb emplace_back
#define emc emplace
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
template <class type_key, class type_val>
using um = unordered_map<type_key, type_val>;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

signed main(void)
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);

	int n, m, d, k;
	cin >> n >> m >> d >> k;

	char c[n+1][m+1];
	set<pii> evs;
	vector<vector<int>> cnt(n+1, vector<int>(m+1, 0));
	for( int i = 1; i <= n; i++ ) {
		for( int j = 1; j <= m; j++ ) {
			cin >> c[i][j];
			if( c[i][j] == 'S') {
				int col1 = max(j - d, 1);
				bool k = 0;
				if( j + d + 1 > m ) k = 1;
				int col2 = j + d + 1;
				for( int row = max(1, i-d); row <= min(i+d,n); row++ ) {
					cnt[row][col1]++;
					if( k ) {
						if( row+1 <= n ) {
							cnt[row+1][1]--;
							evs.insert({row+1,1});
						}
					}
					else {
						cnt[row][col2]--;
						evs.insert({row,col2});
					}
					evs.insert({row,col1});
				}
			} else if( c[i][j] == 'M') {
				evs.insert({i,j});
			}
		}
	}

	int spr = 0;
	int ans = 0;
	for( auto [i,j]: evs ) {
		spr += cnt[i][j];
		if( c[i][j] == 'M') {
			if( spr >= k ) ans++;
		}
	}
	cout << ans;

return 0;
}

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