oj.uz

Submission #871324

# Submission time Handle Problem Language Result Execution time Memory
871324 2023-11-10T14:57:36 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++14
79 / 100
 98 ms 193276 KB 
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
#define int long long
using namespace std;
using lli = long long;
using ld = long double;
using pii = pair <int, int>;
mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1e6 + 1000;
const int maxm = 1e4 + 1000;
const int mod = 1e9 + 7;

lli n, m, k, d;
char s[maxm][maxm];
lli a[maxm][maxm];
void ReadInput()
{
    cin >> m >> n >> d >> k;
    for (lli i = 1; i <= m; i ++)
    {
        for (lli j = 1; j <= n; j ++)
        {
            cin >> s[i][j];
            a[i][j] = a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1];
            if (s[i][j] == 'S')
            {
                a[i][j] ++;
            }
            //cout << a[i][j] << endl;
        }
    }
}
void Solve()
{
    lli cnt = 0;
    for (lli i = 1; i <= m; i ++)
    {
        for (lli j = 1; j <= n; j ++)
        {
            if (s[i][j] == 'M')
            {
                lli x = i - d - 1;
                if (x < 1) x = 0;
                lli y = j - d - 1;
                if (y < 1) y = 0;
                lli u = i + d;
                if (u > m) u = m;
                lli v = j + d;
                if (v > n) v = n;
                //return;
                lli sum = a[u][v] - a[u][y] - a[x][v] + a[x][y];
                //cout << u << " " << v << " " << a[u][v] << " " << a[u][y] << " " << a[x][v] << " " << a[x][y] << " " << sum << endl;
                //return;
                if (sum >= k)
                {
                    cnt ++;
                }
            }
        }
    }
    cout << cnt;
}
#define debug
#define taskname "A"
signed main(){
    faster
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    int tt = 1;
    //cin >> tt;
    while (tt--){
        ReadInput();
        Solve();
    }
    if (fopen("timeout.txt", "r")){
        ofstream timeout("timeout.txt");
        timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000);
        timeout.close();
        #ifndef debug
        cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n";
        #endif // debug
    }
}

Compilation message

mushrooms.cpp: In function 'int main()':
mushrooms.cpp:71:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:72:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9820 KB Output is correct
2 Correct 4 ms 10076 KB Output is correct
3 Correct 5 ms 14428 KB Output is correct
4 Correct 4 ms 9820 KB Output is correct
5 Correct 5 ms 14172 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6492 KB Output is correct
2 Correct 7 ms 6492 KB Output is correct
3 Correct 7 ms 6716 KB Output is correct
4 Correct 8 ms 6720 KB Output is correct
5 Correct 8 ms 6492 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 4 ms 10076 KB Output is correct
18 Correct 5 ms 14428 KB Output is correct
19 Correct 4 ms 9820 KB Output is correct
20 Correct 5 ms 14172 KB Output is correct
21 Correct 9 ms 6492 KB Output is correct
22 Correct 7 ms 6492 KB Output is correct
23 Correct 7 ms 6716 KB Output is correct
24 Correct 8 ms 6720 KB Output is correct
25 Correct 8 ms 6492 KB Output is correct
26 Runtime error 98 ms 193276 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -