# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733819 | vjudge1 | Collecting Mushrooms (NOI18_collectmushrooms) | C++17 | 2074 ms | 4940 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector <pair<ll,ll>> v;
ll r, c, d, li;
bool check(ll a, ll b) {
if(a < r && b < c && a >= 0 && b >= 0) return 1;
else return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> r >> c;
cin >> d >> li;
char ch[r][c];
for(ll i = 0; i < r; i++) {
for(ll j = 0; j < c; j++) {
cin >> ch[i][j];
if(ch[i][j] == 'M') {
v.push_back({i, j});
}
}
}
ll ans = 0, checker = 0;
for(ll i = 0; i < v.size(); i++) {
ll s = 0;
for(ll k = v[i].first - d; k <= v[i].first + d; k++) {
if(checker == 1) {
checker = 0;
break;
}
for(ll q = v[i].second - d; q <= v[i].second + d; q++) {
if(check(k, q) == 0) continue;
if(ch[k][q] == 'S') s++;
if(s == k) {
ans++;
checker = 1;
break;
}
}
}
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |