oj.uz

Submission #246157

# Submission time Handle Problem Language Result Execution time Memory
246157 2020-07-08T10:14:30 Z SamAnd Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 19 ms 13184 KB 
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 500005;

int n, m, d, k;
char** a;
int** p;

void solv()
{
    scanf("%d%d%d%d", &n, &m, &d, &k);
    a = new char*[n + 5];
    for (int i = 0; i < n + 5; ++i)
        a[i] = new char[m + 5];
    for (int i = 1; i <= n; ++i)
        scanf(" %s", (a[i] + 1));

    p = new int*[n + 5];
    for (int i = 0; i < n + 5; ++i)
    {
        p[i] = new int [m + 5];
        for (int j = 0; j < m + 5; ++j)
            p[i][j] = 0;
    }
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            if (a[i][j] == 'S')
            {
                int x1 = max(1, i - d);
                int y1_ = max(1, j - d);
                int x2 = min(n, i + d);
                int y2 = min(m, j + d);
                p[x1][y1_]++;
                p[x1][y2 + 1]--;
                p[x2 + 1][y1_]--;
                p[x2 + 1][y2 + 1]++;
            }
        }
    }

    int ans = 0;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            p[i][j] += p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1];
            if (a[i][j] == 'M')
            {
                if (p[i][j] >= k)
                    ++ans;
            }
        }
    }
    printf("%d\n", ans);
}

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    solv();
    return 0;
}

//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}

Compilation message

mushrooms.cpp: In function 'void solv()':
mushrooms.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d%d", &n, &m, &d, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %s", (a[i] + 1));
         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

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

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1280 KB Output is correct
2 Correct 7 ms 1536 KB Output is correct
3 Correct 8 ms 1792 KB Output is correct
4 Correct 7 ms 1536 KB Output is correct
5 Correct 7 ms 1664 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12696 KB Output is correct
2 Correct 17 ms 13056 KB Output is correct
3 Correct 17 ms 13184 KB Output is correct
4 Correct 19 ms 13056 KB Output is correct
5 Correct 18 ms 13056 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 7 ms 1280 KB Output is correct
17 Correct 7 ms 1536 KB Output is correct
18 Correct 8 ms 1792 KB Output is correct
19 Correct 7 ms 1536 KB Output is correct
20 Correct 7 ms 1664 KB Output is correct
21 Correct 19 ms 12696 KB Output is correct
22 Correct 17 ms 13056 KB Output is correct
23 Correct 17 ms 13184 KB Output is correct
24 Correct 19 ms 13056 KB Output is correct
25 Correct 18 ms 13056 KB Output is correct
26 Correct 17 ms 4992 KB Output is correct
27 Correct 11 ms 3328 KB Output is correct
28 Correct 13 ms 3456 KB Output is correct
29 Correct 12 ms 3456 KB Output is correct
30 Correct 15 ms 4352 KB Output is correct