oj.uz

Submission #205044

# Submission time Handle Problem Language Result Execution time Memory
205044 2020-02-27T18:25:35 Z Haunted_Cpp Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 20 ms 4472 KB 
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
 
#define FOR(i, a, b) for (int i = a; i < (int) b; i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define f first
#define s second
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

vvi dp;
vector< vector<char> > g;

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int r, c, d, k;
  cin >> r >> c >> d >> k;
  g.resize(r);
  dp.resize(r);
  F0R (i, r) {
    g[i].resize(c);
    dp[i].resize(c);
  }
  F0R (i, r) {
    F0R (j, c) {
      cin >> g[i][j];
    }
  }
  dp[0][0] = (g[0][0] == 'S');
  FOR (i, 1, r) {
    dp[i][0] = dp[i - 1][0] + (g[i][0] == 'S');
  }
  FOR (i, 1, c) {
    dp[0][i] = dp[0][i - 1] + (g[0][i] == 'S');
  }
  FOR (i, 1, r) {
    FOR (j, 1, c) {
      dp[i][j] += dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + (g[i][j] == 'S');
    }
  }
  int tot = 0;
  F0R (i, r) {
    F0R (j, c) {
      if (g[i][j] == 'M') {
        int linha = min (r - 1, i + d);
        int coluna = min (c - 1, j + d);
        int cnt = dp[linha][coluna] - (i - d - 1 >= 0 ? dp[i - d - 1][coluna] : 0) - (j - d - 1 >= 0 ? dp[linha][j - d - 1] : 0) + (i - d - 1 >= 0 && j - d - 1 >= 0 ? dp[i - d - 1][j - d - 1] : 0);
        tot += (cnt >= k);
      }
    }
  }
  cout << tot << '\n';
  return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

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

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1272 KB Output is correct
2 Correct 9 ms 1400 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 9 ms 1400 KB Output is correct
5 Correct 10 ms 1400 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2812 KB Output is correct
2 Correct 16 ms 2808 KB Output is correct
3 Correct 17 ms 2808 KB Output is correct
4 Correct 16 ms 2808 KB Output is correct
5 Correct 16 ms 2808 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 380 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 380 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 9 ms 1272 KB Output is correct
17 Correct 9 ms 1400 KB Output is correct
18 Correct 11 ms 1528 KB Output is correct
19 Correct 9 ms 1400 KB Output is correct
20 Correct 10 ms 1400 KB Output is correct
21 Correct 16 ms 2812 KB Output is correct
22 Correct 16 ms 2808 KB Output is correct
23 Correct 17 ms 2808 KB Output is correct
24 Correct 16 ms 2808 KB Output is correct
25 Correct 16 ms 2808 KB Output is correct
26 Correct 20 ms 4472 KB Output is correct
27 Correct 18 ms 2808 KB Output is correct
28 Correct 15 ms 2680 KB Output is correct
29 Correct 18 ms 2680 KB Output is correct
30 Correct 19 ms 4088 KB Output is correct