제출 #1005979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1005979		christinelynn	Collecting Mushrooms (NOI18_collectmushrooms)	C++17	27 / 100	391 ms	6340 KiB

mushrooms

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll,ll> 
#define pii pair<int,int> 
#define vl vector<ll> 
#define nikah ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll maxn = 5e5+7, modn1 = 1e9+7, modn2 = 998244353;
using namespace std;

// kalo kamu ngga emas nanti nadya merasa bersalah, ayo san demi nadya!!!
// Kalo emang soalnya susah, pindah soal dulu 
// Jangan sampe diem, pikirin sesuatu, pasti bisa!!!
// Cobain semua approach, jangan ngestuck di satu pemikiran
// Jangan overthinking, jangan panik, tenangin pikiranmu

ll t,r,c,d,s;
vector<pll>v,b;

void solve() {
  cin>>r>>c>>d>>s;
  for (ll i=1; i<=r; i++) {
    for (ll j=1; j<=c; j++) {
      char x; cin>>x;
      if (x == 'M') {
        v.pb({i,j});
      } else if (x == 'S') {
        b.pb({i,j});
      }
    }
  }
  ll ans = 0;
  for (auto x : v) {
    for (auto p : b) {
      if (max(abs(p.fi - x.fi), abs(p.se - x.se)) <= d) {
        ans++;
        break;
      }
    }
  }
  cout<<ans;
}


int main () {
  nikah
  t = 1;
//  cin>>t;
  while (t--) {
    solve();
  //  cout<<endl;
  }
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 10
• Subtask 3: 18 / 18
• Subtask 4: 0 / 23
• Subtask 5: 0 / 19
• Subtask 6: 0 / 21