# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925627 | vjudge1 | Collecting Mushrooms (NOI18_collectmushrooms) | C++17 | 17 ms | 24804 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 all(a) a.begin(),a.end()
#define pb push_back
#define vt vector
#define endl '\n'
typedef long long ll;
const ll mod=1e9+7;
const ll inf=mod;
const int N=5e5+4;
int n,m,d,r;
void solve(){
cin>>n>>m>>d>>r;
string c[n+10];
int la[n+5][m+5],used[n+5][m+5];
for(int i=0; i<=n+2; ++i) for(int j=0; j<=m+2; ++j) { la[i][j]=0;used[i][j]=0;}
for(int i=1; i<=n; ++i) {
cin>>c[i];
for(int j=1; j<=m; ++j) {
if(c[i][j-1]!='S') continue;
// cout<<i<<' '<<j<<endl;
la[max(i-d,1)][max(j-d,1)]+=1;
la[max(i-d,1)][min(j+d,m+2)+1]-=1;
la[min(i+d,n+2)+1][max(j-d,1)]--;
la[min(i+d,n+2)+1][min(j+d,m+2)+1]++;
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... |