# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921806 | vjudge1 | Collecting Mushrooms (NOI18_collectmushrooms) | C++17 | 2102 ms | 29348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
void solve(){
ll a,b,d,k,t;
cin>>a>>b>>d>>k;
t=a;
if(a==1){
char c[b+1];
ll ans=0;
map<ll,ll>mp;
vector<ll>v;
for(ll i=1;i<=b;i++){
cin>>c[i];
if(c[i]=='M'){
v.pb(i);
}
}
for(ll i=1;i<=b;i++){
if(c[i]=='S'){
for(ll j=i;j<=i+d;j++){
mp[j]++;
}
for(ll j=i-1;j>=i-d;j--){
mp[j]++;
}
}
}
for(ll i=0;i<v.size();i++){
if(mp[v[i]]>=k){
ans++;
}
}
cout<<ans;
}
else {
vector<pair<ll,ll> >v,l;
char c[a+1][b+1];
for(ll i=1;i<=a;i++){
for(ll j=1;j<=b;j++){
cin>>c[i][j];
if(c[i][j]=='S'){
v.pb({i,j});
}
else if(c[i][j]=='M'){
l.pb({i,j});
}
}
}
//sort(v.begin(),v.end());
ll ans=0,count=0;
for(ll i=0;i<l.size();i++){
ans=0;
for(ll j=0;j<v.size();j++){
ll res=0;
res=max(abs(v[j].first-l[i].first),abs(v[j].second-l[i].second));
if(res<=d){
ans++;
}
if(ans>=k){
count++;
break;
}
}
ans=0;
}
cout<<count;
}
}
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0);
ll t=1,i=1;
//cin>>t;
while(t--){
//cout<<"Case ";
//cout<<i<<':'<<"\n";
//i++;
solve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |