Submission #320986

#TimeUsernameProblemLanguageResultExecution timeMemory
320986MarcoMeijerCollecting Mushrooms (NOI18_collectmushrooms)C++14
100 / 100
18 ms13332 KiB
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;

int r, c, d, k;
vector<vll> sm;
vector<string> gr;

int getSm(int i, int j) {
    if(i<0||j<0) return 0;
    return sm[i][j];
}

void program() {
    IN(r,c,d,k);
    gr.resize(r);
    RE(i,r) IN(gr[i]);
    sm.assign(r+1, vll(c+1,0));
    RE(i,r) RE(j,c) {
        if(gr[i][j] == 'S') {
            int x=i, y=j;
            int x1=max(0,x-d);
            int x2=min(r,x+d+1);
            int y1=max(0,y-d);
            int y2=min(c,y+d+1);
            sm[x1][y1]++;
            sm[x1][y2]--;
            sm[x2][y1]--;
            sm[x2][y2]++;
        }
    }
    RE(i,r) RE(j,c)
        sm[i][j] += getSm(i,j-1)+getSm(i-1,j)-getSm(i-1,j-1);
    int ans = 0;
    RE(i,r) RE(j,c) {
        if(gr[i][j] == 'M' && sm[i][j] >= k) {
            ans++;
        }
    }
    OUTL(ans);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...