Submission #331378

#	Time	Username	Problem	Language	Result	Execution time	Memory
331378		Sho10	Collecting Mushrooms (NOI18_collectmushrooms)	C++14	100 / 100	20 ms	13036 KiB

mushrooms

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,d,k;
int32_t main(){
CODE_START
cin>>n>>m>>d>>k;
ll sum[n+5][m+5];
char a[n+5][m+5];
for(ll i=0;i<=n;i++)
{
    for(ll j=0;j<=m;j++)
    {
        sum[i][j]=0;
    }
}
for(ll i=1;i<=n;i++)
{
    for(ll j=1;j<=m;j++)
    {
        cin>>a[i][j];
if(a[i][j]=='S'){
    ll x,y,xx,yy;
    x=max(1ll,i-d);
    y=max(1ll,j-d);
    xx=min(1+n,1+i+d);
    yy=min(1+m,1+j+d);
    sum[x][y]++;
    sum[x][yy]--;
    sum[xx][y]--;
    sum[xx][yy]++;
}
    }
}
 for(ll i=1;i<=n;i++){
    for(ll j=1;j<=m;j++){
      sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
    }
 }
ll ans=0;
for(ll i=1;i<=n;i++)
{
    for(ll j=1;j<=m;j++)
    {
        if(k<=sum[i][j]&a[i][j]=='M'){
              //  cout<<i<<' '<<j<<' '<<sum[i][j]<<endl;
            ans++;
        }
    }
}
rc(ans);
}

Compilation message (stderr)

mushrooms.cpp: In function 'int32_t main()':
mushrooms.cpp:62:13: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   62 |         if(k<=sum[i][j]&a[i][j]=='M'){
      |            ~^~~~~~~~~~~

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