oj.uz

Submission #830399

# Submission time Handle Problem Language Result Execution time Memory
830399 2023-08-19T05:50:37 Z ajay Collecting Mushrooms (NOI18_collectmushrooms) C++14
79 / 100
 2000 ms 38444 KB 
/* Ajay Jadhav */

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'

void solve()
{
    int r, c, d, k;
    cin >> r >> c >> d >> k;
    vvi mat(r + 5, vi(c + 5));
    vvi mushrooms;
    rep(i, 0, r)
    {
        string s;
        cin >> s;
        rep(j, 0, c)
        {
            if (s[j] == 'M')
                mushrooms.pb({i, j});
            else if (s[j] == 'S')
            {
                // 2d range update...
                int r1, r2, c1, c2;
                r1 = max(0, i - d);
                r2 = min(r - 1, i + d);
                c1 = max(0, j - d);
                c2 = min(c - 1, j + d);

                for (int i = r1; i <= r2; i++)
                {
                    mat[i][c1] += 1;
                    mat[i][c2 + 1] -= 1;
                }
            }
        }
    }

    rep(i, 0, r + 1)
    {
        rep(j, 0, c + 1)
        {
            if (j > 0)
                mat[i][j] += mat[i][j - 1];
        }
    }

    int ans = 0;
    rep(i, 0, sz(mushrooms))
    {
        if (mat[mushrooms[i][0]][mushrooms[i][1]] >= k)
        {
            ans++;
        }
    }
    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 444 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 596 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct
2 Correct 3 ms 1260 KB Output is correct
3 Correct 2 ms 1676 KB Output is correct
4 Correct 2 ms 1400 KB Output is correct
5 Correct 2 ms 1364 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23344 KB Output is correct
2 Correct 40 ms 38444 KB Output is correct
3 Correct 29 ms 33532 KB Output is correct
4 Correct 23 ms 24072 KB Output is correct
5 Correct 35 ms 35832 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 444 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 3 ms 1260 KB Output is correct
18 Correct 2 ms 1676 KB Output is correct
19 Correct 2 ms 1400 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 23 ms 23344 KB Output is correct
22 Correct 40 ms 38444 KB Output is correct
23 Correct 29 ms 33532 KB Output is correct
24 Correct 23 ms 24072 KB Output is correct
25 Correct 35 ms 35832 KB Output is correct
26 Execution timed out 2062 ms 10132 KB Time limit exceeded
27 Halted 0 ms 0 KB -