# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
456372 | Jasiekstrz | Zoo (COCI19_zoo) | C++17 | 71 ms | 7116 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 fi first
#define se second
using namespace std;
const int N=1e3;
vector<pair<int,int>> moves={{-1,0},{1,0},{0,-1},{0,1}};
char t[N+10][N+10];
int d[N+10][N+10];
queue<pair<int,pair<int,int>>> qq[2];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>t[i][j];
d[i][j]=N*N+10;
if(t[i][j]=='*')
d[i][j]=-1;
}
}
qq[0].push({0,{1,1}});
while(true)
{
int dx;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |