제출 #123034

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
123034		mechfrog88	Collecting Mushrooms (NOI18_collectmushrooms)	C++14	100 / 100	27 ms	12592 KiB

mushrooms

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
using namespace __gnu_pbds;
using namespace std;
 
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
typedef long long ll;
typedef long double ld;	


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll r,c,d,k;
	cin >> r >> c >> d >> k;
	vector <string> arr(r);
	vector <vector<ll>> count(r,vector<ll>(c,0));
	vector <vector<ll>> hori(r,vector<ll>(c,0));
	for (int z=0;z<r;z++){
		cin >> arr[z];
	}
	for (ll z=0;z<r;z++){
		for (ll x=0;x<c;x++){
			if (arr[z][x] == 'S'){
				hori[max(z-d,ll(0))][max(x-d,ll(0))]++;
				if (z+d+1 < r)hori[z+d+1][max(x-d,ll(0))]--;
				if (x+d+1 < c)hori[max(z-d,ll(0))][x+d+1]--;
				if (x+d+1 < c && z+d+1 < r)hori[z+d+1][x+d+1]++;
			}
		}
	}
	for (int z=0;z<r;z++){
		ll t = 0;
		for (int x=0;x<c;x++){
			if (hori[z][x] != 0 && z != r-1){
				hori[z+1][x] += hori[z][x];
			}
			t += hori[z][x];
			count[z][x] = t;
		}
	}
	ll ans = 0;
	for (int z=0;z<r;z++){
		for (int x=0;x<c;x++){
			if (arr[z][x] == 'M' && count[z][x] >= k){
				ans++;
			}
		}
	}
	cout << ans << endl;
}

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