# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921786 | vjudge1 | Collecting Mushrooms (NOI18_collectmushrooms) | C++17 | 2027 ms | 8236 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>
#define ll long long
#define pb push_back
using namespace std;
void solve(){
ll a,b,d,k,t;
cin>>a>>b>>d>>k;
t=a;
vector<pair<ll,ll> >v,l;
char c[a+1][b+1];
for(ll i=1;i<=a;i++){
for(ll j=1;j<=b;j++){
cin>>c[i][j];
if(c[i][j]=='S'){
v.pb({t,j});
}
else if(c[i][j]=='M'){
l.pb({t,j});
}
}
t--;
}
//sort(v.begin(),v.end());
ll ans=0,count=0;
for(ll i=0;i<l.size();i++){
ans=0;
for(ll j=0;j<v.size();j++){
double res=0;
res=sqrt(pow((v[j].first-l[i].first),2)+pow((v[j].second-l[i].second),2));
if(int(res)<=d){
ans++;
}
if(ans>=k){
count++;
break;
}
}
ans=0;
}
cout<<count;
}
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0);
ll t=1,i=1;
//cin>>t;
while(t--){
//cout<<"Case ";
//cout<<i<<':'<<"\n";
//i++;
solve();
}
return 0;
}
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... |