oj.uz

답안 #1047118

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1047118 2024-08-07T09:04:38 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 9 ms 13168 KB 
#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 N, M, D, K;

void process(void){
    cin >> N >> M >> D >> K;
    vector<vector<char>> A(N + 1, vector<char>(M + 1));
    vector<vector<int>> F(N + 1, vector<int>(M + 1));
    FOR(i, 1, N) FOR(j, 1, M) {
        cin >> A[i][j];
        if(A[i][j] != 'S') continue;
        int x1 = max(1LL, i - D);
        int y1 = max(1LL, j - D);
        int x2 = min(N, i + D);
        int y2 = min(M, j + D);
        F[x1][y1]++;
        if(y2 + 1 <= M)
            F[x1][y2 + 1]--;
        if(x2 + 1 <= N)
            F[x2 + 1][y1]--;
        if(x2 + 1 <= N && y2 + 1 <= M)
            F[x2 + 1][y2 + 1]++;
    }
    int ans = 0;
    FOR(i, 1, N) FOR(j, 1, M){
        F[i][j] += F[i - 1][j] + F[i][j - 1] - F[i - 1][j - 1];
        if(A[i][j] == 'M' && F[i][j] >= K) ++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.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2140 KB Output is correct
2 Correct 2 ms 2140 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 3 ms 2316 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 13168 KB Output is correct
2 Correct 7 ms 13168 KB Output is correct
3 Correct 8 ms 13168 KB Output is correct
4 Correct 9 ms 13168 KB Output is correct
5 Correct 8 ms 13168 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 2140 KB Output is correct
17 Correct 2 ms 2140 KB Output is correct
18 Correct 3 ms 2652 KB Output is correct
19 Correct 3 ms 2316 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 9 ms 13168 KB Output is correct
22 Correct 7 ms 13168 KB Output is correct
23 Correct 8 ms 13168 KB Output is correct
24 Correct 9 ms 13168 KB Output is correct
25 Correct 8 ms 13168 KB Output is correct
26 Correct 8 ms 6236 KB Output is correct
27 Correct 6 ms 4700 KB Output is correct
28 Correct 7 ms 5028 KB Output is correct
29 Correct 7 ms 4956 KB Output is correct
30 Correct 8 ms 5980 KB Output is correct