oj.uz

Submission #1006062

# Submission time Handle Problem Language Result Execution time Memory
1006062 2024-06-23T10:52:38 Z devariaota Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 19 ms 23824 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define endl '\n'
#define all(v) v.begin(), v.end()
#define all1(v) v.begin() + 1, v.end()
#define rall(v) v.rbegin(), v.rend()
#define rall1(v) v.rbegin(), v.rend()-1
#define fr(m,n,k) for(int m=n;m<=k;m++)
#define frr(m,n,k) for(int m=n;m>=k;m--)
#define yes cout << "YES"
#define no cout << "NO"
#define yesm cout << "Yes"
#define nom cout << "No"
#define inf 1e18
#define ext {cout << -1; return;}
#define zxt {cout << 0; return;}
#define noxt {no;return;}
#define yesxt {yes;return;}
#define fill(x,s) memset(x, s, sizeof(x));
#define lb lower_bound
#define ub upper_bound
#define pi pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define vpi vector<pi>
#define mii map<int,int>
#define si set<int>
#define fi first
#define se second
#define sz size()
#define el cout << endl

// int mod = 1e9 + 7;
int mod = 998244353;

int ft(int n) {int ans = 1; for (int i = 1; i <= n; ++i) {ans = ans * i;} return ans;}
int binpow(int x, int y) {if (y == 0) return 1; int z = 1; while (y) {  if (y & 1) z = z * x % mod; x = x * x % mod; y >>= 1;} return z;}
int inv(int x) {return binpow(x, mod - 2);}
int bintoint(string s) {reverse(all(s)); int xx = 0; int m = 1; int z = s.sz; fr(j, 0, z) {xx += (s[j] == '1' ? m : 0); m <<= 1;} return xx;}
string inttobin(int x) {if (x == 0) return "0"; string s; while (x) {s += (x & 1) + '0'; x >>= 1;} reverse(all(s)); return s;}
string ads(string s, string p) {if (s.sz > p.sz) swap(s, p); int n = s.sz, m = p.sz; reverse(all(s)); reverse(all(p)); int tm = 0; string st; fr(i, 0, n - 1) {tm = s[i] - '0' + p[i] - '0' + tm; st += '0' + tm % 10; tm /= 10;} fr(i, n, m - 1) {tm = p[i] - '0' + tm; st += '0' + tm % 10; tm /= 10;} if (tm != 0) {st += '0' + tm % 10;} reverse(all(st)); return st;}

bool id, id1, id2;
int n, m, k, l, r, a, b, c, d, e, x, y, z, i, j, q, t, o;
int mi = inf, ma, sum, ans, num, tp;
string s, p;

const int N = 2e3 + 5;
mt19937 rng((int) new int);
void solve() {
    int s;
    cin >> r >> c >> d >> s;
    char g[r + 2][c + 2];
    int pre[r + 2][c + 2]; memset(pre, 0, sizeof(pre));
    vpi tan;
    fr(i, 1, r) {
        fr(j, 1, c) {
            cin >> g[i][j];
            if (g[i][j] == 'M') tan.pb({i, j});
            if (g[i][j] == 'S') {
                int ni = i - d, nj = j - d;
                ni = max(ni, 1ll);
                nj = max(nj, 1ll);
                pre[ni][nj]++;

                ni = i - d, nj = j + d + 1;
                ni = max(ni, 1ll);
                nj = min(nj, c + 1);
                pre[ni][nj]--;

                ni = i + d + 1, nj = j - d;
                ni = min(ni, r + 1);
                nj = max(nj, 1ll);
                pre[ni][nj]--;

                ni = i + d + 1, nj = j + d + 1;
                ni = min(ni, r + 1);
                nj = min(nj, c + 1);
                pre[ni][nj]++;
            }
        }
    }
    fr(i, 1, r) {
        fr(j, 1, c) {
            pre[i][j] += pre[i - 1][j];
            pre[i][j] += pre[i][j - 1];
            pre[i][j] -= pre[i - 1][j - 1];
            // cout << pre[i][j] << " ";
        }
        // el;
    }
    for (auto [i, j] : tan) {
        if (pre[i][j] >= s) ans++;
    } cout << ans;
}
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0);
    int T = 1;
    // cin >> T;
    for (; T--;) {
        cout << fixed << setprecision(1); solve();
        if (T) cout << endl;
    } return 0;
}
// Tc, angka kecil), No Overthink(trivial tp modified),
// Check Kasus Khusus(1,2,1e18), ganti jd bentuk lain (2 case or etc)
// bedah 1 1 variable yg bisa dicari, cari dari jwbn ke ques

// Sorting : Iterate Greedy (pake data struct) / dp / binser
// Graphs / Tree : DFS / adj / dis[a][b] != dis[a][c] + dis[c][b] / indegree
// Yang keliatan kyk dp : bisa jd brute force doang
// Data Structure : BIT / DSU / Segtree, SparseT / dequeue
// Compression, Line Sweep
// Parity (2 or 3, mod 4..) klo dilakuin 2 kali jadi sama aja -> parity mod 2

/*
brute force, greedy, pref sum, 2pointer, gcd/lcm, even/odd
min/max, binser, bfs/dfs, iterate, multiple/divisor

bipartite graph,bitmasking, sliding window, konstanta
divconquer, djikstra, stack(prev and next smaller)
prefix difference
*/

// tools :
//__lg(x),__builtinpopcount,nextpermutation(), is_sorted / alpha / digit,

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 604 KB Output is correct
3 Correct 0 ms 604 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 604 KB Output is correct
3 Correct 0 ms 604 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 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

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

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2140 KB Output is correct
2 Correct 3 ms 2264 KB Output is correct
3 Correct 4 ms 2652 KB Output is correct
4 Correct 3 ms 2140 KB Output is correct
5 Correct 3 ms 2396 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 18644 KB Output is correct
2 Correct 19 ms 23484 KB Output is correct
3 Correct 19 ms 22988 KB Output is correct
4 Correct 17 ms 19412 KB Output is correct
5 Correct 18 ms 23824 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 604 KB Output is correct
3 Correct 0 ms 604 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 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 0 ms 348 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 3 ms 2140 KB Output is correct
17 Correct 3 ms 2264 KB Output is correct
18 Correct 4 ms 2652 KB Output is correct
19 Correct 3 ms 2140 KB Output is correct
20 Correct 3 ms 2396 KB Output is correct
21 Correct 17 ms 18644 KB Output is correct
22 Correct 19 ms 23484 KB Output is correct
23 Correct 19 ms 22988 KB Output is correct
24 Correct 17 ms 19412 KB Output is correct
25 Correct 18 ms 23824 KB Output is correct
26 Correct 11 ms 7128 KB Output is correct
27 Correct 16 ms 10964 KB Output is correct
28 Correct 11 ms 7128 KB Output is correct
29 Correct 11 ms 7092 KB Output is correct
30 Correct 10 ms 9940 KB Output is correct