oj.uz

Submission #961428

# Submission time Handle Problem Language Result Execution time Memory
961428 2024-04-12T05:35:03 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 15 ms 12124 KB 
#include <bits/stdc++.h>
 
#pragma optimize("Ofast")
#pragma target("avx2")
 
using namespace std;
 
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
#define int ll
 
const int MAX=5e5+5;
const int B=90;
const int N=105;
const int block=400;
const int maxB=MAX/B+10;
const ll inf=2e18;  
const int mod=998244353;
const int mod1=1e9+9;
const ld eps=1e-9;
 
int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};
 
int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}

int r,c,d,k;
int f[MAX];

void solve(){
  cin>>r>>c>>d>>k;
  vector<vector<int>> a,b;
  a.resize(r+5);
  b.resize(r+5);
  for(int i=1;i<=r;i++){
    a[i].resize(c+5);
    b[i].resize(c+5);
  }
  // cout<<r<<" "<<c<<"\n";
  for(int i=1;i<=r;i++){
    for(int j=1;j<=c;j++){
      char x;
      cin>>x;
      if(x=='.')a[i][j]=0;
      else if(x=='M')a[i][j]=1;
      else{
        a[i][j]=2;
        int lx=max(1ll,i-d);
        int rx=min(r,i+d);
        int ly=max(1ll,j-d);
        int ry=min(c,j+d);
        // cerr<<lx<<" "<<rx<<" "<<ly<<" "<<ry<<"\n";
        b[lx][ly]++;
        if(ry+1<=c)b[lx][ry+1]--;
        // cerr<<rx+1<<" "<<r<<"\n";
        // cerr<<sz(b)<<" "<<sz(b[rx+1])<<"\n";
        if(rx+1<=r)b[rx+1][ly]--;
        // cerr<<lx<<" "<<rx<<" "<<ly<<" "<<ry<<"\n";
        if(rx+1<=r&&ry+1<=c)b[rx+1][ry+1]++;
      }
    }
  }
  int ans=0;
  for(int i=1;i<=r;i++){
    int cnt=0;
    // cout<<i<<" "<<c<<"\n";
    for(int j=1;j<=c;j++){
      // cout<<i<<" "<<j<<" "<<c<<"\n";
      f[j]+=b[i][j];
      cnt+=f[j];
      if(cnt>=k&&a[i][j]==1)ans++;
    }
  }
  cout<<ans;
}

signed main(){
  //  freopen("help.in","r",stdin);
  //  freopen("help.out","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;
  while(t--)solve();
}

Compilation message

mushrooms.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast")
      | 
mushrooms.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

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

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3416 KB Output is correct
2 Correct 4 ms 3676 KB Output is correct
3 Correct 4 ms 4452 KB Output is correct
4 Correct 3 ms 3672 KB Output is correct
5 Correct 4 ms 3928 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12120 KB Output is correct
2 Correct 10 ms 12120 KB Output is correct
3 Correct 10 ms 12124 KB Output is correct
4 Correct 11 ms 12124 KB Output is correct
5 Correct 10 ms 12124 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 3416 KB Output is correct
17 Correct 4 ms 3676 KB Output is correct
18 Correct 4 ms 4452 KB Output is correct
19 Correct 3 ms 3672 KB Output is correct
20 Correct 4 ms 3928 KB Output is correct
21 Correct 15 ms 12120 KB Output is correct
22 Correct 10 ms 12120 KB Output is correct
23 Correct 10 ms 12124 KB Output is correct
24 Correct 11 ms 12124 KB Output is correct
25 Correct 10 ms 12124 KB Output is correct
26 Correct 13 ms 11100 KB Output is correct
27 Correct 10 ms 8284 KB Output is correct
28 Correct 10 ms 8024 KB Output is correct
29 Correct 10 ms 8284 KB Output is correct
30 Correct 13 ms 10520 KB Output is correct