oj.uz

Submission #970318

# Submission time Handle Problem Language Result Execution time Memory
970318 2024-04-26T10:56:54 Z VMaksimoski008 Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 25 ms 7772 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int n, m, d, k;
    cin >> n >> m >> d >> k;

    char mat[n+1][m+1];
    int pref[n+2][m+2];
    memset(pref, 0, sizeof(pref));

    for(int i=1; i<=n; i++) {
        for(int j=1; j<=m; j++) {
            cin >> mat[i][j];
            if(mat[i][j] == 'S') {
                int x1 = max(1, i - d);
                int x2 = min(n, i + d);
                int y1 = max(1, j - d);
                int y2 = min(m, j + d);
                pref[x1][y1]++; pref[x2+1][y2+1]++;
                pref[x1][y2+1]--, pref[x2+1][y1]--;
            }
        }
    }

    int ans = 0;
    for(int i=1; i<=n; i++) {
        for(int j=1; j<=m; j++) {
            pref[i][j] += pref[i-1][j] + pref[i][j-1];
            pref[i][j] -= pref[i-1][j-1];
            if(pref[i][j] >= k && mat[i][j] == 'M') ans++;
        }
    }

    cout << ans << '\n';
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 436 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 432 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1372 KB Output is correct
2 Correct 8 ms 1624 KB Output is correct
3 Correct 10 ms 1772 KB Output is correct
4 Correct 8 ms 1624 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 7644 KB Output is correct
2 Correct 22 ms 7768 KB Output is correct
3 Correct 22 ms 7772 KB Output is correct
4 Correct 23 ms 7516 KB Output is correct
5 Correct 22 ms 7772 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 436 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 432 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 9 ms 1372 KB Output is correct
17 Correct 8 ms 1624 KB Output is correct
18 Correct 10 ms 1772 KB Output is correct
19 Correct 8 ms 1624 KB Output is correct
20 Correct 9 ms 1876 KB Output is correct
21 Correct 23 ms 7644 KB Output is correct
22 Correct 22 ms 7768 KB Output is correct
23 Correct 22 ms 7772 KB Output is correct
24 Correct 23 ms 7516 KB Output is correct
25 Correct 22 ms 7772 KB Output is correct
26 Correct 25 ms 3416 KB Output is correct
27 Correct 19 ms 3164 KB Output is correct
28 Correct 20 ms 3320 KB Output is correct
29 Correct 20 ms 3320 KB Output is correct
30 Correct 19 ms 3420 KB Output is correct