oj.uz

Submission #925577

# Submission time Handle Problem Language Result Execution time Memory
925577 2024-02-12T05:29:14 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 26 ms 20056 KB 
//Bismillahir-Rahmanir-Rahim

#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,sse4.1,sse4.2,popcnt,avx,avx2")

#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define pld pair <long double, long double>
#define ll long long
#define ld long double
#define x first
#define y second
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define skip continue
#define bpop(x) (ll)__builtin_popcountll(x)

using namespace std;

const int N = 5e5 + 7;
const int M = 1e3 + 7;
const int maxA = 2e6 + 7;
const int inf = 1e9 + 7;
const ll INF = 2e18 + 7;
const int MOD = 1e9 + 7;
const ld eps = 1e-9;

pii dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

//#define int long long

int n, m, k, d;
void solve() {
    cin >> n >> m >> d >> k;
    char a[n + 7][m + 7];
    int pre[n + 7][m + 7];
    memset(a, 0, sizeof a);
    memset(pre, 0, sizeof pre);
    for (int i = 1;i <= n;i++) {
        for (int j = 1;j <= m;j++) {
            cin >> a[i][j];
            if (a[i][j] == 'S') {
                int x1 = max(1, i - d), y1 = max(1, j - d);
                int x2 = min(n, i + d), y2 = min(m, j + d);
                pre[x1][y1]++, pre[x1][y2 + 1]--, pre[x2 + 1][y1]--, pre[x2 + 1][y2 + 1]++;
            }
        }
    }
    for (int i = 1;i <= n;i++) {
        for (int j = 1;j <= m;j++)pre[i][j] += pre[i][j - 1];
    }
    for (int j = 1;j <= m;j++) {
        for (int i = 1;i <= n;i++)pre[i][j] += pre[i - 1][j];
    }
    int ans = 0;
    for (int i = 1;i <= n;i++) {
        for (int j = 1;j <= m;j++) {
            if (a[i][j] == 'M')ans += pre[i][j] >= k;
        }
    }
    cout << ans;
}
signed main() {
    //srand(time(NULL));
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    //freopen("tests.in", "r", stdin);
    //freopen("milkorder.out", "w", stdout);
    int test = 1;
    //cin >> test;
    for (int t = 1;t <= test;t++) {
        //cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1372 KB Output is correct
2 Correct 4 ms 1368 KB Output is correct
3 Correct 5 ms 1628 KB Output is correct
4 Correct 4 ms 1488 KB Output is correct
5 Correct 4 ms 1372 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 19804 KB Output is correct
2 Correct 19 ms 19804 KB Output is correct
3 Correct 20 ms 19804 KB Output is correct
4 Correct 26 ms 20056 KB Output is correct
5 Correct 21 ms 19804 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 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 344 KB Output is correct
16 Correct 4 ms 1372 KB Output is correct
17 Correct 4 ms 1368 KB Output is correct
18 Correct 5 ms 1628 KB Output is correct
19 Correct 4 ms 1488 KB Output is correct
20 Correct 4 ms 1372 KB Output is correct
21 Correct 21 ms 19804 KB Output is correct
22 Correct 19 ms 19804 KB Output is correct
23 Correct 20 ms 19804 KB Output is correct
24 Correct 26 ms 20056 KB Output is correct
25 Correct 21 ms 19804 KB Output is correct
26 Correct 12 ms 3420 KB Output is correct
27 Correct 11 ms 2908 KB Output is correct
28 Correct 12 ms 3164 KB Output is correct
29 Correct 12 ms 3164 KB Output is correct
30 Correct 12 ms 3164 KB Output is correct