# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
921770 | 2024-02-04T09:59:51 Z | vjudge1 | Collecting Mushrooms (NOI18_collectmushrooms) | C++17 | 2000 ms | 7620 KB |
#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++){ ll res=0; res=sqrt(pow((v[j].first-l[i].first),2)+pow((v[j].second-l[i].second),2)); if(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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 604 KB | Output is correct |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 604 KB | Output is correct |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 6 ms | 348 KB | Output is correct |
3 | Correct | 15 ms | 860 KB | Output is correct |
4 | Correct | 1 ms | 600 KB | Output is correct |
5 | Correct | 1 ms | 604 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 604 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2041 ms | 7620 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 604 KB | Output is correct |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |