# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321373 | 2020-11-12T08:19:09 Z | techiehere08 | Collecting Mushrooms (NOI18_collectmushrooms) | C++14 | 36 ms | 6636 KB |
#include <bits/stdc++.h> using namespace std; int main(){ int n, m, k, d; scanf("%d%d%d%d", &n, &m, &k, &d); int dp[n + 2][m + 2]; char grid[n + 2][m + 2]; memset(dp, 0, sizeof dp); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> grid[i][j]; if (grid[i][j] != 'S') continue; dp[max(1, i - d)][max(1, j - d)]++; dp[min(n, i + d) + 1][max(1, j - d)]--; dp[max(1, i - d)][min(m, j + d) + 1]--; dp[min(n, i + d) + 1][min(m, j + d) + 1]++; } } for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) dp[i][j] += dp[i - 1][j]; int ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { dp[i][j] += dp[i][j - 1]; ans += (grid[i][j] == 'M' && dp[i][j] >= k); } } printf("%d", ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 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 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 13 ms | 1260 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 36 ms | 6636 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |