oj.uz

Submission #243249

# Submission time Handle Problem Language Result Execution time Memory
243249 2020-06-30T15:55:34 Z AmineWeslati Collecting Mushrooms (NOI18_collectmushrooms) C++14
100 / 100
 20 ms 5248 KB 
//Never stop trying
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up

int32_t main(){
   boost;
   int R,C,D,K;cin>>R>>C>>D>>K;
   char g[R][C];
   int t[R][C];
   for(int i=0; i<R; i++) for(int j=0; j<C;j++){
      cin>>g[i][j];
      if(g[i][j]=='S') t[i][j]=1;
      else t[i][j]=0;
   }

   for(int i=0; i<R; i++) for(int j=0; j<C;j++){
      if(i) t[i][j]+=t[i-1][j];
      if(j) t[i][j]+=t[i][j-1];
      if(i && j) t[i][j]-=t[i-1][j-1];
   }

   int res=0;
   for(int i=0; i<R; i++) for(int j=0; j<C;j++) if(g[i][j]=='M'){
      int x=max((ll)0,i-D), y=max((ll)0,j-D), xx=min(R-1,i+D), yy=min(C-1,j+D);
      int s=0;
      s+=t[xx][yy];
      if(x) s-=t[x-1][yy];
      if(y) s-=t[xx][y-1];
      if(x && y) s+=t[x-1][y-1];
      if(s>=K) res++;
   }
   cout << res << endl;


   return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 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 4 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 5 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 5 ms 384 KB Output is correct
10 Correct 5 ms 256 KB Output is correct

Subtask #3
18.0 / 18.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 6 ms 488 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 10 ms 2304 KB Output is correct
2 Correct 10 ms 2304 KB Output is correct
3 Correct 10 ms 2816 KB Output is correct
4 Correct 9 ms 2304 KB Output is correct
5 Correct 10 ms 2432 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 5120 KB Output is correct
2 Correct 18 ms 5248 KB Output is correct
3 Correct 17 ms 5248 KB Output is correct
4 Correct 20 ms 5248 KB Output is correct
5 Correct 18 ms 5248 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 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 5 ms 384 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 488 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 10 ms 2304 KB Output is correct
17 Correct 10 ms 2304 KB Output is correct
18 Correct 10 ms 2816 KB Output is correct
19 Correct 9 ms 2304 KB Output is correct
20 Correct 10 ms 2432 KB Output is correct
21 Correct 18 ms 5120 KB Output is correct
22 Correct 18 ms 5248 KB Output is correct
23 Correct 17 ms 5248 KB Output is correct
24 Correct 20 ms 5248 KB Output is correct
25 Correct 18 ms 5248 KB Output is correct
26 Correct 19 ms 5120 KB Output is correct
27 Correct 19 ms 5248 KB Output is correct
28 Correct 19 ms 5120 KB Output is correct
29 Correct 19 ms 5248 KB Output is correct
30 Correct 20 ms 5144 KB Output is correct