oj.uz

Submission #1006088

# Submission time Handle Problem Language Result Execution time Memory
1006088 2024-06-23T11:26:51 Z christinelynn Collecting Mushrooms (NOI18_collectmushrooms) C++17
19 / 100
 40 ms 36524 KB 
#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
using namespace std;
signed main()
{
  int r, c, d, p, ans=0;
  scanf("%lld %lld %lld %lld", &r, &c, &d, &p);
  char s[r+5][c+5];
  int pref[r+5][c+5];
  vector<pair<int, int> >v;
  memset(pref, 0, sizeof(pref));
  for(int i=1; i<=r; i++)
  {
    for(int j=1; j<=c; j++)
    {
      scanf(" %c", &s[i][j]);
      if(s[i][j]=='M')
      {
        v.push_back({i, j});
      }
      if(s[i][j]=='S')pref[i][j]++;
      pref[i][j]+=(pref[i-1][j]+pref[i][j-1]);
    }
  }
  for(int i=0; i<v.size(); i++)
  {
//    printf("%lld\n", pref[min(r, v[i].fi+d)][min(c, v[i].se+d)]-pref[max(0ll, v[i].fi-d-1)][min(c, v[i].se+d)]-pref[min(r, v[i].fi+d)][max(0ll, v[i].se-d-1)]+pref[max(0ll, v[i].fi-d-1)][max(0ll, v[i].se-d-1)]);
    if(pref[min(r, v[i].fi+d)][min(c, v[i].se+d)]-pref[max(0ll, v[i].fi-d-1)][min(c, v[i].se+d)]-pref[min(r, v[i].fi+d)][max(0ll, v[i].se-d-1)]+pref[max(0ll, v[i].fi-d-1)][max(0ll, v[i].se-d-1)]>=p)
    {
      ans++;
    }
  }
  printf("%lld\n", ans);
}

Compilation message

mushrooms.cpp: In function 'int main()':
mushrooms.cpp:27:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   for(int i=0; i<v.size(); i++)
      |                ~^~~~~~~~~
mushrooms.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |   scanf("%lld %lld %lld %lld", &r, &c, &d, &p);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:18:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |       scanf(" %c", &s[i][j]);
      |       ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 2140 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 32712 KB Output is correct
2 Correct 32 ms 36524 KB Output is correct
3 Correct 38 ms 35528 KB Output is correct
4 Correct 35 ms 32196 KB Output is correct
5 Correct 31 ms 35528 KB Output is correct

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -