제출 #1131562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131562		adkjt	Collecting Mushrooms (NOI18_collectmushrooms)	C++20	100 / 100	25 ms	10424 KiB

mushrooms

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define f first
#define s second
vector<pii> mush;

int main()
{
    int r,c,k,d;cin>>r>>c>>d>>k;
    int qs[r+2][c+2];
    for(int i=0;i<=r;i++)
        for(int j=0;j<=c;j++)
            qs[i][j]=0;
    for(int i=1;i<=r;i++)
        for(int j=1;j<=c;j++)
    {
        char x;
        cin>>x;
        qs[i][j]=qs[i][j-1]+qs[i-1][j]-qs[i-1][j-1];
        if(x=='M') mush.push_back({i,j});
        else if(x=='S') qs[i][j]++;
    }
    int ans=0;

    for(auto x:mush)
    {
        if(qs[min(r,x.f+d)][min(c,x.s+d)]-qs[max(0,x.f-d-1)][min(c,x.s+d)]-qs[min(r,x.f+d)][max(0,x.s-d-1)]+qs[max(0,x.f-d-1)][max(0,x.s-d-1)]>=k) ans++;
    }
    cout<<ans;
}

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