# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1037113 | vjudge1 | Collecting Mushrooms (NOI18_collectmushrooms) | C++17 | 2060 ms | 8036 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;
typedef long long ll;
#define int long long
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int r,c,d,k;
cin >> r >> c >> d >> k;
vector<vector<char>> g(r,vector<char> (c));
vector<pair<int,int>> m,s;
for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
cin >> g[i][j];
if(g[i][j] == 'M'){
m.push_back({i,j});
}
if(g[i][j] == 'S'){
s.push_back({i,j});
}
}
}
int ans=0;
for(int i=0;i<m.size();i++){
int cnt=0;
for(int j=0;j<s.size();j++){
if(max(abs(s[j].first - m[i].first),abs(s[j].second - m[i].second)) <= d){
cnt++;
}
if(cnt >= k){
break;
}
}
if(cnt >= k){
ans++;
}
}
cout << ans << "\n";
}
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... |