oj.uz

Submission #733825

# Submission time Handle Problem Language Result Execution time Memory
733825 2023-05-01T10:46:36 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 9 ms 7360 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, M, D, K;
    cin >> N >> M >> D >> K;
    vector<string> S(N);
    for (int i = 0; i < N; i++) {
        cin >> S[i];
    }
    vector pfs(N + 1, vector<int>(M + 1));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            pfs[i + 1][j + 1] = pfs[i + 1][j] + pfs[i][j + 1] - pfs[i][j] + (S[i][j] == 'S');
        }
    }
    int ans = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            if (S[i][j] == 'M') {
                int x1 = max(0, i - D);
                int x2 = min(N, i + D + 1);
                int y1 = max(0, j - D);
                int y2 = min(M, j + D + 1);
                if (pfs[x2][y2] - pfs[x1][y2] - pfs[x2][y1] + pfs[x1][y1] >= K) {
                    ans++;
                }
            }
        }
    }
    cout << ans << "\n";
    return 6/22;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct
2 Correct 2 ms 1364 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 2 ms 1364 KB Output is correct
5 Correct 3 ms 1364 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6760 KB Output is correct
2 Correct 6 ms 7268 KB Output is correct
3 Correct 6 ms 7256 KB Output is correct
4 Correct 6 ms 7200 KB Output is correct
5 Correct 7 ms 7360 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 2 ms 1364 KB Output is correct
18 Correct 2 ms 1492 KB Output is correct
19 Correct 2 ms 1364 KB Output is correct
20 Correct 3 ms 1364 KB Output is correct
21 Correct 6 ms 6760 KB Output is correct
22 Correct 6 ms 7268 KB Output is correct
23 Correct 6 ms 7256 KB Output is correct
24 Correct 6 ms 7200 KB Output is correct
25 Correct 7 ms 7360 KB Output is correct
26 Correct 9 ms 5408 KB Output is correct
27 Correct 4 ms 3280 KB Output is correct
28 Correct 5 ms 3432 KB Output is correct
29 Correct 4 ms 3464 KB Output is correct
30 Correct 7 ms 4564 KB Output is correct