제출 #161130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
161130		kimbj0709	Collecting Mushrooms (NOI18_collectmushrooms)	C++17	100 / 100	20 ms	4600 KiB

mushrooms

#include <bits/stdc++.h>
using namespace std;
vector<vector<char> > board;
vector<vector<int> > psum;
int n,m;
int sum(int a,int b){
    if(a<0 || b<0)return 0;
    a=min(a,n-1);b=min(b,m-1);
    return psum[a][b];
}
int sum(int a,int b,int c,int d){
    return sum(c,d)-sum(a-1,d)-sum(c,b-1)+sum(a-1,b-1);
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int k,d;
    cin >> n >> m >> d >> k;
    board.resize(n);
    psum.resize(n);
    for(int i=0;i<n;i++){
        board[i].resize(m);
        psum[i].resize(m);
    }
    string str;
    for(int i=0;i<n;i++){
        cin >> str;
        for(int j=0;j<m;j++){
            board[i][j]=str[j];
            psum[i][j]=sum(i-1,j)+sum(i,j-1)-sum(i-1,j-1);
            psum[i][j]+=board[i][j]=='S';
        }
    }
    int ans=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(board[i][j]=='M'){
                ans+=sum(i-d,j-d,i+d,j+d)>=k;
            }
        }
    }
    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