oj.uz

Submission #379906

# Submission time Handle Problem Language Result Execution time Memory
379906 2021-03-19T16:15:09 Z rocks03 Collecting Mushrooms (NOI18_collectmushrooms) C++14
100 / 100
 12 ms 9088 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimization("O3")
//#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve(){
    int R, C, D, K;
    cin >> R >> C >> D >> K;
    int a[R + 1][C + 1]; memset(a, 0, sizeof(a));
    queue<pii> q;
    rep(i, 0, R){
        string s; cin >> s;
        rep(j, 0, C){
            if(s[j] == 'M'){
                q.push({i, j});
            } else if(s[j] == 'S'){
                int mnx = max(0, i - D), mxx = min(R, i + D + 1);
                int mny = max(0, j - D), mxy = min(C, j + D + 1);
                a[mnx][mny]++;
                a[mnx][mxy]--;
                a[mxx][mny]--;
                a[mxx][mxy]++;
            }
        }
    }
    rep(i, 0, R){
        rep(j, 0, C){
            a[i][j + 1] += a[i][j];
        }
    }
    rep(i, 0, R){
        rep(j, 0, C){
            a[i + 1][j] += a[i][j];
        }
    }
    int ans = 0;
    while(!q.empty()){
        auto [x, y] = q.front();
        q.pop();
        if(a[x][y] >= K)
            ans++;
    }
    cout << ans;
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    solve();
    return 0;
}

Compilation message

mushrooms.cpp: In function 'void solve()':
mushrooms.cpp:52:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   52 |         auto [x, y] = q.front();
      |              ^

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 380 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Correct 2 ms 1388 KB Output is correct
3 Correct 2 ms 1644 KB Output is correct
4 Correct 2 ms 1388 KB Output is correct
5 Correct 3 ms 1388 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 6528 KB Output is correct
2 Correct 12 ms 9088 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 10 ms 6912 KB Output is correct
5 Correct 11 ms 8704 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 380 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 1280 KB Output is correct
17 Correct 2 ms 1388 KB Output is correct
18 Correct 2 ms 1644 KB Output is correct
19 Correct 2 ms 1388 KB Output is correct
20 Correct 3 ms 1388 KB Output is correct
21 Correct 10 ms 6528 KB Output is correct
22 Correct 12 ms 9088 KB Output is correct
23 Correct 10 ms 8192 KB Output is correct
24 Correct 10 ms 6912 KB Output is correct
25 Correct 11 ms 8704 KB Output is correct
26 Correct 10 ms 3820 KB Output is correct
27 Correct 9 ms 4588 KB Output is correct
28 Correct 7 ms 3692 KB Output is correct
29 Correct 6 ms 3436 KB Output is correct
30 Correct 9 ms 4224 KB Output is correct