제출 #1127884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1127884		Whisper	Collecting Mushrooms (NOI18_collectmushrooms)	C++17	100 / 100	29 ms	30812 KiB

mushrooms

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

int numRow, numCol, d, k;

void process(void){
    cin >> numRow >> numCol >> d >> k;
    vector<vector<char>> A(numRow + 5, vector<char>(numCol + 5));
    vector<vector<int>> F(numRow + 5, vector<int>(numCol + 5));
    FOR(i, 1, numRow) FOR(j, 1, numCol) cin >> A[i][j];

    FOR(i, 1, numRow) FOR(j, 1, numCol) if(A[i][j] == 'S'){
        int x1 = max(1LL, i - d), y1 = max(1LL, j - d);
        int x2 = min(numRow, i + d), y2 = min(numCol, j + d);
        F[x1][y1]++;
        F[x1][y2 + 1]--;
        F[x2 + 1][y1]--;
        F[x2 + 1][y2 + 1]++;
    }
    int ans = 0;
    FOR(i, 1, numRow) FOR(j, 1, numCol){
        F[i][j] += F[i - 1][j] + F[i][j - 1] - F[i - 1][j - 1];
        if(F[i][j] >= k and A[i][j] == 'M') ++ans;
    }
    cout << ans;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    // freopen(name".inp", "r", stdin);
    // freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

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